Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery

DOI10.1007/S40305-018-0210-XMaRDI QIDQ2176828zbMATH OpenOpenAlexWikidataFDO

Authors Rubing Chen, Jinjiang Yuan, Lingfa Lu, Li-Qi Zhang

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

zbMATH Keywords

approximation algorithmproduction and deliveryschedulingserial batch

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An improved approximation algorithm for single machine scheduling with job delivery
• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
• An improved algorithm for scheduling two identical machines with batch delivery consideration
• Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
• Approximation algorithm for minimizing total latency in machine scheduling with deliveries
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
• Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
• Scheduling on a batch processing machine with split compatibility graphs

Cites work

• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Machine scheduling with job delivery coordination
• Machine scheduling with transportation considerations
• Restarts can help in the on-line minimization of the maximum delivery time on a single machine
• Savings by Split Delivery Routing
• Scheduling Groups of Jobs on a Single Machine
• Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
• SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
• Split-delivery routeing heuristics in livestock feed distribution
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• The split delivery vehicle routing problem: A survey
• Unbounded parallel batch scheduling with job delivery to minimize makespan

Cited in

(1)

• Integrated production and delivery scheduling on a serial batch machine to minimize the makespan

This page was built for publication: Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176828)