Pages that link to "Item:Q958077"
From MaRDI portal
The following pages link to Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077):
Displaying 10 items.
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms (Q277580) (← links)
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- A multi-agent based cooperative approach to scheduling and routing (Q323308) (← links)
- Flow shops with machine maintenance: ordered and proportionate cases (Q992582) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
- Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)
