'Strong''weak' precedence in scheduling: Extensions to seriesparallel orders

Moshe Dror, George Steiner

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 seriesparallel orders. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees as summarized in Dror (1997) [5]. Moreover, for seriesparallel posets we establish new computational complexity results for strong precedence constraints for single- and multi-machine problems.

Original languageEnglish (US)
Pages (from-to)1767-1776
Number of pages10
JournalDiscrete Applied Mathematics
Volume158
Issue number16
DOIs
StatePublished - Aug 28 2010

Fingerprint

Partially Ordered Set
Computational complexity
Computational Complexity
Scheduling
Modular Decomposition
Precedence Constraints
Single Machine
Scheduling Problem
Decomposition

Keywords

  • Posets
  • Scheduling
  • Strong and weak precedence

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

'Strong''weak' precedence in scheduling : Extensions to seriesparallel orders. / Dror, Moshe; Steiner, George.

In: Discrete Applied Mathematics, Vol. 158, No. 16, 28.08.2010, p. 1767-1776.

Research output: Contribution to journalArticle

@article{8165c84251cb4599b4784baf99d6cbc0,
title = "'Strong''weak' precedence in scheduling: Extensions to seriesparallel orders",
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 seriesparallel orders. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees as summarized in Dror (1997) [5]. Moreover, for seriesparallel posets we establish new computational complexity results for strong precedence constraints for single- and multi-machine problems.",
keywords = "Posets, Scheduling, Strong and weak precedence",
author = "Moshe Dror and George Steiner",
year = "2010",
month = "8",
day = "28",
doi = "10.1016/j.dam.2010.06.015",
language = "English (US)",
volume = "158",
pages = "1767--1776",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "16",

}

TY - JOUR

T1 - 'Strong''weak' precedence in scheduling

T2 - Extensions to seriesparallel orders

AU - Dror, Moshe

AU - Steiner, George

PY - 2010/8/28

Y1 - 2010/8/28

N2 - 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 seriesparallel orders. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees as summarized in Dror (1997) [5]. Moreover, for seriesparallel posets we establish new computational complexity results for strong precedence constraints for single- and multi-machine problems.

AB - 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 seriesparallel orders. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees as summarized in Dror (1997) [5]. Moreover, for seriesparallel posets we establish new computational complexity results for strong precedence constraints for single- and multi-machine problems.

KW - Posets

KW - Scheduling

KW - Strong and weak precedence

UR - http://www.scopus.com/inward/record.url?scp=77956177097&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956177097&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2010.06.015

DO - 10.1016/j.dam.2010.06.015

M3 - Article

AN - SCOPUS:77956177097

VL - 158

SP - 1767

EP - 1776

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 16

ER -