Pages that link to "Item:Q342481"
From MaRDI portal
The following pages link to New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481):
Displaying 17 items.
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
- Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search (Q2003564) (← links)
- Optimization of stability of humanoid robot NAO using ant colony optimization tuned MPC controller for uneven path (Q2099930) (← links)
- Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
- New heuristics for flow shop problem to minimize makespan (Q4933629) (← links)
- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
