THE ORDER-THEORETIC APPROACH TO SCHEDULING: THE DETERMINISTIC CASE

This publication has 25 references indexed in Scilit:

• Scheduling project networks with resource constraints and time windows
  Annals of Operations Research, 1988
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
  Discrete Mathematics, 1987
• Project scheduling with resource constraints: A branch and bound approach
  European Journal of Operational Research, 1987
• A simple linear-time algorithm to recognize interval graphs
  Published by Springer Nature ,1987
• Interval graphs and related topics
  Discrete Mathematics, 1985
• A Fast Algorithm for the Decomposition of Graphs and Posets
  Mathematics of Operations Research, 1983
• Scheduling Opposing Forests
  SIAM Journal on Algebraic Discrete Methods, 1983
• An algorithm for generating all maximal independent subsets of posets
  Computing, 1981
• An Algorithm for Project (Job) Sequencing with Resource Constraints
  Operations Research, 1972
• Transitiv orientierbare Graphen
  Acta Mathematica Hungarica, 1967