Algoritmo híbrido para resolver o problema de escalonamento job shop com incertezas
DOI:
https://doi.org/10.5540/tema.2013.014.01.0043Abstract
O problema de escalonamento do tipo Job shop é considerado NP-difícil. Em aplicações reais, o tempo de processamento de cada tarefa é muitas vezes impreciso. Por isso, neste trabalho é abordamos o problema de escalonamento Job shop com tempo de processamento fuzzy (JSSPF). O tempo de processamento de cada tarefa é modelado por números triangular fuzzy e o objetivo do problema é encontrar um escalonamento que minimize o makespan fuzzy do problema. Na abordagem proposta trabalhamos com o algoritmo memético (MA) e o algoritmo de sistema de colônia de formigas (ACS) para resolver o problema. Uma hibridização destas duas abordagens denominada MA-ACS(CC-MO) é proposta para resolver o problema fuzzy. Para comparar a eficiência da abordagem é realizada uma comparação entre três algoritmos AG-ACS, MA-ACS(MO) e MA-ACS(CC-MO), utilizando 8 problemas do OR-Library.References
Bellman, R. E. (1958). On a routing problem, Quarterly Applied Mathematics (16): 87–90.
Bonfim, T. R. (2006). Escalonamento Memético e Neuro-Memético de Tarefas. Tese de Doutorado da Faculdade de Engenharia Elétrica e Computação, Universidade Estadual de Campinas.
Bortolan, G. & Degani, R. (1993). A review of some methods for ranking fuzzy subsets, in: Dubois, D., Prade, H., Yager, R. (eds.), Readings in Fuzzy Sets for Intelligent Systems, Morgan Kaufmann, San Francisco, CA, pp. 149-158.
Dubois, D., Fargier, H. & Prade, H. (1995). Fuzzy constraints in job-shop scheduling, Journal of Intelligent Manufacturing, 6(4): 215-234.
Fortemps, P.(1997). Jobshop scheduling with imprecise durations: A fuzzy aproach. IEEE Trans. Fuzzy Syst., vol.(4), pp. 557-569.
González Rodrígues, I., Vela, C. R., Puente, J. (2007). A memetic approach to fuzzy job shop based on expectation model. In: Proceedings of IEEE International Conference on Fuzzy Systems, FUZZ-IEEE, London, pp. 692-697.
Hernandes, F. (2007). Algoritmos para Problemas de Grafos com Incertezas. Tese de doutorado da Faculdade de Engenharia Elétrica e Computação, Universidade Estadual de Campinas.
Lin, F.-T. (2000). Fuzzy job-shop scheduling based on ranking level lambda, 1 interval-valued fuzzy numbers, IEEE Trans. Fuzzy Syst., vol.10(4), pp. 510-522.
Niu Q., Jiao B., Gu X. (2008). Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time. Applied Mathematics and Computation, 205 (1), pp. 148-158.
Okada, S. e Soper, T. (2000). A shortest path problem on a network with fuzzy arc lengths. Fuzzy Sets and Systems, 109, pp. 129-140.
Tamura, N.(2007). OR-library. Available online at: http://bach.istc.kobe-u.ac.jp/csp2sat/jss/. Accessed 15 july 2007.
Zadeh, L. (1965). Fuzzy Sets. Information and Control, 8:338-353.
Downloads
Additional Files
Published
How to Cite
Issue
Section
License
Authors who publish in this journal agree to the following terms:
Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.
Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
author. This is in accordance with the BOAI definition of open access
Intellectual Property
All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.