New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
From MaRDI portal
Publication:429486
DOI10.1007/S10589-010-9378-7zbMath1241.90050OpenAlexW2068729166MaRDI QIDQ429486
Edward C. Sewell, Shane N. Hall, Gio K. Kao, Jacobson, Sheldon H.
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9378-7
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (3)
Permutation flowshop scheduling with simple linear deterioration ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ Weighted network search games with multiple hidden objects and multiple search teams
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Minimizing late jobs in the general one machine scheduling problem
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Genetic algorithms 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.
- Future paths for integer programming and links to artificial intelligence
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- An exact method to minimize the number of tardy jobs in single machine scheduling
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Branch-and-Bound Strategies for Dynamic Programming
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Planning and Scheduling in Manufacturing and Services
- The Total Tardiness Problem: Review and Extensions
- Scheduling to Minimize Interaction Cost
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for publication: New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
