A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
From MaRDI portal
Publication:869149
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
Cites work
- scientific article; zbMATH DE number 3425355 (Why is no real title available?)
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
- Construction heuristics for the asymmetric TSP.
- Impact of sequence-dependent setup time on job shop scheduling performance
- Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
- 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
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
Cited in
(20)- An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- Patient scheduling with periodic deteriorating maintenance on single medical device
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- Minimizing sum of completion times on a single machine with sequence-dependent family setup times
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence 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
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- Solving the single crane scheduling problem at rail transshipment yards
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- A GRASP based on DE to solve single machine scheduling problem with SDST
- A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
- 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
- Some dominance properties for single-machine tardiness problems with sequence-dependent setup
- A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
- Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
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)
