On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes

DOI10.1007/s11766-005-0005-9zbMath1089.90028OpenAlexW1966241559MaRDI QIDQ2574421

Enyu Yao, Yongqiang Shi

Publication date: 21 November 2005

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-005-0005-9

zbMATH Keywords

schedulingmakespancompetitive algorithmon-line

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Scheduling one batch processor subject to job release dates
• Scheduling with batching: A review
• Minimizing total completion time on a batch processing machine with job families
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• On-line algorithms for minimizing makespan on batch processing machines
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling a batch processing machine with non-identical job sizes