A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
From MaRDI portal
Publication:842556
DOI10.1007/s10951-008-0087-3zbMath1179.90139OpenAlexW2049813155MaRDI QIDQ842556
Edward C. Sewell, Gio K. Kao, Jacobson, Sheldon H.
Publication date: 25 September 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0087-3
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation, An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints, A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times, Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness, Results for the close-enough traveling salesman problem with a branch-and-bound algorithm, New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, A branch-and-bound algorithm for assembly line worker assignment and balancing problems, Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search, \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees, Weighted network search games with multiple hidden objects and multiple search teams, A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem, Anytime algorithms for the longest common palindromic subsequence problem
Cites Work
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- A new tabu search procedure for an audit-scheduling problem
- Solution of the single machine total tardiness problem
- A decomposition algorithm for the single machine total tardiness problem
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- On decomposition of the total tardiness problem
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Algorithmic paradoxes of the single-machine total tardiness problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
