A comprehensive review and evaluation of permutation flowshop heuristics
type: Item
instance of: scholarly article
title: A comprehensive review and evaluation of permutation flowshop heuristics
zbMATH Open document ID: 1066.90038
author: Rubén Ruiz
author: Concepción Maroto
published in: European Journal of Operational Research
publication date: 2005-04-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2160302
zbMATH Keywords: Flowshop
zbMATH Keywords: Scheduling
zbMATH Keywords: Heuristics
zbMATH Keywords: Metaheuristics
MaRDI profile type: Publication
full work available at URL: j.ejor.2004.04.017
OpenAlex ID: W1993433489
cites work: Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
cites work: A tabu search approach for the flow shop scheduling problem
cites work: Solutions to the Constrained Flowshop Sequencing Problem
cites work: A survey and evaluation of static flowshop scheduling heuristics
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: Q4658190
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: The Lessons of Flowshop Scheduling Research
cites work: Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
cites work: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
cites work: A new heuristic for the n-job, M-machine flow-shop problem
cites work: Modified simulated annealing algorithms for the flow shop sequencing problem
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A new constructive heuristic for the flowshop scheduling problem
cites work: A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
cites work: An adaptive hybrid metaheuristic for permutation flowshop scheduling
cites work: A fast tabu search algorithm for the permutation flow-shop problem
cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
cites work: Q3525911
cites work: Permutation vs. non-permutation flow shop schedules
cites work: Improving the Efficiency of Tabu Search for Machine Sequencing Problems
cites work: A genetic algorithm for flowshop sequencing
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Benchmarks for basic scheduling problems
cites work: On the heuristic solution of the permutation flow shop problem by path algorithms
cites work: A new heuristic method for the flow shop sequencing problem
cites work: Q4737365
cites work: Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
DOI: 10.1016/J.EJOR.2004.04.017
description: scientific article; zbMATH DE number 2160302