Pages that link to "Item:Q690012"
From MaRDI portal
The following pages link to On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012):
Displayed 13 items.
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (Q3379502) (← links)