Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
Authors:
- P. DamodaranPDP. Damodaran
- K. SrihariKSK. Srihari
- 1 December 2004
- journal article
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 40 (13) , 1465-1472
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealingInternational Journal of Production Economics, 2004
- Minimizing makespan on a single burn-in oven in semiconductor manufacturingEuropean Journal of Operational Research, 2000
- Scheduling with batching: A reviewEuropean Journal of Operational Research, 2000
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch sizeMathematical and Computer Modelling, 1999
- Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizesInternational Journal of Production Economics, 1998
- Scheduling Semiconductor Burn-In Operations to Minimize Total FlowtimeOperations Research, 1997
- Scheduling with agreeable release times and due dates on a batch processing machineEuropean Journal of Operational Research, 1997
- Scheduling a single batch processing machine with non-identical job sizesInternational Journal of Production Research, 1994
- Minimizing total completion time on a batch processing machine with job familiesOperations Research Letters, 1993
- Efficient scheduling algorithms for a single batch processing machineOperations Research Letters, 1986