MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times
MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times
| dc.creator | Muller, Felipe Martins | |
| dc.creator | Araujo, Olinto Bassi | |
| dc.creator | Stefanello, Fernando | |
| dc.creator | Zanetti, Marcelo | |
| dc.date | 2014-09-20 | |
| dc.date.accessioned | 2023-09-27T14:56:37Z | |
| dc.date.available | 2023-09-27T14:56:37Z | |
| dc.identifier | https://periodicos.ufsm.br/reaufsm/article/view/13305 | |
| dc.identifier | 10.5902/1983465913305 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8923985 | |
| dc.description | In 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.description | In 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.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidade Federal de Santa Maria | en-US |
| dc.relation | https://periodicos.ufsm.br/reaufsm/article/view/13305/pdf_1 | |
| dc.source | Revista de Administração da UFSM; Vol. 7 No. 3 (2014): Jul-Set; 506-523 | en-US |
| dc.source | Revista de Administração da UFSM; Vol. 7 Núm. 3 (2014): Jul-Set; 506-523 | es-ES |
| dc.source | Revista de Administração da UFSM; v. 7 n. 3 (2014): Jul-Set; 506-523 | pt-BR |
| dc.source | 1983-4659 | |
| dc.source | 1983-4659 | |
| dc.title | MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times | en-US |
| dc.title | MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times | pt-BR |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion |