Preemptive scheduling with release dates, delivery times and sequence independent setup times
From MaRDI portal
Publication:1331546
DOI10.1016/0377-2217(94)90006-XzbMath0806.90069OpenAlexW1975302205MaRDI QIDQ1331546
Publication date: 21 August 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90006-x
single-machine schedulingNP-hardheuristic algorithmworst-case analysisprocessing timepreemptiondelivery timetight worst-case performance bound
Related Items (5)
Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting ⋮ A sequencing problem with family setup times ⋮ Resource constrained project scheduling subject to due dates: preemption permitted with penalty ⋮ Integrated scheduling of production and distribution with release dates and capacitated deliveries
Cites Work
- Unnamed Item
- Unnamed Item
- A block approach for single-machine scheduling with release dates and due dates
- The one-machine sequencing problem
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- Optimal two- and three-stage production schedules with setup times included
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the Complexity of Scheduling with Batch Setup Times
This page was built for publication: Preemptive scheduling with release dates, delivery times and sequence independent setup times
