SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
From MaRDI portal
Publication:3521606
DOI10.1142/S0217595908001596zbMath1144.90386MaRDI QIDQ3521606
Publication date: 26 August 2008
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time, A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
Cites Work
- Machine scheduling with deliveries to multiple customer locations
- The coordination of scheduling and batch deliveries
- 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
- Single machine scheduling with batch deliveries
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- Machine scheduling with job delivery coordination
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- Optimal two- and three-stage production schedules with setup times included
- Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost
- Production and transport logistics scheduling with two transport mode choices
- Integrated Scheduling of Production and Distribution Operations
- Machine scheduling with transportation considerations
