Scheduling job families about an unrestricted common due date on a single machine

DOI10.1080/002075497195344zbMath0942.90547OpenAlexW2112230124MaRDI QIDQ4252121

No author found.

Publication date: 21 August 2000

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075497195344

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time, Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach, Scheduling with returnable containers, Integrated batch sizing and scheduling on a single machine, A survey of scheduling problems with setup times or costs, Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date, Multicriteria scheduling problems: a survey, Earliness-tardiness scheduling with setup considerations, Batch sizing and just-in-time scheduling with common due date, Counting and enumeration complexity with application to multicriteria scheduling, A survey of the state-of-the-art of common due date assignment and scheduling research