Heuristics methods for the flow shop scheduling problem with separated setup times
DOI:
https://doi.org/10.14488/1676-1901.v12i2.939Keywords:
Production scheduling. Permutation flow shop. Setup times. Heuristic method. MakespanAbstract
This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.Downloads
Download data is not yet available.
Published
2012-06-13
How to Cite
Nagano, M. S., & Mesquita, M. S. (2012). Heuristics methods for the flow shop scheduling problem with separated setup times. Revista Produção Online, 12(2), 499–521. https://doi.org/10.14488/1676-1901.v12i2.939
Issue
Section
Papers
License
The Journal reserves the right to make spelling and grammatical changes, aiming to keep a default language, respecting, however, the style of the authors.
The published work is responsibility of the (s) author (s), while the Revista Produção Online is only responsible for the evaluation of the paper. The Revista Produção Online is not responsible for any violations of Law No. 9.610 / 1998, the Copyright Act.
The journal allows the authors to keep the copyright of accepted articles, without restrictions
This work is licensed under a Creative Commons License .
