A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness

DOI10.1016/j.ejor.2005.06.069zbMath1114.90038OpenAlexW1981187536WikidataQ57185847 ScholiaQ57185847MaRDI QIDQ869149

Xiaochuan Luo, Chengbin Chu

Publication date: 26 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.069

zbMATH Keywords

combinatorial optimizationbranch and boundmaximum tardinesssequence-dependent setupsingle machine schedule

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, An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times, Patient scheduling with periodic deteriorating maintenance on single medical device, 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, An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date, A GRASP based on DE to solve single machine scheduling problem with SDST

Cites Work

• Unnamed Item
• Scheduling in a sequence dependent setup environment with genetic search
• Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Impact of sequence-dependent setup time on job shop scheduling performance
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
• Construction heuristics for the asymmetric TSP.