Pages that link to "Item:Q1928272"
From MaRDI portal
The following pages link to A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272):
Displaying 12 items.
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset (Q2356246) (← links)
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← 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)
