default search action
Subhash C. Sarin
Person information
- affiliation: Virginia Polytechnic Institute and State University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j37]Sanchit Singh, Subhash C. Sarin, Sandeep Singh Sangha:
Nested benders decomposition for a deterministic biomass feedstock logistics problem. J. Glob. Optim. 91(1): 95-127 (2025) - 2024
- [j36]Sanchit Singh, Subhash C. Sarin:
Modeling and analysis of a new production methodology for achieving mass customization. Int. J. Prod. Res. 62(1-2): 183-203 (2024) - [j35]Sanchit Singh, Subhash C. Sarin, Ming Cheng:
Single-lot, lot-streaming problem for a 1 + m hybrid flow shop. J. Glob. Optim. 89(2): 435-455 (2024) - 2023
- [j34]Niloy J. Mukherjee, Subhash C. Sarin, Daniel A. Neira:
Lot streaming for a two-stage assembly system in the presence of handling costs. J. Sched. 26(4): 335-351 (2023) - 2022
- [j33]Maichel M. Aguayo, Francisco N. Avilés, Subhash C. Sarin, Hanif D. Sherali:
A Two-Index Formulation for the Fixed-Destination Multi-Depot Asymmetric Travelling Salesman Problem and Some Extensions. Informatica 33(4): 671-692 (2022) - 2021
- [j32]Jie Zhang, Weijun Xie, Subhash C. Sarin:
Robust multi-product newsvendor model with uncertain demand and substitution. Eur. J. Oper. Res. 293(1): 190-202 (2021) - [j31]Jie Zhang, Weijun Xie, Subhash C. Sarin:
Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective. INFORMS J. Comput. 33(3): 1229-1244 (2021) - [c5]Vignesh Dhanapal, Subhash C. Sarin:
Distribution of Vaccines During a Pandemic (Covid-19). APMS (4) 2021: 39-48 - 2020
- [j30]Ming Cheng, Subhash C. Sarin:
Lot streaming in a two-stage assembly system. Annu. Rev. Control. 50: 303-316 (2020)
2010 – 2019
- 2019
- [j29]Sarat Kumar Jena, Sarada Prasad Sarmah, Subhash C. Sarin:
Price competition between high and low brand products considering coordination strategy. Comput. Ind. Eng. 130: 500-511 (2019) - [j28]Maichel M. Aguayo, Subhash C. Sarin, John S. Cundiff:
A branch-and-price approach for a biomass feedstock logistics supply chain design problem. IISE Trans. 51(12): 1348-1364 (2019) - 2018
- [j27]Fangzhou Sun, Maichel M. Aguayo, Rahul Ramachandran, Subhash C. Sarin:
Biomass feedstock supply chain design - a taxonomic review and a decomposition-based methodology. Int. J. Prod. Res. 56(17): 5626-5659 (2018) - [j26]Maichel M. Aguayo, Subhash C. Sarin, Hanif D. Sherali:
Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions. J. Oper. Res. Soc. 69(5): 734-746 (2018) - [j25]Niloy J. Mukherjee, Subhash C. Sarin:
Comparison of single sourcing (with lot streaming) and dual-sourcing. J. Oper. Res. Soc. 69(11): 1701-1710 (2018) - 2017
- [j24]Sarat Kumar Jena, Sarada Prasad Sarmah, Subhash C. Sarin:
Joint-advertising for collection of returned products in a closed-loop supply chain under uncertain environment. Comput. Ind. Eng. 113: 305-322 (2017) - [j23]Niloy J. Mukherjee, Subhash C. Sarin, Sanchit Singh:
Lot streaming in the presence of learning in sublot-attached setup times and processing times. Int. J. Prod. Res. 55(6): 1623-1639 (2017) - [j22]Daniel W. Steeneck, Subhash C. Sarin:
Determining end-of-life policy for recoverable products. Int. J. Prod. Res. 55(19): 5782-5800 (2017) - 2016
- [j21]Ming Cheng, Subhash C. Sarin, Sanchit Singh:
Two-stage, single-lot, lot streaming problem for a 1 + 2 hybrid flow shop. J. Glob. Optim. 66(2): 263-290 (2016) - 2015
- [j20]Daniel W. Steeneck, Subhash C. Sarin:
Resource-constrained project scheduling with concave processing rate functions. J. Oper. Res. Soc. 66(5): 794-806 (2015) - 2014
- [j19]Subhash C. Sarin, Hanif D. Sherali, Jason D. Judd, Pei-Fang Jennifer Tsai:
Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations. Comput. Oper. Res. 51: 64-89 (2014) - [j18]Subhash C. Sarin, Hanif D. Sherali, Lingrui Liao:
Minimizing conditional-value-at-risk for stochastic scheduling problems. J. Sched. 17(1): 5-15 (2014) - [c4]Liming Yao, Subhash C. Sarin:
Multiple-Lot Lot Streaming in a Two-stage Assembly System. Essays in Production, Project Planning and Scheduling 2014: 357-388 - [e1]P. Simin Pulat, Subhash C. Sarin, Reha Uzsoy:
Essays in Production, Project Planning and Scheduling, A Festschrift in Honor of Salah Elmaghraby. International Series in Operations Research & Management Science 200, Springer 2014, ISBN 978-1-4614-9055-5 [contents] - 2013
- [c3]Subhash C. Sarin, Ming Cheng:
Two-Stage, Multiple-Lot, Lot Streaming Problem for a 1 + 2 Hybrid Flow Shop. MIM 2013: 448-453 - 2012
- [j17]Subhash C. Sarin, Lixin Wang, Ming Cheng:
A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times. Comput. Oper. Res. 39(7): 1411-1418 (2012) - [j16]Lingrui Liao, Subhash C. Sarin, Hanif D. Sherali:
A scenario generation-based lower bounding approach for stochastic scheduling problems. J. Oper. Res. Soc. 63(10): 1410-1420 (2012) - 2011
- [j15]Subhash C. Sarin, Hanif D. Sherali, Liming Yao:
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem. Optim. Lett. 5(2): 259-272 (2011) - 2010
- [j14]Subhash C. Sarin, Yuqiang Wang, Amrusha Varadarajan:
A university-timetabling problem and its solution using Benders' partitioning - a case study. J. Sched. 13(2): 131-141 (2010)
2000 – 2009
- 2009
- [j13]Subhash C. Sarin, Balaji Nagarajan, Sanjay Jain, Lingrui Liao:
Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability. J. Comb. Optim. 17(4): 400-416 (2009) - 2008
- [j12]Yuval Cohen, Gad Vitner, Subhash C. Sarin:
Work allocation to stations with varying learning slopes and without buffers. Eur. J. Oper. Res. 184(2): 797-801 (2008) - [j11]Yuval Cohen, Ezey M. Dar-El, Gad Vitner, Subhash C. Sarin:
Allocation of work to the stations of an assembly line with buffers between stations and three general learning patterns. Int. J. Intell. Syst. Technol. Appl. 4(1/2): 123-140 (2008) - [j10]Yuval Cohen, Ezey M. Dar-El, Gad Vitner, Subhash C. Sarin:
Optimal layout and work allocation in batch assembly under learning effect. Int. J. Intell. Syst. Technol. Appl. 4(1/2): 188-207 (2008) - 2007
- [c2]Subhash C. Sarin, Vinod D. Shenai, Lixin Wang:
Releasing and Scheduling of Lots in a Wafer Fab. AAIM 2007: 108-119 - 2006
- [j9]Hanif D. Sherali, Subhash C. Sarin, Pei-Fang Tsai:
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints. Discret. Optim. 3(1): 20-32 (2006) - [j8]Subhash C. Sarin, Michael P. Greco, Ezey M. Dar-El:
Sequencing and loading of products on a flowline. Eur. J. Oper. Res. 168(3): 905-921 (2006) - [j7]Yuval Cohen, Gad Vitner, Subhash C. Sarin:
Optimal allocation of work in assembly lines for lots with homogenous learning. Eur. J. Oper. Res. 168(3): 922-931 (2006) - [j6]Yossi Bukchin, Subhash C. Sarin:
Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle. Eur. J. Oper. Res. 174(2): 1329-1337 (2006) - 2005
- [j5]Subhash C. Sarin, Hanif D. Sherali, Ajay Bhootra:
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper. Res. Lett. 33(1): 62-70 (2005) - [c1]Subhash C. Sarin, Yuqiang Wang, Dae B. Chang:
A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint. AAIM 2005: 440-449 - 2004
- [j4]Subhash C. Sarin, Divya Prakash:
Equal Processing Time Bicriteria Scheduling on Parallel Machines. J. Comb. Optim. 8(3): 227-240 (2004) - 2003
- [j3]Adar A. Kalir, Subhash C. Sarin:
Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups. J. Comb. Optim. 7(1): 23-44 (2003) - 2001
- [j2]Adar A. Kalir, Subhash C. Sarin:
Optimal Solutions for the Single Batch, Flow Shop, Lot-streaming Problem with Equal Sublots. Decis. Sci. 32(2): 387-398 (2001) - [j1]Subhash C. Sarin, Sanjay Aggarwal:
Modeling and algorithmic development of a staff scheduling problem. Eur. J. Oper. Res. 128(3): 558-569 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-24 18:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint