Pages that link to "Item:Q1374424"
From MaRDI portal
The following pages link to Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates (Q1374424):
Displaying 10 items.
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- A decomposition scheme for single stage scheduling problems (Q983632) (← 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)
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549) (← links)
- Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem (Q1781577) (← links)
- Integration of production planning and scheduling based on RTN representation under uncertainties (Q2004899) (← links)
- Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
- An AGV routing policy reflecting the current and future state of semiconductor and LCD production lines (Q4443305) (← links)
