MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINE
- 3 January 1997
- journal article
- Published by SAGE Publications in Production and Operations Management
- Vol. 6 (1) , 57-73
- https://doi.org/10.1111/j.1937-5956.1997.tb00415.x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART II: SHOP-FLOOR CONTROLIIE Transactions, 1994
- 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
- Minimizing total completion time on a batch processing machine with job familiesOperations Research Letters, 1993
- A shifting bottleneck algorithm for scheduling semiconductor testing operationsJournal of Electronics Manufacturing, 1992
- Batching and Scheduling Jobs on Batch and Discrete ProcessorsOperations Research, 1992
- Dynamic batching heuristic for simultaneous processingIEEE Transactions on Semiconductor Manufacturing, 1991
- Efficient scheduling algorithms for a single batch processing machineOperations Research Letters, 1986
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Bounds for the Optimal Scheduling of n Jobs on m ProcessorsManagement Science, 1964