Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs

DOI10.1016/J.COR.2014.08.012zbMATH Open1348.90234OpenAlexW2069633381MaRDI QIDQ337279FDOQ337279

Authors: Fardin Ahmadizar, Soma Farhadi 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.08.012

Recommendations

• Single-machine common due window assignment and scheduling to minimize the total cost
• Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
• Single machine scheduling with batch deliveries
• Single machine batch scheduling with release times and delivery costs
• A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

zbMATH Keywords

schedulingsingle-machinerelease datesbatch deliverydominance propertiesdue windowsimperialist competitive algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Single machine scheduling with batch deliveries
• Supply Chain Scheduling: Batching and Delivery
• Sequencing with Earliness and Tardiness Penalties: A Review
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Bi-criteria single machine scheduling with a time-dependent learning effect and release times
• Title not available (Why is that?)
• Single-machine batch scheduling minimizing weighted flow times and delivery costs
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
• Batch delivery scheduling with batch delivery cost on a single machine
• A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

Cited In (7)

• Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
• Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing
• Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows
• Minimizing maximum tardiness on a single machine with family setup times and machine disruption
• A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
• Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
• Due-window assignment scheduling problems with position-dependent weights on a single machine

This page was built for publication: Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs

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