A branch, bound, and remember algorithm for the 1|r _i | t _i scheduling problem
From MaRDI portal
Publication:842556
Recommendations
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- 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 branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Cites work
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A decomposition algorithm for the single machine total tardiness problem
- A new tabu search procedure for an audit-scheduling problem
- Algorithmic paradoxes of the single-machine total tardiness problem
- An exact method to minimize the number of tardy jobs in single machine scheduling
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- Minimizing Total Tardiness on One Machine is NP-Hard
- On decomposition of the total tardiness problem
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Solution of the single machine total tardiness problem
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
Cited in
(15)- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- 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-and-bound algorithm for assembly line worker assignment and balancing problems
- Anytime algorithms for the longest common palindromic subsequence problem
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
- Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
- Domain-independent dynamic programming
- A scalable branch, bound, and remember algorithm for picker routing with deadlines
This page was built for publication: A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842556)
