On-line algorithms for minimizing makespan on batch processing machines

Naval Research Logistics

Volumn 48, Issue 3, 2001, Pages 241-258

  Zhang, Gouchuan ^a   Cai, Xiaoqiang ^b   Wong, C K ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Batch processing; On line algorithm; Worst case analysis

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; ONLINE SYSTEMS; SCHEDULING;

BATCH PROCESSING MACHINES; ONLINE ALGORITHMS;

JOB ANALYSIS;

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

References (10)

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. Scheduling on identical machines: How good is LPT in an on-line setting?
5. Scheduling semiconductor burn-in operations to minimize total flowtime
6. Scheduling algorithms for a single batching processing machine
7. Minimizing makespan on a single batch processing machine with dynamic job arrivals
8. Efficient algorithms for scheduling semiconductor burn-in operations
9. Scheduling with agreeable release times and due dates on a batch processing machine
10. Scheduling one batch processor subject to job release dates