Algorithmische Diskrete Mathematik III
Scheduling and Project Planning
WS 20014/15

• Slides of the Introduction
• §1 Projects and Partial Orders
• §2 The Deterministic Project Scheduling Model
• eChalk from 17 Oct 2014
• §3 The Stochastic Scheduling Model
• §4 Scheduling subject to Scarce Resources: Introduction and Complexity
• eChalk from 24 Oct 2014
• §5 Scheduling Policies
• §6 Priority Policies
• §7 Early Start (ES) Policies
• eChalk from 31 Oct 2014
• §8 Constructing ES Policies
• §9 Preselective Policies
• eChalk from 7 Nov 2014
• §10 Constructing and Evaluating Preselective Policies
• §11 Characterizing ES- and Preselective Policies
• §12 Set Policies
• eChalk from 28 Nov 2014
• §13 Performance Guarantees of Simple Policies for the Expected Makespan
• §14 Performance Guarantees of Simple Policies for the Expected Weighted Sum of Completion Times
• eChalk from 5 Dec 2014
• §15 Stochastic Online Scheduling for the Expected Weighted Sum of Completion Times
• eChalk from 12 Dec 2014
• §16 Evaluating the Distribution of the Objective Value of a Policy
• §17 Bounding the Distribution Function of the Makespans
• §18 Bounds for Dependent Processing Times and C_max
• §19 Time-cost Tradeoff Problems
• eChalk from 16 Jan 2015
• §20 More on Complexity of Project Scheduling with Resource Constraints
• eChalk from 23 Jan 2015
• eChalk from 30 Jan 2015
• §21 Generalized Project Scheduling Problems and IP-Models