Pages that link to "Item:Q842556"
From MaRDI portal
The following pages link to A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556):
Displayed 13 items.
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems (Q2257352) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457) (← links)
- An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
- Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759) (← links)
