Splitting versus setup trade-offs for scheduling to minimize weighted completion time
From MaRDI portal
Publication:1694777
DOI10.1016/j.orl.2016.04.011zbMath1380.90111OpenAlexW2371170001WikidataQ65553893 ScholiaQ65553893MaRDI QIDQ1694777
José Verschae, José R. Correa, Víctor Verdugo
Publication date: 6 February 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.04.011
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 ⋮ Approximating Weighted Completion Time for Order Scheduling with Setup Times ⋮ Unnamed Item ⋮ Empowering the configuration-IP: new PTAS results for scheduling with setup times
Cites Work
- Lot-sizing scheduling with batch setup times
- Strong LP formulations for scheduling splittable jobs on unrelated machines
- Parallel machine scheduling with splitting jobs
- Split scheduling with uniform setup times
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
- A survey of scheduling problems with setup times or costs
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
- Dual Techniques for Scheduling on a Machine with Varying Speed
- Scheduling Jobs on Several Machines with the Job Splitting Property
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
This page was built for publication: Splitting versus setup trade-offs for scheduling to minimize weighted completion time
