Chains and Trees: 'Strong'-'Weak' Order in Job Scheduling

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We present a summary of recent NP-hardness and polynomial time solvability results for the distinction between 'strong' and 'weak' precedence for chains and trees in scheduling. We distinguish between chains and proper trees which are not chains, and demonstrate that the strong-weak precedence distinction for chains is not inclusive with regards to NP-hardness, and conjecture that the same holds for strong-weak tree precedence. The objective is to show that different 'interpretations' for chain and tree order relations in scheduling might have far reaching computational implications.

Original languageEnglish (US)
Pages (from-to)211-228
Number of pages18
JournalOrder
Volume14
Issue number3
StatePublished - 1997

Fingerprint

Weak Order
Job Scheduling
Hardness
Scheduling
NP-hardness
Polynomials
Order Relation
Solvability
Polynomial time
Demonstrate

Keywords

  • Complexity
  • Partial order
  • Scheduling

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

Chains and Trees : 'Strong'-'Weak' Order in Job Scheduling. / Dror, Moshe.

In: Order, Vol. 14, No. 3, 1997, p. 211-228.

Research output: Contribution to journalArticle

@article{6004187623104f94a31d2c1b7392070e,
title = "Chains and Trees: 'Strong'-'Weak' Order in Job Scheduling",
abstract = "We present a summary of recent NP-hardness and polynomial time solvability results for the distinction between 'strong' and 'weak' precedence for chains and trees in scheduling. We distinguish between chains and proper trees which are not chains, and demonstrate that the strong-weak precedence distinction for chains is not inclusive with regards to NP-hardness, and conjecture that the same holds for strong-weak tree precedence. The objective is to show that different 'interpretations' for chain and tree order relations in scheduling might have far reaching computational implications.",
keywords = "Complexity, Partial order, Scheduling",
author = "Moshe Dror",
year = "1997",
language = "English (US)",
volume = "14",
pages = "211--228",
journal = "Order",
issn = "0167-8094",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Chains and Trees

T2 - 'Strong'-'Weak' Order in Job Scheduling

AU - Dror, Moshe

PY - 1997

Y1 - 1997

N2 - We present a summary of recent NP-hardness and polynomial time solvability results for the distinction between 'strong' and 'weak' precedence for chains and trees in scheduling. We distinguish between chains and proper trees which are not chains, and demonstrate that the strong-weak precedence distinction for chains is not inclusive with regards to NP-hardness, and conjecture that the same holds for strong-weak tree precedence. The objective is to show that different 'interpretations' for chain and tree order relations in scheduling might have far reaching computational implications.

AB - We present a summary of recent NP-hardness and polynomial time solvability results for the distinction between 'strong' and 'weak' precedence for chains and trees in scheduling. We distinguish between chains and proper trees which are not chains, and demonstrate that the strong-weak precedence distinction for chains is not inclusive with regards to NP-hardness, and conjecture that the same holds for strong-weak tree precedence. The objective is to show that different 'interpretations' for chain and tree order relations in scheduling might have far reaching computational implications.

KW - Complexity

KW - Partial order

KW - Scheduling

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

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

M3 - Article

AN - SCOPUS:0042231826

VL - 14

SP - 211

EP - 228

JO - Order

JF - Order

SN - 0167-8094

IS - 3

ER -