Citation
Two-machine Shop Floor Scheduling Problem with Multi-Predecessor Constraints*. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 538-545, 2007.
Paper
Abstract
This paper deals with a two-machine shop floor scheduling problem with multi-predecessor constraints. The problem is proved to be NP-hard in strong sense. The paper proves that under some additional constraints the Algorithm ISPT (Instant Shortest Processing Time first) results an optimal solution. A branch and bound algorithm is developed for the general case and some dominant rules are provided.
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-538-545-P, author = {X. Zhang and J. N.D. Gupta},
title = {Two-machine Shop Floor Scheduling Problem with Multi-Predecessor Constraints*},
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 = {538--545},
note = {Paper},
abstract = {This paper deals with a two-machine shop floor scheduling problem with multi-predecessor constraints. The problem is proved to be NP-hard in strong sense. The paper proves that under some additional constraints the Algorithm ISPT (Instant Shortest Processing Time first) results an optimal solution. A branch and bound algorithm is developed for the general case and some dominant rules are provided.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-538-545-P.pdf} }