Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆

Vallada, Eva; Ruíz, Rubén

doi:10.1016/j.omega.2009.04.002

Cited by 144 publications

(92 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Inspired by the generational schemes of Ruiz et al (2006) and Vallada and Ruiz (2010), pn is included into H if and only if: 1) The makespan of pn is better than the makespan of the worst solution in set H and 2) It is unique, i.e., there are no other identical solutions in set H.…”

Section: Reference Set Update Methods and Restart Proceduresmentioning

confidence: 99%

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

Self Cite

237

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: Reference Set Update Methods and Restart Proceduresmentioning

confidence: 99%

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

Self Cite

237

View full text Add to dashboard Cite

show abstract

“…The permutation based representation indicates the job processing order by machines. This representation has been widely used in the literature for a variety of permutation flow shop scheduling problems (Ruiz, Maroto and Alcaraz (2006), Vallada and Ruiz (2010), Jarboui, Eddaly and Siarry (2009)). Therefore, we also employ it in this study.…”

Section: Solution Representation and Population Initializationmentioning

confidence: 99%

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

Pan

Ruíz

2012

Omega

Self Cite

138

View full text Add to dashboard Cite

Lot-streaming flow shops have important applications in different industries including textile, plastic, chemical, semiconductor, and many others. This paper considers an n-job m-machine lot-streaming flow shop scheduling problem with sequence-dependent setup times under both the idling and no-idling production cases. The objective is to minimize the maximum completion time or makespan. To solve this important practical problem, a novel estimation of distribution algorithm (EDA) is proposed with a job permutation based representation. In the proposed EDA, an efficient initialization scheme based on the NEH heuristic is presented to construct an initial population with a certain level of quality and diversity. An estimation of a probabilistic model is constructed to direct the algorithm search towards good solutions by taking into account both job permutation and similar blocks of jobs. A simple but effective local search is added to enhance the intensification capability. A diversity controlling mechanism is applied to maintain the diversity of the population. In addition, a speed-up method is presented to reduce the computational effort needed for the local search technique and the NEH-based heuristics. A comparative evaluation is carried out with the best performing algorithms from the literature. The results show that the proposed EDA is very effective in comparison after comprehensive computational and statistical analyses.

show abstract

“…Henceforth, the Nawaz et al (1983) heuristic is called NEH in the remaining parts of this paper. NEH heuristic is based on job insertion (insertion neighbourhood) and is one of the most used techniques in flowshop scheduling (Vallada and Ruiz, 2010). Also, Kalczynski and Kamburowski (2007) noted that the NEH heuristic has been commonly regarded as the best heuristic for minimising the makespan in permutation flowshops.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The upper limit of generations is similar to the stopping criteria proposed by Figielska (2009). Other authors, like Vallada and Ruiz (2010) propose a stopping criterion set to maximum elapsed CPU time of n(m/2) 120 ms, which allows for increased number of observations in order to allow for a more exhaustive analysis. Compared to later, stopping criterion used in this study is restrictive and permits a time bound evaluation of the problem at hand.…”

mentioning

confidence: 97%

A hybrid genetic algorithm for a complex cost function for flowshop scheduling problem

Bhowmick¹,

Maniyan²,

Saxena³

et al. 2011

IJET

View full text Add to dashboard Cite

Abstract:Supply chain excellence has a real impact on business strategy. Manufacturing is an integral part of this strategy represents one of the most exciting opportunities to create value and one of the most challenging tasks for the policy makers. In this paper, we consider a performance criterion for the flowshop scheduling problem that aims to minimise a complex cost function, i.e., the sum of weighted tardiness and weighted flow-time costs. A heuristic and hybrid genetic algorithms are proposed and experimental results are provided. We address this trade-off and propose solution techniques that are easy for the shop-floor manager to implement. As scheduling function is an integral part of supply chain, the proposed solution minimises the opportunity losses and improves cost based supply chain performance. This paper addresses this interesting and challenging domain.

show abstract

Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆

Cited by 144 publications

References 57 publications

A scatter search algorithm for the distributed permutation flowshop scheduling problem

A scatter search algorithm for the distributed permutation flowshop scheduling problem

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

A hybrid genetic algorithm for a complex cost function for flowshop scheduling problem

Contact Info

Product

Resources

About