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):
Displaying 15 items.
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
- Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates (Q1374424) (← 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)
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints (Q1979180) (← 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)
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem (Q2884524) (← links)
- Solving single batch-processing machine problems using an iterated heuristic (Q3019221) (← links)
- A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling (Q3983500) (← links)
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem (Q4656749) (← links)
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm (Q5687644) (← links)
- Target-oriented robust satisficing models for the single machine scheduling problems with release time (Q6568456) (← links)
