Single Machine Scheduling with a Common Delivery Window

DOI10.1057/jors.1996.41zbMath0852.90092OpenAlexW2019297080MaRDI QIDQ4887716

José A. Ventura, Michael X. Weng

Publication date: 5 August 1996

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1996.41

zbMATH Keywords

Lagrangian relaxationsingle machine schedulingmean absolute deviationnear-optimal solutionsrestricted common delivery window

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Earliness and tardiness scheduling problems on a batch processor ⋮ Single-machine scheduling with a common due window ⋮ On scheduling around large restrictive common due windows ⋮ Parallel machine scheduling with a common due window