Minimizing the total completion time on-line on a single machine, using restarts

DOI10.1016/j.jalgor.2004.10.001zbMath1101.68434OpenAlexW2064323841MaRDI QIDQ5711727

Han La Poutré, Rob van Stee

Publication date: 8 December 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.10.001

Mathematics Subject Classification ID

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

Related Items (14)

Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart ⋮ Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time ⋮ Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time ⋮ Online scheduling with delivery time on a bounded parallel batch machine with limited restart ⋮ Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling ⋮ Online Single Machine Scheduling to Minimize the Maximum Starting Time ⋮ An optimal online algorithm for single machine scheduling to minimize total general completion time ⋮ Optimal algorithms for online single machine scheduling with deteriorating jobs ⋮ A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan ⋮ On-line scheduling on a batch machine to minimize makespan with limited restarts ⋮ Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart ⋮ Online scheduling in a parallel batch processing system to minimize makespan using restarts ⋮ Online scheduling to minimize modified total tardiness with an availability constraint ⋮ An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart

This page was built for publication: Minimizing the total completion time on-line on a single machine, using restarts