Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- 28 February 2005
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 32 (2) , 327-341
- https://doi.org/10.1016/s0305-0548(03)00239-9
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Minimizing makespan on a single batch processing machine with dynamic job arrivalsInternational Journal of Production Research, 1999
- Towards a knowledge-based scheduling system for semiconductor testingInternational Journal of Production Research, 1998
- Scheduling of mask shop E-beam writersIEEE Transactions on Semiconductor Manufacturing, 1998
- Minimizing total tardiness on a batch processing machine with incompatible job familiesIIE Transactions, 1998
- MINIMIZING MAXIMUM COMPLETION TIME IN A TWO-BATCH-PROCESSING-MACHINE FLOWSHOP WITH DYNAMIC ARRIVALS ALLOWEDEngineering Optimization, 1997
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINEProduction and Operations Management, 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 batch processing systems in semiconductor wafer fabrication facilitiesIEEE Transactions on Semiconductor Manufacturing, 1992