A note on the precedence-constrained class sequencing problem

DOI10.1016/j.dam.2006.03.038zbMath1108.68061OpenAlexW2095451956WikidataQ65553917 ScholiaQ65553917MaRDI QIDQ868379

José R. Correa, Samuel Fiorini, Nicolás E. Stier-Moses

Publication date: 2 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.038

zbMATH Keywords

approximation algorithmshardness of approximationprecedence-constrained scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

An exact dynamic programming algorithm for the precedence-constrained class sequencing problem

Cites Work

• Non-approximability of precedence-constrained sequencing to minimize setups.
• On the complexity of loop fusion
• Routing Printed Circuit Cards Through an Assembly Cell
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• On approximation properties of the Independent set problem for degree 3 graphs

This page was built for publication: A note on the precedence-constrained class sequencing problem