Some dominance properties for single-machine tardiness problems with sequence-dependent setup

DOI10.1080/00207540500543257zbMath1094.90017OpenAlexW2069933763WikidataQ57185933 ScholiaQ57185933MaRDI QIDQ5485050

Xiaochuan Luo, Chengen Wang, Chengbin Chu

Publication date: 28 August 2006

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

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

zbMATH Keywords

branch and bounddue datesingle machinesequence-dependent setupdominance property

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

The third comprehensive survey on scheduling problems with setup times/costs ⋮ A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ Solving the single crane scheduling problem at rail transshipment yards

Cites Work

• Scheduling in a sequence dependent setup environment with genetic search
• Earliness-tardiness scheduling with setup considerations
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• Construction heuristics for the asymmetric TSP.