The Coordination of Two Parallel Machines Scheduling and Batch Deliveries

DOI10.1007/978-3-540-69733-6_66zbMath1148.90322OpenAlexW87715848MaRDI QIDQ3511379

Lixin Tang, Hua Gong

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_66

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• The coordination of scheduling and batch deliveries
• Improved algorithms for two single machine scheduling problems
• On the machine scheduling problem with job delivery coordination
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• Machine scheduling with job delivery coordination
• Scheduling with Fixed Delivery Dates
• Supply Chain Scheduling: Batching and Delivery
• Machine scheduling with transportation considerations

This page was built for publication: The Coordination of Two Parallel Machines Scheduling and Batch Deliveries