Citation
Strong-Weak Precedence in Scheduling: Extended Order Implications. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 28-42, 2009.
Paper
Abstract
We examine computational complexity implications for scheduling problems with job precedence relations with respect to strong precedence versus weak precedence. We propose a consistent definition of strong precedence for chains, trees, and series parallel graphs. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees as summarized in [5]. Moreover, for series parallel graphs we establish new computational complexity results for strong precedence constraints for single and multiple machine problems.
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{2009-028-042-P, author = {M. Dror and G. Steiner},
title = {Strong-Weak Precedence in Scheduling: Extended Order Implications},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {28--42},
note = {Paper},
abstract = {We examine computational complexity implications for scheduling problems with job precedence relations with respect to strong precedence versus weak precedence. We propose a consistent definition of strong precedence for chains, trees, and series parallel graphs. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees as summarized in [5]. Moreover, for series parallel graphs we establish new computational complexity results for strong precedence constraints for single and multiple machine problems.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-028-042-P.pdf} }