Scheduling batch processing machines with incompatible job families
- 1 October 1995
- journal article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 33 (10) , 2685-2708
- https://doi.org/10.1080/00207549508904839
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Minimizing total completion time on batch processing machinesInternational Journal of Production Research, 1993
- Minimizing total completion time on a batch processing machine with job familiesOperations Research Letters, 1993
- Batching and Scheduling Jobs on Batch and Discrete ProcessorsOperations Research, 1992
- Real-time control of multiproduct bulk-service semiconductor manufacturing processesIEEE Transactions on Semiconductor Manufacturing, 1992
- Control of batch processing systems in semiconductor wafer fabrication facilitiesIEEE Transactions on Semiconductor Manufacturing, 1992
- Dynamic batching heuristic for simultaneous processingIEEE Transactions on Semiconductor Manufacturing, 1991
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Introduction to Sequencing and SchedulingOperational Research Quarterly (1970-1977), 1977
- Optimal control of batch service queuesAdvances in Applied Probability, 1973
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969