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

DOI10.1080/00207540500543257zbMATH Open1094.90017OpenAlexW2069933763WikidataQ57185933 ScholiaQ57185933MaRDI QIDQ5485050FDOQ5485050

Authors: Xiaochuan Luo, Chengbin Chu, Chengen Wang 

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

Recommendations

• Dominance rules for single machine schedule with sequence dependent setup and due date
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
• A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
• Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
• New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives

zbMATH Keywords

single machinebranch and bounddue datedominance propertysequence-dependent setup

Mathematics Subject Classification ID

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

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.

Cited In (7)

• The third comprehensive survey on scheduling problems with setup times/costs
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
• A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
• Dominance rules for single machine schedule with sequence dependent setup and due date
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• Solving the single crane scheduling problem at rail transshipment yards

This page was built for publication: Some dominance properties for single-machine tardiness problems with sequence-dependent setup

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