Pages that link to "Item:Q5619726"

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

Displayed 35 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 improved particle swarm optimization algorithm for flowshop scheduling problem (Q975447) ‎ (← links)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) ‎ (← links)
• The two-machine sequence dependent flowshop scheduling problem (Q1081528) ‎ (← links)
• Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions (Q1121756) ‎ (← links)
• A new constructive heuristic for the flowshop scheduling problem (Q1291704) ‎ (← links)
• Some results of the worst-case analysis for flow shop scheduling (Q1296692) ‎ (← links)
• A tabu search approach for the flow shop scheduling problem (Q1296693) ‎ (← links)
• Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) ‎ (← links)
• A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557) ‎ (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) ‎ (← links)
• A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) ‎ (← links)
• Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems (Q2265944) ‎ (← links)
• A new heuristic for the n-job, M-machine flow-shop problem (Q2277356) ‎ (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) ‎ (← links)
• Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) ‎ (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) ‎ (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) ‎ (← links)
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) ‎ (← links)
• A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling (Q3163237) ‎ (← links)
• A heuristic algorithm to schedule work in the repair industry (Q3354848) ‎ (← links)
• A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness (Q3596698) ‎ (← links)
• Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung (Q4070992) ‎ (← links)
• Design and scheduling of flexible assembly lines for printed circuit boards (Q4398942) ‎ (← links)
• Experimental comparison of heuristics for flow shop scheduling (Q4812723) ‎ (← links)
• An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) ‎ (← links)
• Flowshop-scheduling problems with makespan criterion: a review (Q5466734) ‎ (← links)
• Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs (Q5953158) ‎ (← links)
• Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) ‎ (← links)