scientific article; zbMATH DE number 3894816
From MaRDI portal
Publication:5187058
zbMath0561.90048MaRDI QIDQ5187058
F. J. Radermacher, Rolf H. Möhring
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
resource allocationperformance measureproject networksoptimal non-preemptive schedulingexistence of an optimal schedulefeasible partial orderresource duration interactionseparable objective
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Algorithmic characterizations of interval orderd hypergraphs and applications, Schedule-induced posets, Scheduling of project networks, When greediness fails: examples from stochastic scheduling., Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results, Preemptive scheduling and antichain polyhedra, Modelling setup times, process batches and transfer batches using activity network logic