Non-preemptive Scheduling on Machines with Setup Times

DOI10.1007/978-3-319-21840-3_45zbMath1451.90065arXiv1504.07066OpenAlexW2254417378MaRDI QIDQ3449852

Manuel Malatyali, Friedhelm Meyer auf der Heide, Alexander Mäcker, Sören Riechers

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.07066

zbMATH Keywords

schedulingapproximation algorithmssetup times

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (3)

Non-preemptive Scheduling on Machines with Setup Times ⋮ Unnamed Item ⋮ Empowering the configuration-IP: new PTAS results for scheduling with setup times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An online algorithm for a problem in scheduling with set-ups and release times
• Modeling of two-phase flows with surface tension by finite pointset method (FPM)
• Approximation schemes for scheduling on parallel machines
• A one-dimensional bin packing problem with shelf divisions
• Non-preemptive Scheduling on Machines with Setup Times
• A note on dual approximation algorithms for class constrained bin packing problems
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

This page was built for publication: Non-preemptive Scheduling on Machines with Setup Times