An improved approximation algorithm for a scheduling problem with transporter coordination
From MaRDI portal
Publication:6204661
DOI10.1007/s10951-022-00762-6MaRDI QIDQ6204661
Jacek Błażewicz, Xin Han, Yong Zhang, Yinling Wang
Publication date: 2 April 2024
Published in: Journal of Scheduling (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- On the machine scheduling problem with job delivery coordination
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- Heuristics for parallel machine scheduling with delivery times
- Vehicle scheduling in two-cycle flexible manufacturing systems
- Machine scheduling with job delivery coordination
- Optimal two- and three-stage production schedules with setup times included
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Groups of Jobs on a Single Machine
- Handbook on Scheduling
- Machine scheduling with transportation considerations
- Makespan minimization for flow-shop problems with transportation times and a single robot
This page was built for publication: An improved approximation algorithm for a scheduling problem with transporter coordination
