Pages that link to "Item:Q2004870"
From MaRDI portal
The following pages link to A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870):
Displaying 9 items.
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning (Q2077963) (← links)
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem (Q2079447) (← links)
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times (Q2146995) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
- Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
- Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm (Q6048133) (← links)
- Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities (Q6534463) (← links)
