Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families
Authors:
- Shie-Gheun KohSKShie-Gheun Koh
- 1 October 2005
- journal article
- Published by Elsevier in International Journal of Production Economics
- Vol. 98 (1) , 81-96
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Minimizing makespan on a single batch processing machine with dynamic job arrivalsInternational Journal of Production Research, 1999
- Control of a batch-processing machine: A computational approachInternational Journal of Production Research, 1998
- Minimizing total tardiness on a batch processing machine with incompatible job familiesIIE Transactions, 1998
- Managing batch processors to reduce lead time in a semiconductor packaging lineInternational Journal of Production Research, 1997
- Scheduling batch processing machines with incompatible job familiesInternational Journal of Production Research, 1995
- Scheduling a single batch processing machine with non-identical job sizesInternational Journal of Production Research, 1994
- Minimizing total completion time on batch processing machinesInternational Journal of Production Research, 1993
- CONTROL OF MULTIPRODUCT BULK SERVICE DIFFUSION/OXIDATION PROCESSESIIE Transactions, 1992
- Dynamic batching heuristic for simultaneous processingIEEE Transactions on Semiconductor Manufacturing, 1991
- Optimal control of batch service queuesAdvances in Applied Probability, 1973