Citation
A simple stochastic local search for multi-mode resource-constrained multi-project scheduling. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 826-830, 2013.
Paper
Abstract
In the multi-mode resource-constrained multi-project scheduling(MMRCMPSP) problem we have to ?nd execution modes and starting times for the jobs of multiple projects, such that the total project delay is minimized. The delay of a project is the difference between its makespan and a lower bound on its duration. Asecondary objective is to minimize the total makespan of all projects. The jobs of a project compete for renewable and nonrenewable local resources, and for global renewable resources shared among the projects. The duration and resource requirements of a job depend on its execution mode. We present a simple stochastic local search method for this problem. It maintains a feasible permutation and mode selection of the jobs, and improves it by swapping the order of two jobs, or changing the mode of a job. We propose several techniques to reduce size of the analyzed neighborhoods. The method has ranked fourth during the quali?cation phase of the MISTA challenge, and was quali?ed for the second phase. We present computational experimentsonthe twenty instances of the challenge and compare them to the results of the quali?cation phase.
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-826-830-P, author = {L.M. Borba and A.J. Benavides and T. Zubaran and G.M. Carniel and M. Ritt},
title = {A simple stochastic local search for multi-mode resource-constrained multi-project scheduling },
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 = {826--830},
note = {Paper},
abstract = { In the multi-mode resource-constrained multi-project scheduling(MMRCMPSP) problem we have to ?nd execution modes and starting times for the jobs of multiple projects, such that the total project delay is minimized. The delay of a project is the difference between its makespan and a lower bound on its duration. Asecondary objective is to minimize the total makespan of all projects. The jobs of a project compete for renewable and nonrenewable local resources, and for global renewable resources shared among the projects. The duration and resource requirements of a job depend on its execution mode. We present a simple stochastic local search method for this problem. It maintains a feasible permutation and mode selection of the jobs, and improves it by swapping the order of two jobs, or changing the mode of a job. We propose several techniques to reduce size of the analyzed neighborhoods. The method has ranked fourth during the quali?cation phase of the MISTA challenge, and was quali?ed for the second phase. We present computational experimentsonthe twenty instances of the challenge and compare them to the results of the quali?cation phase.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-826-830-P.pdf} }