SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN

DOI10.1142/S0217595908001596zbMath1144.90386OpenAlexW2008936567MaRDI QIDQ3521606

Jinjiang Yuan, Ling-Fa Lu

Publication date: 26 August 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595908001596

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Single machine scheduling with job delivery to multiple customers ⋮ Machine Scheduling with a Maintenance Interval and Job Delivery Coordination ⋮ Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time ⋮ PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Machine scheduling with a maintenance interval and job delivery coordination ⋮ Integrated production and delivery scheduling on a serial batch machine to minimize the makespan ⋮ Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness

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

This page was built for publication: SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN