Pages that link to "Item:Q1203798"
From MaRDI portal
The following pages link to Restricted neighborhood in the tabu search for the flowshop problem (Q1203798):
Displaying 10 items.
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← 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)
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
- Performance enhancements to tabu search for the early/tardy scheduling problem (Q1609889) (← links)
- The hot strip mill production scheduling problem: A tabu search approach (Q1609896) (← links)
- A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
