High-multiplicity cyclic job shop scheduling
From MaRDI portal
Publication:957353
DOI10.1016/j.orl.2008.06.005zbMath1210.90089OpenAlexW2070094803MaRDI QIDQ957353
Tracy Kimbrel, M. I. Sviridenko
Publication date: 27 November 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2008.06.005
Related Items (2)
Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ Minimizing the number of workers in a paced mixed-model assembly line
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Paintshop, odd cycles and necklace splitting
- Some complexity results in cyclic scheduling
- On scheduling cycle shops: Classification, complexity and approximation
- The complexity of cyclic shop scheduling problems
- Better Approximation Guarantees for Job-Shop Scheduling
- Improved approximation of Max-Cut on graphs of bounded degree
- MAX CUT in cubic graphs
- Cyclic Schedules for Job Shops with Identical Jobs
- Improved Approximation Algorithms for Shop Scheduling Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Job Shop Scheduling with Unit Processing Times
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
This page was built for publication: High-multiplicity cyclic job shop scheduling
