Citation
A Decomposition Heuristic for Planning and Scheduling of Jobs on Unrelated Parallel Machines. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 112-119, 2007.
Paper
Abstract
In this paper, we study a planning and scheduling problem for unrelated parallel machines. There are n jobs that have to be assigned and sequenced on m unrelated parallel machines. Each job has a weight that represents the priority of the corresponding customer order, a given due date, and a release date. An Automated Guided Vehicle is used to transport at maximum Load max jobs into a storage space in front of the machines in a given period of time. We consider T consecutive periods of time, and are interested in minimizing the total weighted tardiness (TWT) of the jobs across the T periods. To solve the problem, we present a mixed integer program (MIP) and a heuristic decomposition methodology. These methodologies are tested using stochastically generated test instances and compared. Results indicate that the decomposition approach performs comparably to the MIP while having reasonable solution times.
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{2007-112-119-P, author = {C. Habla and L. Mönch and C. Habla and L. Mönch},
title = {A Decomposition Heuristic for Planning and Scheduling of Jobs on Unrelated Parallel Machines},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {112--119},
note = {Paper},
abstract = {In this paper, we study a planning and scheduling problem for unrelated parallel machines. There are n jobs that have to be assigned and sequenced on m unrelated parallel machines. Each job has a weight that represents the priority of the corresponding customer order, a given due date, and a release date. An Automated Guided Vehicle is used to transport at maximum Load max jobs into a storage space in front of the machines in a given period of time. We consider T consecutive periods of time, and are interested in minimizing the total weighted tardiness (TWT) of the jobs across the T periods. To solve the problem, we present a mixed integer program (MIP) and a heuristic decomposition methodology. These methodologies are tested using stochastically generated test instances and compared. Results indicate that the decomposition approach performs comparably to the MIP while having reasonable solution times.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-112-119-P.pdf} }