A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times

Nagano, Marcelo Seido; Miyata, Hugo Hissashi; Araújo, Daniella Castro

doi:10.1016/j.jmsy.2014.06.007

Cited by 40 publications

(25 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The second phase employs the construction mechanism by Gao et al (2012). In order to obtain better solutions, the local search of insertion by Nagano et al (2015) and backward swap and continue by are employed as an improvement local search.…”

Section: The New Heuristicmentioning

confidence: 99%

“…For some of them the processing of a job cannot be interrupted once started. Some examples of such production systems are chemical, metal, food processing industries and printed circuit board manufacturing (Adiri and Pohoryles, 1982;Hall and Sriskandarajah, 1996;Nagano et al, 2012;Laha and Sapkal, 2014;Nagano et al, 2015). In addition, modern manufacturing environments where robots and industrial machines provide a highly coordinated process, can frequently be modeled as a no-wait scheduling problem (Bertolossi, 2000).…”

Section: Introductionmentioning

confidence: 99%

“…Nagano and Miyata (2015) reviewed and classified the constructive heuristics for the m-machine case with makespan and total flow time minimization. Recently, Allahverdi (2016) published a comprehensive survey of the no-wait in process scheduling problems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

Nagano¹,

Miyata²

2016

Industrial Engineering and Management Systems

Self Cite

View full text Add to dashboard Cite

This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.

show abstract

Section: The New Heuristicmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

Nagano¹,

Miyata²

2016

Industrial Engineering and Management Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…The hybrid metaheuristic Evolutionary Cluster Search (ECS_NSL) is employed to solve this scheduling problem. Nagano et al (2015) addressed the problem of scheduling jobs in a no -wait flow shop with sequence-dependent setup times with the objective of minimizing the total flow time. As this problem is well-known for being NP-hard, they presented a new constructive heuristic, named QUARTS, in order to obtain good approximate solutions in a short CPU time.…”

Section: Introductionmentioning

confidence: 99%

A bi-objective simulation-optimization approach for solving a no-wait two stages flexible flow shop scheduling problem with rework ability

Rahmanidoust

Zheng²

2017

IBR

View full text Add to dashboard Cite

The paper suggests a new rule; called no-wait process. The rule has two stages, and is a flexible flow shop scheduling. The process is the subject to maximize tardiness while minimizing the makespan. This hybrid flow shop problem is known to be NP-hard. Therefore, we come to first, Non-dominated Sorting Genetic Algorithm (NSGA-II), then, Multi-Objective Imperialist Competitive Algorithm (MOICA) and finally, Pareto Archive Evolutionary Strategy (PAES) as three multi-objective Pareto based metaheuristic optimization methods. They are developed to solve the problem to approximately figure out optimal Pareto front. The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics. The conclusion, developed by this method is the most efficient and practicable algorithm at the end.

show abstract

“…It handles the allocation of resource operations (Pinedo, 2008;Nagano & Januário, 2012;Nagano, Silva, & Lorena, 2014;Sobreiro, Mariano, & Nagano, 2014;Nagano, Miyata, & Araújo, 2015;Sagawa & Nagano, 2015a;2015b).…”

Section: Introductionmentioning

confidence: 99%

<b>Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking

2016

Self Cite

View full text Add to dashboard Cite

ABSTRACT. This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be NP-Hard, the branch and bound algorithm may take long computational time to find the best solution. The use of an initial solution may reduce the computational time, by providing an initial upper bound. In this work, the efficiency of the use of an initial solution to the Branch and Bound algorithm was evaluated by comparison of the algorithms. The branch and bound algorithm used, as well as the lower bound, was proposed by Ronconi (2005). Four heuristic methods (MM, PF, wPF, and PW) were tested using a 180 problems data. Results show that the use of an initial solution does considerably reduce the computational time.Keywords: Branch and Bound, heuristics, flowshop, block, makespan, scheduling.Avaliação de heurísticas para um algoritmo branch e bound para minimizar o makespan em um flowshop com bloqueio RESUMO. Este trabalho tem o objetivo de avaliar o uso de diferentes métodos heurísticos para obtenção de uma solução inicial para um algoritmo branch e bound, tendo como objetivo minimizar o makespan em um ambiente flowshop com buffer zero. Como o problema é conhecido por ser NP-Hard, o algoritmo branch e bound pode necessitar de elevado tempo computacional para encontrar a melhor solução. A utilização de uma solução inicial pode reduzir o tempo de processamento, proporcionando um limite superior inicial. Neste trabalho, a eficiência da utilização de uma solução inicial para o algoritmo branch e bound foi avaliada com a comparação dos algoritmos. O algoritmo branch e bound utilizado, bem como o limitante inferior foram propostos por Ronconi (2005). Cinco métodos heurísticos foram avaliados (MM, PF, wPF e PW) utilizando um conjunto de problemas teste composto de 180 problemas. Os resultados mostraram que a utilização da heurística para obter uma solução inicial para o algoritmo branch e bound reduz significativamente o tempo computacional.Palavras-chave: Branch e Bound, heurísticas, flowshop, bloqueio, makespan, programação.

show abstract

A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times

Cited by 40 publications

References 29 publications

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

A bi-objective simulation-optimization approach for solving a no-wait two stages flexible flow shop scheduling problem with rework ability

<b>Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking

Contact Info

Product

Resources

About