Flowshop scheduling research after five decades

Gupta, Jatinder N. D.; Stafford, Edward F.

doi:10.1016/j.ejor.2005.02.001

Cited by 281 publications

(126 citation statements)

References 45 publications

Supporting

Mentioning

123

Contrasting

Unclassified

Order By: Relevance

“…Reisman et al (1997) reviewed practical cases and concluded that the flowshop problem has many real life applications. This applicability of the flowshop is also highlighted in the many exiting reviews from the literature like Framinan et al (2004), Ruiz and Maroto (2005), Hejazi and Saghafian (2005) and Gupta and Stafford (2006). As a matter of fact, once generalized to hybrid flowshops or flexible flowline problems, many production problems can be modeled after a flowshop (Linn and Zhang, 1999;Vignier et al, 1999;Wang, 2005;Quadt and Kuhn, 2007;Ruiz and Vázquez-Rodríguez, 2010;Ribas et al, 2010).…”

Section: Introductionmentioning

confidence: 88%

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

235

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: Introductionmentioning

confidence: 88%

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

235

View full text Add to dashboard Cite

show abstract

“…The usual objectives are the minimization of the make-span, flow time, tardiness, lateness, and the number of jobs late. For a review of the general flowshop problem, see [2], and more recently [3]. The application of the flowshop scheduling research can be found in the areas such as chemical process industry and manufacturing systems, especially flexible transfer or assembly lines in which a wide range of parts are manufactured [4].…”

Section: Introductionmentioning

confidence: 99%

Parallelization of a Branch and Bound Algorithm on Multicore Systems

Chung

Flynn

Sang

2012

JSEA

View full text Add to dashboard Cite

The general m-machine permutation flowshop problem with the total flow-time objective is known to be NP-hard for m ≥ 2. The only practical method for finding optimal solutions has been branch-and-bound algorithms. In this paper, we present an improved sequential algorithm which is based on a strict alternation of Generation and Exploration execution modes as well as Depth-First/Best-First hybrid strategies. The experimental results show that the proposed scheme exhibits improved performance compared with the algorithm in [1]. More importantly, our method can be easily extended and implemented with lightweight threads to speed up the execution times. Good speedups can be obtained on shared-memory multicore systems.

show abstract

“…In the Editorial paper, Gupta and Stafford Jr. (2006) show the development of problem models, as well as solution methods over the past five decades. Taking this into account, it can be observed that the consideration of flow shop problems dealing explicitly with setup times started from the third decade (1975)(1976)(1977)(1978)(1979)(1980)(1981)(1982)(1983)(1984), and researchers became gradually interested in the subject from the fourth decade.…”

Section: Introductionmentioning

confidence: 99%