Minimizing makespan on a single batch processing machine with nonidentical job sizes

Naval Research Logistics

Volumn 48, Issue 3, 2001, Pages 226-240

  Zhang, Guochuan ^a   Cai, Xiaoqiang ^b   Lee, C Y ^c   Wong, C K ^d  

^a ZHEJIANG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c Department of Electrical and Computer Engineering   (United States)

^d Department of Computer Science and Engineering ^*  (Hong Kong)

Author keywords

Approximation algorithm; Batch processing; Worst case analysis

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; SCHEDULING;

APPROXIMATION ALGORITHM; NONIDENTICAL JOB SIZES; SINGLE BATCH PROCESSING MACHINE;

JOB ANALYSIS;

EID: 0035312958     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.4     Document Type: Article

References (15)

1. Scheduling a batching machine
2. Minimizing total completion time on a batch processing machine with job families
3. Minimizing total completion time on batch processing machines
4. Approximation algorithms for bin packing: A survey, approximation algorithms for NP-hard problems
5. Computers and intractability, a guide to the theory of NP-completeness
6. Minimizing mean flow times criteria on single batch processing machine with nonidentical job sizes
7. Scheduling semiconductor burn-in operations to minimize total flowtime
8. Scheduling algorithms for a single batching processing machine
9. Near-optimal bin packing algorithms
10. Minimizing makespan on a single batch processing machine with dynamic job arrivals
11. Efficient algorithms for scheduling semiconductor burn-in operations
12. Computing near-optimal schedules
13. Scheduling with agreeable release times and due dates on a batch processing machine
14. New worst-case results for the bin packing problem
15. A single batch processing machine with non-identical job sizes