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

DOI10.1016/J.TCS.2016.01.001zbMath1335.90043OpenAlexW2238711951MaRDI QIDQ905848

Jinjiang Yuan, Ruyan Fu, Qian Wang, Ji Tian

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

competitive ratioonline schedulingbatch machinedrop-line

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times ⋮ An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart

Cites Work

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

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