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

DOI10.1016/J.AMC.2006.05.127MaRDI QIDQ864814zbMATH OpenOpenAlexFDO

Authors Xiaochuan Luo, Feng Chu

Publication date 13 February 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.05.127

zbMATH Keywords

branch and boundsequence-dependent setupsingle machine scheduletotal tardiness

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
• Some dominance properties for single-machine tardiness problems with sequence-dependent setup
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• Dominance rules for single machine schedule with sequence dependent setup and due date
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times

Cites work

• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
• Construction heuristics for the asymmetric TSP.
• Earliness-tardiness scheduling with setup considerations
• scientific article; zbMATH DE number 3425355 (Why is no real title available?)
• Impact of sequence-dependent setup time on job shop scheduling performance
• Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
• Minimizing the earliness--tardiness costs on a single machine
• Minimizing Total Costs in One-Machine Scheduling
• Minimizing Total Tardiness on One Machine is NP-Hard
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
• Scheduling in a sequence dependent setup environment with genetic search

Cited in

(27)

• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• 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
• A branch \& bound method for the general-shop problem with sequence dependent setup-times
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• Solving the single crane scheduling problem at rail transshipment yards
• New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
• Algorithms for single machine total tardiness scheduling with sequence dependent setups
• A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
• A max-min ant system to minimize total tardiness on a single machine with sequence dependent setup times implementing a limited budget local search
• The third comprehensive survey on scheduling problems with setup times/costs
• A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
• Lower bounds for tardiness minimization on a single machine with family setup times
• On the Single-machine Scheduling Problem with Tardiness Penalties
• 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
• Scheduling with shutdowns and sequence dependent set-up times
• Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
• A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
• Minimizing sum of completion times on a single machine with sequence-dependent family setup times
• Some dominance properties for single-machine tardiness problems with sequence-dependent setup
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
• A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

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

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