Pages that link to "Item:Q5619726"

The following pages link to A Functional Heuristic Algorithm for the Flowshop Scheduling Problem (Q5619726):

Displaying 9 items.

• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
• Scheduling flow shops using differential evolution algorithm (Q817560) (← 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)
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574) (← links)
• An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
• An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
• Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)