Pages that link to "Item:Q702727"
From MaRDI portal
The following pages link to A rollout metaheuristic for job shop scheduling problems (Q702727):
Displaying 16 items.
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
- The flexible blocking job shop with transfer and set-up times (Q719021) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem (Q2411179) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- Dynamic programming and suboptimal control: a survey from ADP to MPC (Q2511993) (← links)
- The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming (Q2811317) (← links)
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks (Q6109311) (← links)
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns (Q6588509) (← links)
