Use este identificador para citar ou linkar para este item: http://www.repositorio.ufop.br/jspui/handle/123456789/9370
Registro completo de metadados
Campo Dublin CoreValorIdioma
dc.contributor.authorRosa, Bruno Ferreira-
dc.contributor.authorSouza, Marcone Jamilson Freitas-
dc.contributor.authorSouza, Sérgio Ricardo de-
dc.contributor.authorFrança Filho, Moacir Felizardo de-
dc.contributor.authorAles, Zacharie-
dc.contributor.authorMichelon, Philippe Yves Paul-
dc.date.accessioned2018-01-30T12:50:01Z-
dc.date.available2018-01-30T12:50:01Z-
dc.date.issued2016-
dc.identifier.citationROSA, B. F. et al. Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties. Computers & Operations Research, v. 81, p. 203-215, 2016. Disponível em: <https://www.sciencedirect.com/science/article/pii/S030505481630332X>. Acesso em: 16 jan. 2018.pt_BR
dc.identifier.issn0305-0548-
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/9370-
dc.description.abstractThis paper addresses the single machine scheduling problem with distinct time windows and sequence- dependent setup times. The objective is to minimize the total weighted earliness and tardiness. The prob- lem involves determining the job execution sequence and the starting time for each job in the sequence. An implicit enumeration algorithm denoted IE and a general variable neighborhood search algorithm de- noted GVNS are proposed to determine the job scheduling. IE is an exact algorithm, whereas GVNS is a heuristic algorithm. In order to define the starting times, an O ( n 2 ) idle time insertion algorithm (ITIA) is proposed. IE and GVNS use the ITIA algorithm to determine the starting time for each job. However, the IE algorithm is only valid for instances with sequence-independent setup times, and takes advantage of theoretical results generated for this problem. Computational experiments show that the ITIA algo- rithm is more efficient than the only other equivalent algorithm found in the literature. The IE algorithm allows the optimal solutions of all instances with up to 15 jobs to be determined within a feasible com- putational time. For larger instances, GVNS produces better-quality solutions requiring less computational time compared with the other algorithm from the literature.pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectSchedulingpt_BR
dc.subjectMakespanpt_BR
dc.subjectIdle timept_BR
dc.subjectEnumeration algorithmpt_BR
dc.titleAlgorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.identifier.uri2https://www.sciencedirect.com/science/article/pii/S030505481630332Xpt_BR
dc.identifier.doihttps://doi.org/10.1016/j.cor.2016.12.024-
Aparece nas coleções:DECOM - Artigos publicados em periódicos

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
ARTIGO_AlgorithmsJobScheduling.pdf
  Restricted Access
793,23 kBAdobe PDFVisualizar/Abrir


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.