A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
From MaRDI portal
Publication:5244301
DOI10.1051/ro/2018097zbMath1425.90049OpenAlexW2898780166WikidataQ129075170 ScholiaQ129075170MaRDI QIDQ5244301
Publication date: 20 November 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2018097
Related Items (1)
Cites Work
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
- An improved approximation algorithm for single machine scheduling with job delivery
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- Machine scheduling with job delivery coordination
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Single machine scheduling with release dates and job delivery to minimize the makespan
- Logistics scheduling with batching and transportation
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Production and transport logistics scheduling with two transport mode choices
- Integrated Scheduling of Production and Distribution Operations
- Supply Chain Scheduling: Batching and Delivery
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Machine scheduling with transportation considerations
This page was built for publication: A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
