Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Marcelo Ferreira Rego"'
Publikováno v:
Enterprise Information Systems ISBN: 9783030407827
ICEIS (Revised Selected Papers)
ICEIS (Revised Selected Papers)
This work proposes a hybrid algorithm for the unrelated parallel machine scheduling problem with sequence-dependent setup times, aiming to minimize the makespan. The proposed algorithm, named Enhanced Smart General Variable Neighborhood Search (e-SGV
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3e83be37d6a35871921713668b72ae0
https://doi.org/10.1007/978-3-030-40783-4_3
https://doi.org/10.1007/978-3-030-40783-4_3
Publikováno v:
ICEIS (1)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92de0dd3b619bb80d72495a5a8501906
https://doi.org/10.5220/0007703302870295
https://doi.org/10.5220/0007703302870295
Algorithms for the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times
Publikováno v:
SCCC
This work addresses the Unrelated Parallel Machines Scheduling Problem with Sequence-Dependent Setup Times - UPMSPST. The objective considered here is to minimize the scheduling maximum completion time, also known as makespan. This is important in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0775dc34b82679041e1ea2acdac68a6
https://doi.org/10.1109/sccc.2018.8705164
https://doi.org/10.1109/sccc.2018.8705164
Autor:
Francisco Santos Sabbadini, Antonio Augusto Gonçalves, Mário Jorge Ferreira de Oliveira, Antonio Henriquez de Araujo Júnior, Rosinei Ribeiro Batista, Lidio Mauro Lima de Campos, Gustavo Augusto Lima de Campos, Mylena Cristina Rezende Pacheco, Fernando Luiz Goldman, Byanca Porto de Lima, Artur da Silva Siqueira de Novais, Caroline Cristina de Carvalho, Larissa Melo Negrão, Carolina Riul de Freitas, Carla Regina de Moraes, Francisco Severo de Lima Junior, Maria Cristina Vendrameto, Rafael Lustosa da Costa, Pâmela Braga Bertahone, Nilson Brandalise, Igor Makiyama de Souza Barbosa, Murilo Vieira Strongoli, Aneirson Francisco da Silva, Fernando Augusto Silva Marins, Erica Ximenes Dias, Luiz Otavio Ribeiro Afonso Ferreira, Luís Miguel Alçada, Tomás de Almeida, Carlos Jorge Lima de Freitas, Mario Fracalossi Júnior, Natália Nogueira Ferreira Souza, Bernardo Santos Aflalo, Takashi Yoneyama, Lettiery D’Lamare Portela Procópio, Lucídio dos Anjos Formiga Cabral, Marco Cesar Goldbarg, Gustavo Ramos Lima, Patrick Marques Ciarelli, Marcelo Vilela Figueiredo, Rafael de Carvalho Miranda, Rosalvo Ferreira de Oliveira Neto, Caique Cézar Leite Mariano, Max Santana Relemberg Farias, Leandro Vitral Andraos, Paulo Henrique Coelho Maranhão, Josiane da Silva Jesus, Ramon Rocha Leite, Luciana Pereira de Assis, Alessandro Vivas Andrade, Marcelo Ferreira Rego, Cristiano Grijó Pitangui, Daniel Maia de Souza, Pauli Adriano de Almada Garcia, Pítias Teodoro, Rafaela Boeira Cechin, Leandro Luís Corso, Luiz Antonio Figueiredo, Jose Elmo Menezes, Ricardo Luiz Machado, Clarisse da Silva Vieira, Natanael Salgado Coutinho, Gustavo José de Aguiar Gomes Costa, Vinícius de Souza Bandeira, Vinícius Rossi Oliveira
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20148a8befdad92df6b15022ea3d524b
https://doi.org/10.5935/978-85-7042-007-7.2018b001
https://doi.org/10.5935/978-85-7042-007-7.2018b001
Autor:
Marcelo Ferreira Rego, Marcone Jamilson Freitas Souza, Igor Machado Coelho, José Elias Claudio Arroyo
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319009292
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7b0afb4ac37c670fafa1353175fc1a6
https://doi.org/10.1007/978-3-319-00930-8_11
https://doi.org/10.1007/978-3-319-00930-8_11
Publikováno v:
SCCC
This work treats the single machine scheduling problem in which the setup time depends on the sequence and the job family. The objective is to minimize the makespan and the total weighted tardiness. In order to solve the problem, two multi-objective
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5aedf7f7c3126268620a1f05040c0b44
https://doi.org/10.1109/sccc.2012.24
https://doi.org/10.1109/sccc.2012.24
Publikováno v:
CLEI
This work treats the single machine scheduling problem in which the setup time depends on the sequence and the job family. The objective is to minimize the makespan and the total tardiness. In order to solve the problem two multi-objective algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88b5b41a8aa08e852a760df185dec001
https://doi.org/10.1109/clei.2012.6427172
https://doi.org/10.1109/clei.2012.6427172
Publikováno v:
2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI); 1/ 1/2012, p1-8, 8p