Citation
Local search techniques applied to the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 458-471, 2013.
Paper
Abstract
This work addresses the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times. In this problem there is a set of jobs and machines, and for each job there is a processing time associated, which is di?erent for each machine. Given two jobs, there is also a setup time that depends on their sequence and on the machine used. The objective considered in this problem is minimizing the makespan. This NP-Hard problem was tackled in this work by local search metaheuristics, such as Simulated Annealing, Iterated Local Search and Late Acceptance Hill Climbing, using several neighborhood structures. These structures are dynamically selected according to their e?ectiveness in runtime. The parameters of the algorithms were set using the irace package. Computational experiments show that the proposed methods outperform many results found in the literature, improving the best known solutions for several instances.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2013-458-471-P, author = {L. U. Rodrigues and H. G. Santos and T. A.M. To?olo and C. L.T.F. Silva },
title = {Local search techniques applied to the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time},
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {458--471},
note = {Paper},
abstract = {This work addresses the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times. In this problem there is a set of jobs and machines, and for each job there is a processing time associated, which is di?erent for each machine. Given two jobs, there is also a setup time that depends on their sequence and on the machine used. The objective considered in this problem is minimizing the makespan. This NP-Hard problem was tackled in this work by local search metaheuristics, such as Simulated Annealing, Iterated Local Search and Late Acceptance Hill Climbing, using several neighborhood structures. These structures are dynamically selected according to their e?ectiveness in runtime. The parameters of the algorithms were set using the irace package. Computational experiments show that the proposed methods outperform many results found in the literature, improving the best known solutions for several instances.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-458-471-P.pdf} }