Some efficient heuristic methods for the flow shop sequencing problem

Taillard, Éric D.

doi:10.1016/0377-2217(90)90090-x

Cited by 761 publications

(353 citation statements)

References 4 publications

Supporting

Mentioning

326

Contrasting

Unclassified

Order By: Relevance

“…In order to speed up the insertion procedure, the well known accelerations of Taillard (1990) are used. This procedure is applied to all job permutations to have 25 NEH2 improved solutions.…”

Section: Solution Representation and Diversification Generation Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

242

View full text Add to dashboard Cite

The distributed permutation flowshop problem has been recently proposed as a generalization of the regular flowshop setting where more than one factory is available to process jobs. Distributed manufacturing is a common situation for large enterprises that compete in a globalized market. The problem has two dimensions: assigning jobs to factories and scheduling the jobs assigned to each factory. Despite being recently introduced, this interesting scheduling problem has attracted attention and several heuristic and metaheuristic methods have been proposed in the literature. In this paper we present a scatter search (SS) method for this problem to optimize makespan. SS has seldom been explored for flowshop settings. In the proposed algorithm we employ some advanced techniques like a reference set made up of complete and partial solutions along with other features like restarts and local search. A comprehensive computational campaign including 10 existing algorithms, together with statistical analyses, shows that the proposed scatter search algorithm produces better results than existing algorithms by a significant margin. Moreover all 720 known best solutions for this problem are improved.

show abstract

Section: Solution Representation and Diversification Generation Methodsmentioning

confidence: 99%

“…Therefore, at the end of this first local search, each factory contains local optima solutions with respect to the insertion neighborhood. Note that the accelerations of Taillard (1990) are also applied here.…”

Section: Improvement Methodsmentioning

confidence: 99%

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

242

View full text Add to dashboard Cite

show abstract

“…In addition to the NEH heuristic, which is the best among the available simple heuristics, CDS also performs reasonably better. The complexity level and the quality of the simple heuristics have been studied in detail by Taillard [9], and are briefly given below: NEH appears to be the best polynomial heuristic in practice. The CDS algorithm which is in the second place also performs better.…”

Section: Heuristic Algorithms Analyzedmentioning

confidence: 99%

“…The NEH algorithm proposed by Nawaz et al [7] is considered as the best among the simple heuristics, according to many studies conducted over the past decades, like by Turner and Booth [8], Taillard [9] and Ruiz and Maroto [10]. The number of enumerations in NEH algorithm is [n(n+1)/2]-1 and applies insertion technique.…”

mentioning

confidence: 99%

Analyzing a few Heuristic Algorithms Considering Machine Idle Time and Processing Time in Permutation Flow Shop Scheduling Problems

Baskar¹,

Xavior²

2013

IJAIS

View full text Add to dashboard Cite

Flow Shop Scheduling has been an interesting field of research for over six decades. They are easy to formulate, yet difficult to solve. In a shop, there are 'm' machines arranged in series to process a set of 'n' jobs having different processing times. Each job has to pass through each machine, in order. The problem is to find a sequence of jobs to be processed in all the machines, so that a given performance parameter is optimized. The total number of schedules is (n!) m . If the order of machines is not to be changed, the problem is simplified, and the overall number of solutions is reduced to n!. This problem is referred to a permutation flow shop scheduling problem, or PFSP in short. Starting from two machines, 'n' jobs, various Heuristics have been proposed over the years. After the invention of meta heuristics and evolutionary algorithms, and increased computational capabilities available today, finding optimal/ near optimal solutions become comparatively easier. In this paper, a few heuristic algorithms have been analyzed for makespan criterion considering machine idle time and processing time, by comparing the results with the well known CDS algorithm. Benchmark problems proposed by Taillard and Ruben Ruiz are used for the performance analysis.

show abstract

“…, n −1} values, such that P(i) denotes the job to be executed at the i th position. As proved in [15], the insertion operator, which inserts a selected job to a designated position, is more effective than other operators in solving FSP. Moreover, the authors in [4] show the insertion operator is also very efficient in solving multi-objective FSPs.…”

Section: Path Generationmentioning

confidence: 99%

Hypervolume-Based Multi-Objective Path Relinking Algorithm

Zeng

Basseur

Hao

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents a hypervolume-based multi-objective path relinking algorithm for approximating the Pareto optimal set of multi-objective combinatorial optimization problems. We focus on integrating path relinking techniques within a multi-objective local search as an initialization function. Then, we carry out a range of experiments on bi-objective flow shop problem and bi-objective quadratic assignment problem. Experimental results and a statistical comparison are reported in the paper. In comparison with the other algorithms, one version of our proposed algorithm is very competitive. Some directions for future research are highlighted.

show abstract

Some efficient heuristic methods for the flow shop sequencing problem

Cited by 761 publications

References 4 publications

A scatter search algorithm for the distributed permutation flowshop scheduling problem

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Analyzing a few Heuristic Algorithms Considering Machine Idle Time and Processing Time in Permutation Flow Shop Scheduling Problems

Hypervolume-Based Multi-Objective Path Relinking Algorithm

Contact Info

Product

Resources

About