MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times

dc.creatorMuller, Felipe Martins
dc.creatorAraujo, Olinto Bassi
dc.creatorStefanello, Fernando
dc.creatorZanetti, Marcelo
dc.date2014-09-20
dc.date.accessioned2023-09-27T14:56:37Z
dc.date.available2023-09-27T14:56:37Z
dc.identifierhttps://periodicos.ufsm.br/reaufsm/article/view/13305
dc.identifier10.5902/1983465913305
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8923985
dc.descriptionIn this paper we study the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. We consider the objective of minimizing the maximum completion time of the latest job, usually referred to as makespan. We propose a new MIP-based heuristic combining atomic moves such as insertion, ejection and closure, in order to generate sequences of such atomic moves minimizing the makespan. This heuristic employs a commercial solver to search the neighborhood in a multi-start algorithm. Our approach performed well in computational experiments targeting two sets of benchmark instances previously used in the literature.en-US
dc.descriptionIn this paper we study the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. We consider the objective of minimizing the maximum completion time of the latest job, usually referred to as makespan. We propose a new MIP-based heuristic combining atomic moves such as insertion, ejection and closure, in order to generate sequences of such atomic moves minimizing the makespan. This heuristic employs a commercial solver to search the neighborhood in a multi-start algorithm. Our approach performed well in computational experiments targeting two sets of benchmark instances previously used in the literature. pt-BR
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidade Federal de Santa Mariaen-US
dc.relationhttps://periodicos.ufsm.br/reaufsm/article/view/13305/pdf_1
dc.sourceRevista de Administração da UFSM; Vol. 7 No. 3 (2014): Jul-Set; 506-523en-US
dc.sourceRevista de Administração da UFSM; Vol. 7 Núm. 3 (2014): Jul-Set; 506-523es-ES
dc.sourceRevista de Administração da UFSM; v. 7 n. 3 (2014): Jul-Set; 506-523pt-BR
dc.source1983-4659
dc.source1983-4659
dc.titleMIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup timesen-US
dc.titleMIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup timespt-BR
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución