Bounds for naive multiple machine scheduling with release times and deadlines

DOI10.1016/0196-6774(84)90035-XzbMath0535.68018MaRDI QIDQ3319773

Dan Gusfield

Publication date: 1984

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

zbMATH Keywords

minimum latenessmultiple machine schedulingon-line polynomial time heuristic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Makespan minimization on uniform parallel machines with release times ⋮ Energetic reasoning revisited: Application to parallel machine scheduling ⋮ Task scheduling in networks ⋮ Scheduling parallel jobs to minimize the makespan ⋮ An approximate decomposition algorithm for scheduling on parallel machines with heads and tails ⋮ Improved approximation algorithms for parallel machine scheduling with release dates and job rejection ⋮ Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times ⋮ Heuristic methods and applications: A categorized survey ⋮ Approximation scheduling algorithms: a survey ⋮ Scheduling on uniform parallel machines to minimize maximum lateness ⋮ Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times ⋮ Minimizing makespan on parallel machines subject to release dates and delivery times

This page was built for publication: Bounds for naive multiple machine scheduling with release times and deadlines