Pages that link to "Item:Q4849303"
From MaRDI portal
The following pages link to A New Heuristic Method for the Permutation Flow Shop Scheduling Problem (Q4849303):
Displaying 19 items.
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
- On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
- An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- A new heuristic method for the flow shop sequencing problem (Q1119464) (← links)
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← links)
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling (Q2627803) (← links)
- Reducing mean flow time in permutation flow shop (Q3519365) (← links)
- A fuzzy greedy heuristic for permutation flow-shop scheduling (Q3582659) (← links)
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup (Q3621499) (← links)
- New block properties for the permutation flow shop problem with application in tabu search (Q4658399) (← links)
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times (Q5477730) (← links)
