Single Machine Scheduling with a Common Delivery Window

DOI10.1057/JORS.1996.41MaRDI QIDQ4887716zbMATH OpenOpenAlexFDO

Authors Jose A. Ventura, Michael X. Weng

Publication date 5 August 1996

Published in The 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 relaxationmean absolute deviationnear-optimal solutionsrestricted common delivery windowsingle machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-machine scheduling with a common due window
• Single machine scheduling with batch deliveries
• Single batch machine scheduling with deliveries
• Scheduling with job delivery coordination on single machine
• SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
• Single machine scheduling with delivery dates and cumulative payoffs
• scientific article; zbMATH DE number 6613258
• Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
• A single machine scheduling problem with common due window and controllable processing times
• Single machine scheduling with job delivery to multiple customers

Cited in

(8)

• Single machine scheduling with batch deliveries
• Single machine scheduling with job delivery to multiple customers
• Scheduling with job delivery coordination on single machine
• Earliness and tardiness scheduling problems on a batch processor
• Single machine scheduling with delivery dates and cumulative payoffs
• Single-machine scheduling with a common due window
• Parallel machine scheduling with a common due window
• On scheduling around large restrictive common due windows

This page was built for publication: Single Machine Scheduling with a Common Delivery Window

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