Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery
From MaRDI portal
Publication:2176828
DOI10.1007/s40305-018-0210-xzbMath1449.90097OpenAlexW2843928000MaRDI QIDQ2176828
Rubing Chen, Jinjiang Yuan, Li-Qi Zhang, Ling-Fa Lu
Publication date: 5 May 2020
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-0210-x
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- Machine scheduling with job delivery coordination
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- The Split Delivery Vehicle Routing Problem: A Survey
- Savings by Split Delivery Routing
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Split-delivery routeing heuristics in livestock feed distribution
- Scheduling Groups of Jobs on a Single Machine
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Machine scheduling with transportation considerations
This page was built for publication: Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery
