Split scheduling with uniform setup times

DOI10.1007/s10951-014-0370-4zbMath1312.90023arXiv1212.1754OpenAlexW2068921802MaRDI QIDQ2341391

Frans Schalekamp, Anke van Zuylen, Suzanne Van der Ster, R. A. Sitters, Leen Stougie, Víctor Verdugo

Publication date: 24 April 2015

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

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

zbMATH Keywords

schedulingapproximation algorithmscomplexity theorysetup timesjob splitting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel numerical computation (65Y05) Approximation algorithms (68W25)

Related Items (5)

Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility ⋮ Strong LP formulations for scheduling splittable jobs on unrelated machines ⋮ Splitting versus setup trade-offs for scheduling to minimize weighted completion time ⋮ Unnamed Item ⋮ Empowering the configuration-IP: new PTAS results for scheduling with setup times

Cites Work

• Unnamed Item
• Lot-sizing scheduling with batch setup times
• Minimizing mean flow time with release time constraint
• Scheduling for parallel processing
• The mystical power of twoness: In memoriam Eugene L. Lawler
• Parallel machine scheduling with splitting jobs
• Minimizing total completion time subject to job release dates and preemption penalties
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Split scheduling with uniform setup times