Pages that link to "Item:Q1919773"
From MaRDI portal
The following pages link to An iterative heuristic for the single machine dynamic total completion time scheduling problem (Q1919773):
Displayed 6 items.
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem (Q1781577) (← links)
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times (Q2102999) (← links)
- Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)