Single Machine Scheduling with Precedence Constraints of Dimension 2

DOI10.1287/moor.9.2.248zbMath0541.90054OpenAlexW2083199589MaRDI QIDQ3329201

George Steiner

Publication date: 1984

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d9512c3fa3c6abac1da23e73583e85187ccf3619

zbMATH Keywords

precedence constraintsacyclic directed graphfeasible sequencepartial order dimension

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (12)

A compact labelling scheme for series-parallel graphs ⋮ An algorithm to generate the ideals of a partial order ⋮ On the computational complexity of the order polynomial ⋮ The minimum dummy task problem ⋮ Understanding the generalized median stable matchings ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ Transitive closure for restricted classes of partial orders ⋮ On estimating the number of order ideals in partial orders, with some applications ⋮ Algorithmic combinatorics based on slicing posets ⋮ Single machine precedence constrained scheduling is a Vertex cover problem ⋮ The use of dynamic programming in genetic algorithms for permutation problems ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

This page was built for publication: Single Machine Scheduling with Precedence Constraints of Dimension 2