A two stage scheduling with transportation and batching

DOI10.1016/J.IPL.2012.06.013zbMath1248.68227OpenAlexW2037067621MaRDI QIDQ456105

Hongli Zhu

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.013

zbMATH Keywords

transportationschedulingNP-hardfully polynomial time approximation scheme

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A two-stage flow shop scheduling problem with transportation considerations ⋮ New results on the coordination of transportation and batching scheduling

Cites Work

• Unnamed Item
• Production scheduling with supply and delivery considerations to minimize the makespan
• The coordination of transportation and batching scheduling
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Approximation algorithms in batch processing
• Supply Chain Scheduling: Batching and Delivery
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Machine scheduling with transportation considerations

This page was built for publication: A two stage scheduling with transportation and batching