Pages that link to "Item:Q2572853"
From MaRDI portal
The following pages link to Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853):
Displaying 11 items.
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning (Q2077963) (← links)
- Metaheuristics ``In the large'' (Q2242238) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- An integrated approach for lean production using simulation and data envelopment analysis (Q2678626) (← links)
- Supercomputer Scheduling with Combined Evolutionary Techniques (Q3603111) (← links)
- (Q5154491) (← links)
- Learning-augmented heuristics for scheduling parallel serial-batch processing machines (Q6164322) (← links)
