Minimizing makespan on a single batching machine with release times and non-identical job sizes
Authors:
- Shuguang LiSLShuguang Li
- Guojun LiGLGuojun Li
- Xiaoli WangXWXiaoli Wang
- Qiming LiuQLQiming Liu
- 1 March 2005
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 33 (2) , 157-164
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A PTAS for Semiconductor Burn-in SchedulingJournal of Combinatorial Optimization, 2005
- Minimizing makespan on a single batch processing machine with nonidentical job sizesNaval Research Logistics (NRL), 2001
- Approximation schemes for minimizing average weighted completion time with release dates1999
- Scheduling a batching machineJournal of Scheduling, 1998
- Scheduling a single batch processing machine with non-identical job sizesInternational Journal of Production Research, 1994
- Efficient Algorithms for Scheduling Semiconductor Burn-In OperationsOperations Research, 1992