An improved on-line algorithm for single parallel-batch machine scheduling with delivery times

DOI10.1016/J.DAM.2011.12.002zbMath1252.68051OpenAlexW2080477217MaRDI QIDQ423933

J. Herrera, H. S. Yoon

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.002

zbMATH Keywords

competitive ratioon-line schedulingdelivery timesparallel-batch machine

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

Online scheduling on a parallel batch machine with delivery times and limited restarts ⋮ Online scheduling with delivery time on a bounded parallel batch machine with limited restart ⋮ Online NDP-constraint scheduling of jobs with delivery times or weights ⋮ Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint ⋮ Online scheduling on a single machine with linear deteriorating processing times and delivery times ⋮ Online unbounded batch scheduling on parallel machines with delivery times

Cites Work

• Unnamed Item
• Optimal on-line algorithms for one batch machine with grouped processing times
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
• On-line scheduling with delivery time on a single batch machine
• Approximation algorithms in batch processing
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• On-line scheduling algorithms for a batch machine with finite capacity
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
• 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
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

This page was built for publication: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times