Subhash C. Sarin

Orcid: 0000-0002-1744-2281

Affiliations:
  • Virginia Polytechnic Institute and State University


According to our database1, Subhash C. Sarin authored at least 40 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Modeling and analysis of a new production methodology for achieving mass customization.
Int. J. Prod. Res., January, 2024

2023
Lot streaming for a two-stage assembly system in the presence of handling costs.
J. Sched., August, 2023

2022
A Two-Index Formulation for the Fixed-Destination Multi-Depot Asymmetric Travelling Salesman Problem and Some Extensions.
Informatica, 2022

2021
Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective.
INFORMS J. Comput., 2021

Robust multi-product newsvendor model with uncertain demand and substitution.
Eur. J. Oper. Res., 2021

Distribution of Vaccines During a Pandemic (Covid-19).
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

2020
Lot streaming in a two-stage assembly system.
Annu. Rev. Control., 2020

2019
A branch-and-price approach for a biomass feedstock logistics supply chain design problem.
IISE Trans., 2019

Price competition between high and low brand products considering coordination strategy.
Comput. Ind. Eng., 2019

2018
Comparison of single sourcing (with lot streaming) and dual-sourcing.
J. Oper. Res. Soc., 2018

Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions.
J. Oper. Res. Soc., 2018

Biomass feedstock supply chain design - a taxonomic review and a decomposition-based methodology.
Int. J. Prod. Res., 2018

2017
Determining end-of-life policy for recoverable products.
Int. J. Prod. Res., 2017

Lot streaming in the presence of learning in sublot-attached setup times and processing times.
Int. J. Prod. Res., 2017

Joint-advertising for collection of returned products in a closed-loop supply chain under uncertain environment.
Comput. Ind. Eng., 2017

2016
Two-stage, single-lot, lot streaming problem for a 1 + 2 hybrid flow shop.
J. Glob. Optim., 2016

2015
Resource-constrained project scheduling with concave processing rate functions.
J. Oper. Res. Soc., 2015

2014
Minimizing conditional-value-at-risk for stochastic scheduling problems.
J. Sched., 2014

Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations.
Comput. Oper. Res., 2014

Multiple-Lot Lot Streaming in a Two-stage Assembly System.
Proceedings of the Essays in Production, 2014

2013
Two-Stage, Multiple-Lot, Lot Streaming Problem for a 1 + 2 Hybrid Flow Shop.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2012
A scenario generation-based lower bounding approach for stochastic scheduling problems.
J. Oper. Res. Soc., 2012

A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times.
Comput. Oper. Res., 2012

2011
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem.
Optim. Lett., 2011

2010
A university-timetabling problem and its solution using Benders' partitioning - a case study.
J. Sched., 2010

2009
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., 2009

2008
Optimal layout and work allocation in batch assembly under learning effect.
Int. J. Intell. Syst. Technol. Appl., 2008

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., 2008

Work allocation to stations with varying learning slopes and without buffers.
Eur. J. Oper. Res., 2008

2007
Releasing and Scheduling of Lots in a Wafer Fab.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Sequencing and loading of products on a flowline.
Eur. J. Oper. Res., 2006

Optimal allocation of work in assembly lines for lots with homogenous learning.
Eur. J. Oper. Res., 2006

Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle.
Eur. J. Oper. Res., 2006

A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints.
Discret. Optim., 2006

2005
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints.
Oper. Res. Lett., 2005

A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Equal Processing Time Bicriteria Scheduling on Parallel Machines.
J. Comb. Optim., 2004

2003
Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups.
J. Comb. Optim., 2003

2001
Modeling and algorithmic development of a staff scheduling problem.
Eur. J. Oper. Res., 2001

Optimal Solutions for the Single Batch, Flow Shop, Lot-streaming Problem with Equal Sublots.
Decis. Sci., 2001


  Loading...