Pages that link to "Item:Q1357777"
From MaRDI portal
The following pages link to A dynamic programming algorithm for single machine scheduling with ready times (Q1357777):
Displaying 10 items.
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
- A dynamic programming method for single machine scheduling (Q1331548) (← links)
- An algorithm for constructing single processor static-dynamic schedules (Q1789208) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms (Q2255056) (← links)
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
- A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)
- Effective heuristics for the single machine sequencing problem with ready times (Q3352822) (← links)
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling (Q3802870) (← links)
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem (Q3806967) (← links)