Efficient composite heuristics for total flowtime minimization in permutation flow shops☆

Li, Xiaoping; Wang, Qian; Wu, Cheng

doi:10.1016/j.omega.2006.11.003

Cited by 96 publications

(46 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Rajendran (1993), Rajendran andZiegler (1997), Liu andReeves (2001), Li and Wu (2005) and, more recently, Laha and Sarin (2009) Framinan et al (2005), and Li et al (2009). In any case, in order to attain a better solution quality for the problem under consideration, modern metaheuristics have been increasingly applied in recent years.…”

Section: Literature Reviewmentioning

confidence: 99%

Local search methods for the flowshop scheduling problem with flowtime minimization

Pan

Ruíz

2012

European Journal of Operational Research

121

View full text Add to dashboard Cite

Flowshop scheduling is a very active research area. This problem still attracts a considerable amount of interest despite the sheer amount of available results. Total flowtime minimization of a flowshop has been actively studied and many effective algorithms have been proposed in the last few years. New best solutions have been found for common benchmarks at a rapid pace. However, these improvements many times come at the cost of sophisticated algorithms. Complex methods hinder potential applications and are difficult to extend to small problem variations. Replicability of results is also a challenge. In this paper, we examine simple and easy to implement methods that at the same time result in state-of-the-art performance. The first two proposed methods are based on the well known Iterated Local Search (ILS) and Iterated Greedy (IG) frameworks, which have been applied with great success to other flowshop problems. Additionally, we present extensions of these methods that work over populations, something that we refer to as population-based ILS (pILS) and population-based IG (pIGA), respectively. We calibrate the presented algorithms by means of the Design of Experiments (DOE) approach. Extensive comparative evaluations are carried out against the most recent techniques for the considered problem in the literature. The results of a comprehensive computational and statistical analysis show that the presented algorithms are very effective. Furthermore, we show that, despite their simplicity, the presented methods are able to improve 12 out of 120 best known solutions of Taillard's flowshop benchmark with total flowtime criterion.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Local search methods for the flowshop scheduling problem with flowtime minimization

Pan

Ruíz

2012

European Journal of Operational Research

121

View full text Add to dashboard Cite

show abstract

“…In [29][30][31][32][33][34][35][36][37], this local search has shown its high effectiveness in obtaining the better quality solutions than the local search based on swap operators. The curial idea of this method is to compare the previous makespan with the new makespan of the sequence, which has inserted a job into all positions of the sequence.…”

Section: Perturbation and Local Search Methodsmentioning

confidence: 99%

A Hybrid Local Search Algorithm for the Sequence Dependent Setup Times Flowshop Scheduling Problem with Makespan Criterion

Wang

2017

Sustainability

View full text Add to dashboard Cite

This paper focuses on the flowshop scheduling problem with sequence dependent setup times (FSSP-SDST), which has been an investigated object for decades as one of the most popular scheduling problems in manufacturing systems. A novel hybrid local search algorithm called HLS is presented to solve the flowshop scheduling problem with sequence dependent setup times with the criterion of minimizing the makespan. Firstly, the population is initialized by the Nawaz-Enscore-Hoam based problem-specific method (NEHBPS) to generate high quality individuals of the current population. Then, a global search embedded with a light perturbation is designed to produce a new population. After that, to improve the quality of individuals in the current population, a single insertion-based local search is applied. Meanwhile, a further local search strategy based on the insertion-based local search is used to find better solutions for the individuals which are non-improved. Finally, the heavy perturbation is used to explore potential solutions in the neighbor region. To validate the performance of HLS, we compare our proposed algorithm with other competitive algorithms on Taillard benchmark problems. From the experimental results, it can be concluded that the proposed algorithm outperforms the benchmark algorithms.

show abstract

“…Moreover, many heuristic algorithms have been developed for the PFSP (e.g., see Refs. [8][9][10][11][12][13][14][15]. As the PFSP is a well-known NP-hard problem (Rinnooy Kan in 1976 proved 16 that the makespan minimization problem is NP-complete and the flowtime minimization one was proved 17 by Garey et al in 1976), metaheuristics like tabu search (e.g., see Refs.…”

Section: Introductionmentioning

confidence: 99%

A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem

Ahmadizar¹,

Barzinpour²

2010

IJCIS

View full text Add to dashboard Cite

This paper deals with the permutation flow shop scheduling problem. The objective is to minimize the maximum completion time, or makespan. To solve this problem which has been proved to be strongly NP-hard, a combination between an ant colony algorithm, a heuristic algorithm and a local search procedure is proposed and presented. The hybrid approach is to use artificial ants to construct solutions by applying a stochastic greedy rule based on the Gupta's heuristic and pheromone trails. A local search is then performed to improve the performance quality of constructed solutions. Once all ants have terminated their generations, the pheromone trails are modified according to a global updating rule. The proposed algorithm is applied to benchmark problems taken from the literature and compared with other metaheuristics. Computational experiments are given to demonstrate the superiority of the algorithm in the quality of solution and CPU time.

show abstract

Efficient composite heuristics for total flowtime minimization in permutation flow shops☆

Cited by 96 publications

References 23 publications

Local search methods for the flowshop scheduling problem with flowtime minimization

Local search methods for the flowshop scheduling problem with flowtime minimization

A Hybrid Local Search Algorithm for the Sequence Dependent Setup Times Flowshop Scheduling Problem with Makespan Criterion

A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem

Contact Info

Product

Resources

About