A flexible on-line scheduling algorithm for batch machine with infinite capacity

DOI10.1007/S10479-004-5031-0zbMath1119.90021OpenAlexW1993201768MaRDI QIDQ1772971

Chung Keung Poon, Wen-Ci Yu

Publication date: 22 April 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-004-5031-0

zbMATH Keywords

batchschedulingmakespanon-lineunbounded capacity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (19)

Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities ⋮ Optimal on-line algorithms for one batch machine with grouped processing times ⋮ Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time ⋮ An improved on-line algorithm for single parallel-batch machine scheduling with delivery times ⋮ Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan ⋮ An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Online batch scheduling with kind release times and incompatible families to minimize makespan ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ On-line scheduling algorithms for a batch machine with finite capacity ⋮ Optimal online-list batch scheduling ⋮ Online scheduling on unbounded parallel-batch machines to minimize the makespan ⋮ Single machine batch scheduling with release times ⋮ A best online algorithm for scheduling on two parallel batch machines ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan

Cites Work

• Unnamed Item
• Scheduling a batching machine
• Scheduling one batch processor subject to job release dates
• On-line algorithms for minimizing makespan on batch processing machines
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

This page was built for publication: A flexible on-line scheduling algorithm for batch machine with infinite capacity