Heuristics for parallel machine scheduling with batch delivery consideration

DOI10.3934/JIMO.2014.10.259MaRDI QIDQ380563zbMATH OpenOpenAlexFDO

Authors Leiyang Wang, Zhaohui Liu

Publication date 14 November 2013

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2014.10.259

zbMATH Keywords

approximation algorithmschedulingbatch delivery

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Parallel machine scheduling with job delivery coordination
• Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
• Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
• An improved algorithm for scheduling two identical machines with batch delivery consideration
• Unbounded parallel batch scheduling with job delivery to minimize makespan

Cites work

• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Integrated Scheduling of Production and Distribution Operations
• Machine scheduling with an availability constraint and job delivery coordination
• Machine scheduling with deliveries to multiple customer locations
• Machine scheduling with job delivery coordination
• Machine scheduling with transportation considerations
• On the machine scheduling problem with job delivery coordination
• Order Assignment and Scheduling in a Supply Chain
• The coordination of scheduling and batch deliveries
• The integrated production and transportation scheduling problem for a product with a short lifespan

Cited in

(7)

• Parallel-machine scheduling to minimize flowtime, holding, and batch delivery costs
• The coordination of single-machine scheduling with availability constraints and delivery
• Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
• Unbounded parallel batch scheduling with job delivery to minimize makespan
• An improved algorithm for scheduling two identical machines with batch delivery consideration
• Parallel machine scheduling with batch delivery to two customers
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination

This page was built for publication: Heuristics for parallel machine scheduling with batch delivery consideration

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