A heuristic to minimize total flow time in permutation flow shop☆

Laha, Dipak; Sarin, Subhash C.

doi:10.1016/j.omega.2008.05.002

Cited by 68 publications

(23 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

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 this regard, various mathematical models have been attempted by researchers to improve the scheduling processes in the manufacturing industry. For example, Laha and Sarin (2009) optimize the whole schedule by optimizing the partial process in production. On the other hand, fuzzy processing time is adopted to solve machine scheduling (Peng & Liu, 2004).…”

Section: Genetic Algorithmmentioning

confidence: 99%

A real-time hybrid information-sharing and decision support system for the mould industry

Leung

Choy

Kwong

2010

The Journal of High Technology Management Research

View full text Add to dashboard Cite

“…As the problem is NP-complete, algorithms that are able to find high-quality solutions within a reasonable computation time are preferred. Numerous simple heuristics have been developed to construct a solution quickly (Framinan, Leisten, & Ruiz-Usano, 2005;Laha & Sarin, 2009;Li, Wang, & Wu, 2009;Li & Wu, 2005). However, the solution often falls well short of optimality.…”

Section: Introductionmentioning

confidence: 99%

Self-adaptive perturbation and multi-neighborhood search for iterated local search on the permutation flow shop problem

Dong

Nowak

Chen

et al. 2015

Computers & Industrial Engineering

View full text Add to dashboard Cite

A heuristic to minimize total flow time in permutation flow shop☆

Cited by 68 publications

References 21 publications

Local search methods for the flowshop scheduling problem with flowtime minimization

Local search methods for the flowshop scheduling problem with flowtime minimization

A real-time hybrid information-sharing and decision support system for the mould industry

Self-adaptive perturbation and multi-neighborhood search for iterated local search on the permutation flow shop problem

Contact Info

Product

Resources

About