SciELO - Scientific Electronic Library Online

 
vol.10 número4Motor de Interpretación Gráfica para el cálculo de Volumen de ArcillaUna evaluación del algoritmo LVQ en una colección de texto índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

  • Não possue artigos citadosCitado por SciELO

Links relacionados

  • Não possue artigos similaresSimilares em SciELO

Compartilhar


Revista Cubana de Ciencias Informáticas

versão On-line ISSN 2227-1899

Resumo

LAZO ECHE, Edwin; GUTIERREZ SEGURA, Flabio  e  VERGARA MORENO, Edmundo. An efficient algorithm for single machine problems with fuzzy processing times. Rev cuba cienc informat [online]. 2016, vol.10, n.4, pp.139-153. ISSN 2227-1899.

ABSTRACT The classic models of scheduling on single machine have been studied with different processing characteristics and objective functions. Most proposed techniques for solving such problems did not consider the imprecise nature of some variables involved in its formulation. This paper proposes a heuristic for calculating the maximum weighted completion tine in single machine problems with fuzzy processing times and priority assignments (weights) to the jobs. The proposed methodology represented imprecise processing times by triangular fuzzy numbers and used a measure robust and flexible comparison based on the concept of the expected inerval of a fuzzy number. Optimal and robust schedule that support variations in processing times was obtained. The optimal schedule is represented graphically by fuzzy Gantt chart. The proposed algorithm proves to be efficient based on tests made for a given set of jobs with the aim of find feasible schedule to calculate the maximum weighted completion time.

Palavras-chave : fuzzy scheduling; single machine; fuzzy numbers; expected interval.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons