Pages that link to "Item:Q4656763"

The following pages link to A high quality solution constructive heuristic for flow shop sequencing (Q4656763):

Displaying 12 items.

• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
• Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
• An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
• The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
• \(N\)-NEH+ algorithm for solving permutation flow shop problems (Q2668738) (← links)
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)