Pages that link to "Item:Q5085478"
From MaRDI portal
The following pages link to An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478):
Displaying 4 items.
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
- An improved heuristic for one-machine scheduling with delays constraints (Q1373850) (← links)
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
- Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759) (← links)