An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date

DOI10.1016/0167-6377(95)00006-6zbMath0842.90067OpenAlexW2021019029WikidataQ127352544 ScholiaQ127352544MaRDI QIDQ1905077

José A. Ventura, Michael X. Weng

Publication date: 25 February 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00006-6

zbMATH Keywords

single machinecommon due datemean absolute deviationmean earliness and tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey, Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date, Single machine weighted earliness-tardiness penalty problem with a common due date, Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval, Single-machine common due date total earliness/tardiness scheduling with machine unavailability, Single machine earliness-tardiness scheduling with resource-dependent release dates, A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• Unnamed Item
• Scheduling around a small common due date
• Minimizing the average deviation of job completion times about a common due date
• Minimizing mean absolute deviation of completion times about a common due date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date