New dominance rules and exploration strategies for the 1|r _i| U _i scheduling problem
From MaRDI portal
Publication:429486
Recommendations
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
- An exact method to minimize the number of tardy jobs in single machine scheduling
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Branch-and-Bound Strategies for Dynamic Programming
- Future paths for integer programming and links to artificial intelligence
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Minimizing late jobs in the general one machine scheduling problem
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Planning and Scheduling in Manufacturing and Services
- Scheduling algorithms
- Scheduling to Minimize Interaction Cost
- The Total Tardiness Problem: Review and Extensions
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
Cited in
(7)- Enhancing the best-first-search \(\mathrm{F}\) with incremental search and restarts for large-scale single machine scheduling with release dates and deadlines
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Revisiting branch and bound search strategies for machine scheduling problems
- Permutation flowshop scheduling with simple linear deterioration
- Weighted network search games with multiple hidden objects and multiple search teams
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
This page was built for publication: New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429486)
