文章基本信息

标题：MIP–based heuristic for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times
本地全文：下载
作者：Felipe Martins Muller ; Olinto Bassi Araujo ; Fernando Stefanello 等
期刊名称：Revista de Administração da UFSM
印刷版ISSN：1983-4659
出版年度：2014
卷号：7
期号：3
页码：506-523
DOI：10.5902/1983465913305
语种：English
出版社：Universidade Federal de Santa Maria
摘要：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.
其他摘要：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.
关键词：Ciências Sociais Aplicadas; Administração; Engenharia de Produção