Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination

DOI10.1016/j.tcs.2013.04.025zbMath1278.90149OpenAlexW2025130250MaRDI QIDQ387811

Jianming Dong, An Zhang, Yong Chen, Qi-Fan Yang

Publication date: 17 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.025

zbMATH Keywords

approximation algorithmopen shopworst-case analysisbatch and delivery

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (5)

Integrated production-distribution scheduling problem with multiple independent manufacturers ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ 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

• Unnamed Item
• An improved approximation algorithm for single machine scheduling with job delivery
• A note on the complexity of flow shop scheduling with transportation constraints
• On the machine scheduling problem with job delivery coordination
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• Single machine scheduling with batch deliveries
• Heuristics for parallel machine scheduling with delivery times
• Machine scheduling with job delivery coordination
• Scheduling with batching: A review
• Single machine scheduling with release dates and job delivery to minimize the makespan
• Supply Chain Scheduling: Batching and Delivery
• 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
• Open Shop Scheduling to Minimize Finish Time
• Scheduling
• Machine scheduling with transportation considerations

This page was built for publication: Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination