Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time

DOI10.1016/J.TCS.2016.01.001MaRDI QIDQ905848zbMATH OpenOpenAlexFDO

Authors Ji Tian, Qian Wang, Ruyan Fu, Jinjiang Yuan

Publication date 28 January 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.01.001

zbMATH Keywords

batch machinecompetitive ratiodrop-lineonline scheduling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
• Online batch scheduling on parallel machines with delivery times
• Online algorithms for batch machines scheduling with delivery times
• Online unbounded batch scheduling on parallel machines with delivery times
• On-line scheduling with delivery time on a single batch machine

Cites work

• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Online batch scheduling on parallel machines with delivery times
• Online over time scheduling on parallel-batch machines: a survey
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• Online unbounded batch scheduling on parallel machines with delivery times

Cited in

(8)

• Unbounded parallel-batch scheduling with drop-line tasks
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
• Online unbounded batch scheduling on parallel machines with delivery times
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
• The bounded parallel-batching scheduling with drop-line jobs to minimize total completion time
• An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
• Min-max scheduling of batch or drop-line jobs under agreeable release and processing times

This page was built for publication: Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905848)