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.069zbMATH Open1114.90038DBLPjournals/eor/LuoC07OpenAlexW1981187536WikidataQ57185847 ScholiaQ57185847MaRDI QIDQ869149FDOQ869149

Authors: 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

Recommendations

• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
• Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
• Some dominance properties for single-machine tardiness problems with sequence-dependent setup
• Dominance rules for single machine schedule with sequence dependent setup and due date
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

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)

Cites Work

• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
• Title not available (Why is that?)
• Scheduling in a sequence dependent setup environment with genetic search
• Construction heuristics for the asymmetric TSP.
• 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
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Impact of sequence-dependent setup time on job shop scheduling performance
• Job shop scheduling with group-dependent setups, finite buffers, and long time horizon

Cited In (17)

• An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date
• Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
• Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• 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
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
• A GRASP based on DE to solve single machine scheduling problem with SDST
• Some dominance properties for single-machine tardiness problems with sequence-dependent setup
• A max-min ant system to minimize total tardiness on a single machine with sequence dependent setup times implementing a limited budget local search
• 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
• Patient scheduling with periodic deteriorating maintenance on single medical device
• Minimizing sum of completion times on a single machine with sequence-dependent family setup times
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• Solving the single crane scheduling problem at rail transshipment yards
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness

This page was built for publication: A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness

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