Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
Authors:
- N. Rafiee ParsaNPN. Rafiee Parsa
- B. KarimiB. Karimi
- S.M. Moattar HusseiniSHS.M. Moattar Husseini
- 1 April 2017
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 80, 173-183
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Makespan minimization on single batch-processing machine via ant colony optimizationComputers & Operations Research, 2012
- Solving single batch-processing machine problems using an iterated heuristicInternational Journal of Production Research, 2011
- Scheduling a batch processing machine with non-identical job sizes: a clustering perspectiveInternational Journal of Production Research, 2011
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizesComputers & Operations Research, 2010
- Decomposition heuristics for minimizing earliness–tardiness on parallel burn-in ovens with a common due dateComputers & Operations Research, 2007
- Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedureComputers & Operations Research, 2002
- Scheduling with batching: A reviewEuropean Journal of Operational Research, 2000
- Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizesInternational Journal of Production Economics, 1998
- Scheduling a single batch processing machine with non-identical job sizesInternational Journal of Production Research, 1994
- Single‐ and multiple‐processor models for minimizing completion time varianceNaval Research Logistics Quarterly, 1986