SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN

DOI10.1142/S0217595908001596MaRDI QIDQ3521606zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Lingfa 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)

Recommendations

• Scheduling with job delivery coordination on single machine
• Machine scheduling with job delivery coordination
• Single machine scheduling with job delivery to multiple customers
• An improved approximation algorithm for single machine scheduling with job delivery
• Two parallel machines scheduling with two-vehicle job delivery to minimize makespan

Cites work

• A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
• A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
• Integrated Scheduling of Production and Distribution Operations
• Machine scheduling with deliveries to multiple customer locations
• Machine scheduling with job delivery coordination
• Machine scheduling with transportation considerations
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• Optimal two- and three-stage production schedules with set-up time included
• Production and transport logistics scheduling with two transport mode choices
• Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
• Single machine scheduling with batch deliveries
• The coordination of scheduling and batch deliveries

Cited in

(20)

• Single machine scheduling with batch deliveries
• Single machine scheduling with job delivery to multiple customers
• Scheduling with job delivery coordination on single machine
• Machine scheduling with job delivery coordination
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
• Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery
• Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
• Single machine scheduling with delivery dates and cumulative payoffs
• A single-machine deteriorating job scheduling problem with a non-regular criterion
• Machine scheduling with a maintenance interval and job delivery coordination
• Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
• Single Machine Scheduling with a Common Delivery Window
• Machine scheduling with a maintenance interval and job delivery coordination
• A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
• Parallel machine scheduling with job delivery coordination
• Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
• Flow shop scheduling problems with transportation constraints revisited
• An improved approximation algorithm for single machine scheduling with job delivery

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521606)