A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

Fernández-Viagas, Victor; Leisten, Rainer

doi:10.1016/j.eswa.2016.05.040

Cited by 40 publications

(13 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In case of ties, the job with minimum w j is chosen. See Liu and Reeves (2001) , Fernandez-Viagas, Leisten, et al (2016b) , and Fernandez-Viagas and Framinan (2017) for similar initializations.…”

Section: Beam Search Algorithmmentioning

confidence: 97%

“…Thus, this parameter is removed of this experimental parameter tuning (see e.g. Fernandez-Viagas and Framinan, 2015c;Fernandez-Viagas, Leisten, et al, 2016b;Liu and Reeves, 2001 for similar approaches) to avoid a calibration of each parameter γ , and its value is set to 15. So the following levels of the parameters are tested:…”

Section: Experimental Parameter Tuningmentioning

confidence: 99%

See 1 more Smart Citation

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

Fernández-Viagas

Valente

Framiñán

2018

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

The permutation flow shop scheduling problem is one of the most studied operations research related problems. Literally, hundreds of exact and approximate algorithms have been proposed to optimise several objective functions. In this paper we address the total tardiness criterion, which is aimed towards the satisfaction of customers in a make-to-order scenario. Although several approximate algorithms have been proposed for this problem in the literature, recent contributions for related problems suggest that there is room for improving the current available algorithms. Thus, our contribution is twofold: First, we propose a fast beam-search-based constructive heuristic that estimates the quality of partial sequences without a complete evaluation of their objective function. Second, using this constructive heuristic as initial solution, eight variations of an iterated-greedy-based algorithm are proposed. A comprehensive computational evaluation is performed to establish the efficiency of our proposals against the existing heuristics and metaheuristics for the problem.

show abstract

Section: Beam Search Algorithmmentioning

confidence: 97%

Section: Experimental Parameter Tuningmentioning

confidence: 99%

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

Fernández-Viagas

Valente

Framiñán

2018

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, recent research has focused on heuristics (including constructive and improvements heuristics) or metaheuristics. Heuristics completes the solution on a partial sequence or makes improvement according to the problem-specific characteristics, while metaheuristics is a combination of stochastic mechanism and local search algorithms [9]. Heuristics terminates spontaneously after a given number of steps regardless of the time limit [10], yet metaheuristics takes certain termination criterion as inputs.…”

Section: Blocking Flowshop Scheduling Problem (Bfsp)mentioning

confidence: 99%

Solving Scheduling Problem in a Distributed Manufacturing System Using a Discrete Fruit Fly Optimization Algorithm

et al. 2019

View full text Add to dashboard Cite

This study attempts to optimize the scheduling decision to save production cost (e.g., energy consumption) in a distributed manufacturing environment that comprises multiple distributed factories and where each factory has one flow shop with blocking constraints. A new scheduling optimization model is developed based on a discrete fruit fly optimization algorithm (DFOA). In this new evolutionary optimization method, three heuristic methods were proposed to initialize the DFOA model with good quality and diversity. In the smell-based search phase of DFOA, four neighborhood structures according to factory reassignment and job sequencing adjustment were designed to help explore a larger solution space. Furthermore, two local search methods were incorporated into the framework of variable neighborhood descent (VND) to enhance exploitation. In the vision-based search phase, an effective update criterion was developed. Hence, the proposed DFOA has a large probability to find an optimal solution to the scheduling optimization problem. Experimental validation was performed to evaluate the effectiveness of the proposed initialization schemes, neighborhood strategy, and local search methods. Additionally, the proposed DFOA was compared with well-known heuristics and metaheuristics on small-scale and large-scale test instances. The analysis results demonstrate that the search and optimization ability of the proposed DFOA is superior to well-known algorithms on precision and convergence.

show abstract

“…Experimental results show that all the heuristics present similar performances and HPF2 and NHPF2 are the best heuristics for the problem. Fernandez-Viagas et al (2016) proposed a Beam-Search-Based constructive heuristic for the…”

Section: Machinementioning

confidence: 99%

Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times

Takano¹,

Nagano²

2019

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper addresses the minimization of makespan for the permutation flow shop scheduling problem with blocking and sequence and machine dependent setup times, a problem not yet studied in previous studies. The 14 best known heuristics for the permutation flow shop problem with blocking and no setup times are presented and then adapted to the problem in two different ways; resulting in 28 different heuristics. The heuristics are then compared using the Taillard database. As there is no other work that addresses the problem with blocking and sequence and machine dependent setup times, a database for the setup times was created. The setup time value was uniformly distributed between 1% and 10%, 50%, 100% and 125% of the processing time value. Computational tests are then presented for each of the 28 heuristics, comparing the mean relative deviation of the makespan, the computational time and the percentage of successes of each method. Results show that the heuristics were capable of providing interesting results.

show abstract

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime

Cited by 40 publications

References 56 publications

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

Solving Scheduling Problem in a Distributed Manufacturing System Using a Discrete Fruit Fly Optimization Algorithm

Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times

Contact Info

Product

Resources

About