MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times
DOI:
https://doi.org/10.5902/1983465913305Abstract
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.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
This journal remains the copyright holders of articles published. In order to be published, authors must sign the Copyrights Letter, which is sent to the authors by e-mail, thus granting rights, including on translation, to ReA/UFSM. The journal grants third parties the right to use, reproduce, and share the article according to the Creative Commons license agreement (CC-BY 4.0), as stated in the article’s PDF documents.