Schedule-induced posets

DOI10.1016/0166-218X(86)90008-9zbMath0601.90077OpenAlexW1999337916MaRDI QIDQ1081529

F. J. Radermacher

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90008-9

zbMATH Keywords

sequencingFibonacci numberscritical path analysisinterval ordersfinite system of posetsproject networksregular measures of performanceschedule-induced posets

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Resource allocation by means of project networks: Dominance results ⋮ Resource allocation by means of project networks: Complexity results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost all comparability graphs are UPO
• Scheduling of project networks
• Properties of almost all graphs and complexes
• Scheduling Interval-Ordered Tasks
• Scheduling Problems with a Singular Solution
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Intransitive Indifference in Preference Theory: A Survey
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Schedule-induced posets