Citation
Scheduling identical jobs on uniform parallel machines to minimize maximum lateness. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 195-199, 2011.
Paper
Abstract
The problem of how to schedule n identical jobs on m uniform parallel machines to minimize some objective function is very common in practice. In many real-world factories, any instance of a product type requires the same processing time on the same machine. Furthermore, factories often buy new equipment but retain their slower, older equipment; this results in machines that have different processing speeds. In this research, we propose a fast linear programming (LP) model to schedule identical jobs on uniform parallel machines to minimize maximum lateness. Moreover, we propose a heuristic to schedule identical jobs with distinct release dates on uniform parallel machines to minimize maximum lateness. Computational results show that the proposed LP model can find optimal solutions in less computational time than other LP models require. The proposed heuristic also outperforms existing heuristics in terms of maximum lateness.
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{2011-195-199-P, author = {Y.K. Lin and F. Y. Hsieh and G. J. Lin},
title = {Scheduling identical jobs on uniform parallel machines to minimize maximum lateness},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {195--199},
note = {Paper},
abstract = {The problem of how to schedule n identical jobs on m uniform parallel machines to minimize some objective function is very common in practice. In many real-world factories, any instance of a product type requires the same processing time on the same machine. Furthermore, factories often buy new equipment but retain their slower, older equipment; this results in machines that have different processing speeds. In this research, we propose a fast linear programming (LP) model to schedule identical jobs on uniform parallel machines to minimize maximum lateness. Moreover, we propose a heuristic to schedule identical jobs with distinct release dates on uniform parallel machines to minimize maximum lateness. Computational results show that the proposed LP model can find optimal solutions in less computational time than other LP models require. The proposed heuristic also outperforms existing heuristics in terms of maximum lateness.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-195-199-P.pdf} }