Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
4Activity

Table Of Contents

INTRODUCTION
DETERMINISTIC MACHINE SCHEDULING
1.1 PRELIMINARIES
1.2 THE α|β|γ-NOTATION
FROM DETERMINISTIC TO STOCHASTIC SCHEDULING
2.1 SCHEDULES AND SCHEDULING POLICIES
2.1.1 Scheduling policies
2.1.2 Optimality of scheduling policies
2.1.3 Scheduling policies and on-line scheduling
2.2 LIST SCHEDULING POLICIES
2.2.1 Graham’s list scheduling
2.2.2 Job-based list scheduling
2.3 OPTIMAL SCHEDULING POLICIES AND RELATED RESULTS
2.3.1 Parallel machine scheduling
2.3.2 Single machine scheduling
2.3.3 The phenomenon of deliberate idle times
2.4 ADDITIONAL NOTES AND REFERENCES
APPROXIMATION IN STOCHASTIC SCHEDULING
3.1 INTRODUCTION
3.2 RELATED WORK IN STOCHASTIC SCHEDULING
3.3 LP-BASED APPROXIMATION IN STOCHASTIC SCHEDULING
3.4.1 Valid inequalities for stochastic scheduling
3.4.2 Polynomial time separation
3.5 SCHEDULING INDEPENDENT JOBS
3.5.1 Jobs with release dates
3.5.2 Jobs without release dates
3.5.3 Exponentially distributed processing times
3.6 SCHEDULING PRECEDENCE–CONSTRAINED JOBS 69
3.6 SCHEDULING PRECEDENCE–CONSTRAINED JOBS
3.6.1 List scheduling with deliberate idle times
3.6.2 General precedence constraints
3.6.3 In-forest precedence constraints
3.7 RESULTS FOR SINGLE MACHINE SCHEDULING
3.7.1 Independent jobs
3.7.2 Precedence-constrained jobs
3.8 ADDITIONAL NOTES AND REFERENCES
PROJECT SCHEDULING WITH START–TIME DEPENDENT COSTS
4.1 INTRODUCTION
4.2 SOLUTION TECHNIQUES: HISTORICAL SYNOPSIS
4.2.1 The z-formulation
4.2.2 The x-formulation
4.2.3 The minimum cut reduction
4.3 OUT-FOREST PRECEDENCE CONSTRAINTS
4.4 SERIES-PARALLEL PRECEDENCE CONSTRAINTS
4.5 ARBITRARY PRECEDENCE CONSTRAINTS
4.6 ADDITIONAL NOTES AND REFERENCES
5.1 INTRODUCTION
5.3 LOWER BOUNDS AND LAGRANGIAN RELAXATION
5.3.1 Lower bounds: A brief literature review
5.3.2 Lagrangian and linear programming relaxation
5.3.3 Lagrangian multiplier computation
5.3.4 Strengthening the lower bounds
5.4 FROM MINIMUM CUTS TO FEASIBLE SOLUTIONS
5.4.1 List scheduling by α-completion times
5.4.2 The Lagrangian-based heuristic
5.5 COMPUTATIONAL STUDY
5.5.1 Setup and benchmark instances
5.5.2 Lower bounds by Lagrangian relaxation
5.5.3 Lagrangian-based feasible solutions
5.5.4 Results for labor-constrained instances
5.6 ADDITIONAL NOTES AND REFERENCES
BIBLIOGRAPHY
SYMBOL INDEX
INDEX
ZUSAMMENFASSUNG
CURRICULUM VITAE
0 of .
Results for:
No results containing your search query
P. 1
Deterministic Scheduling Model

Deterministic Scheduling Model

Ratings: (0)|Views: 82 |Likes:
Published by abhinavamarshah

More info:

Published by: abhinavamarshah on Jul 08, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

04/08/2013

pdf

text

original

You're Reading a Free Preview
Pages 4 to 24 are not shown in this preview.
You're Reading a Free Preview
Pages 28 to 39 are not shown in this preview.
You're Reading a Free Preview
Pages 43 to 52 are not shown in this preview.
You're Reading a Free Preview
Pages 56 to 84 are not shown in this preview.
You're Reading a Free Preview
Pages 88 to 177 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->