Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times

DOI<843::AID-NAV3220410612>3.0.CO;2-K 10.1002/1520-6750(199410)41:6<843::AID-NAV3220410612>3.0.CO;2-KzbMath0827.90080OpenAlexW1982565913MaRDI QIDQ4314863

Michael X. Weng, José A. Ventura

Publication date: 13 December 1995

Full work available at URL: https://doi.org/10.1002/1520-6750(199410)41:6<843::aid-nav3220410612>3.0.co;2-k

zbMATH Keywords

polynomial-time algorithmmean absolute deviation of job completion times\(n\)-job single-machine schedulingdue date with toleranceunrestricted given common due date

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

A survey on scheduling problems with due windows ⋮ Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs ⋮ Single-machine due-window assignment problem with learning effect and deteriorating jobs ⋮ On scheduling around large restrictive common due windows ⋮ Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ Scheduling identical jobs and due-window on uniform machines ⋮ Single machine earliness-tardiness scheduling with resource-dependent release dates ⋮ A two-echelon inventory optimization model with demand time window considerations ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research

This page was built for publication: Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times