A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
From MaRDI portal
Publication:5619726
DOI10.1057/JORS.1971.18zbMath0216.26705OpenAlexW2007676373MaRDI QIDQ5619726
Publication date: 1971
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104643
Related Items (35)
A note on worst-case analysis of approximation algorithms for a scheduling problem ⋮ The two-machine sequence dependent flowshop scheduling problem ⋮ A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling ⋮ A neuro-tabu search heuristic for the flow shop scheduling problem ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem ⋮ Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung ⋮ An improved NEH-based heuristic for the permutation flowshop problem ⋮ A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ Design and scheduling of flexible assembly lines for printed circuit boards ⋮ An improved particle swarm optimization algorithm for flowshop scheduling problem ⋮ Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness ⋮ Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs ⋮ A new heuristic for the n-job, M-machine flow-shop problem ⋮ A heuristic algorithm to schedule work in the repair industry ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ A tabu search approach for the flow shop scheduling problem ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Performance guarantees for flowshop heuristics to minimize makespan ⋮ Scheduling flow shops using differential evolution algorithm
This page was built for publication: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
