See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/225017349

Scheduling: Theory, Algorithms, And Systems

Chapter · January 2008

CITATIONS READS
4,961 7,592

1 author:

Michael Pinedo
New York University
290 PUBLICATIONS   13,938 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Scheduling Theory Algorithms and Systems View project

All content following this page was uploaded by Michael Pinedo on 20 February 2014.

The user has requested enhancement of the downloaded file.

 Scheduling
Theory, Algorithms, and Systems
4th Edition

Michael Pinedo

(Springer)
 Scheduling: Theory, Algorithms and Systems

Materials Provided by:

Julius Atlason (University of Michigan)

Heidemarie Braesel (University of Magdeburg)
Johann Hurink (Technical University of Twente)
Pinar Keskinocak (Georgia Tech)
Rakesh Nagi (SUNY Buffalo)
Tim Nieberg (University of Bonn)
Uwe Schwiegelshohn (University of Dortmund)
Natalia Shakhlevich (University of Leeds)
Sridhar Tayur (Carnegie Mellon University)
 Scheduling: Theory, Algorithms and Systems

Contents of the CD:

1. Slides from Academia
a. Julius Atlason (University of Michigan)
b. Johann Hurink (Technical University of Twente)
c. Rakesh Nagi (SUNY at Buffalo)
d. Tim Nieberg (University of Bonn)
e. Uwe Schwiegelshohn (University of Dortmund)
f. Natalia Shakhlevich (University of Leeds)

2. Scheduling Systems

a. Lekin (Michael Pinedo, Andrew Feldman, New York

University)
b. LiSA (Heidemarie Braesel, University of Magdeburg)
c. TORSCHE (Michal Kutil, Czech Technical University,
Prague)

3. Case

a. “Managing Operations in the Time-Shared Jet Business”.

(Pinar Keskinocak, Georgia Institute of Technology, &
Sridhar Tayur, Carnegie Mellon University)
 Scheduling: Theory, Algorithms and Systems

4. Mini Cases

Asprova

a. Kihara Manufacturing Company

b. Mitsubishi Electric Corporation (Nakatsugawa Works)
c. Autoparts Manufacturer
d. Mitsubishi Electric Corporation (Nagoya Plant)
e. Mitusbishi Heavy Industries, Ltd.

Preactor

f. Plastform
g. Teikon

SAP

h. Grammer
i. Mittal Steel Germany
j. mySAP Supply Chain Management

Taylor Software

k. BCM Kosmetik GmbH

l. Beaver Plastics
m. Fountain Set (Holdings) Limited
n. Lexmark
o. Major Pharmaceuticals Manufacturer
p. Major Printing Supplies Company
 Scheduling: Theory, Algorithms and Systems

5. Handout Material

a. Natalia Shakhlevich (University of Leeds)

6. Movies

a. SAIGA
b. United Airlines
c. Preactor (Part I&II)
 Scheduling: Theory, Algorithms and Systems

1. Slides from Academia

The textbook, Scheduling: Theory, Algorithms, and Systems, has been adopted by
more than 20 instructors worldwide. A number of these instructors have developed
elaborate websites and large number of power point transparencies and PDF slides.
In this CD we have compiled the material developed by five of them, namely

a. Julius Atlason (University of Michigan) ……… 252 transparencies

b. Johann Hurink (Technical University of Twente) ……..…339 PDF slides

c. Rakesh Nagi (SUNY at Buffalo) ……..…………… 175 PDF slides

………………… 43 transparencies

d. Tim Nieberg (University of Bonn) ……………………. 130 PDF slides

e. Uwe Schwiegelshohn (University of Dortmund) ...…… 344 PDF slides

154 transparencies

f. Natalia Shakhlevich (University of Leeds) ……………70 transparencies

 Scheduling: Theory, Algorithms and Systems

a. University of Michigan
Professor Julius Atlason

Course Title: Scheduling

Course Description: The problem of scheduling several tasks over time, including the
topics of measures of performance, single-machine sequencing, flow shop scheduling, the
job shop problem, and priority dispatching. Integer programming, dynamic
programming, and heuristic approaches to various problems are presented.

b. University of Twente
Professor Johann Hurink

Course Title: Scheduling

Course Description: The term scheduling represents the assignment of resources over
time to perform some tasks, jobs or activities. Feasible schedules are compared with
respect to a given optimality criterion. Mostly, the optimization problem is combinatorial
and very complex. From a computational point of view these problems are hard (NP-
hard) and the classical techniques fail in practice. Therefore, the optimal solution is often
approximated by heuristics.

The following subjects are discussed:

 CPM and PERT
 Single-Machine Models (Exact and Approximation Methods)
 Parallel Machines
 On-Line Models
 Open Shop, Flow Shop and Job Shop Models
 Timetabling
 Scheduling: Theory, Algorithms and Systems

c. SUNY at Buffalo
Professor Rakesh Nagi

Course Title: Scheduling Theory

Course Description: The objective of this graduate level course is to expose participants
to basic scheduling theory results, and in a participatory setting, enable them to discuss
and creatively synthesize these ideas to research projects of choice. It blends quantitative
and qualitative material, from multiple disciplines of industrial and management
engineering. The course will be conducted in a beneficial cooperative learning setting.
Lectures, group discussions, research projects and participant presentations will
constitute this course. The following topics will be covered.

Course Topics:

Introduction

Part 1: Deterministic Models

 Framework, Notation and Complexity Hierarchy
 Single Machine Models
 Advanced Single Machine Models
 Parallel Machine Models
 Flow Shop and Flexible Flow Shops
 Job Shops
 Open shops

Part 2: Stochastic Models

 Introduction and Basic Results

Part 3: Project and Network Scheduling

 JIT Scheduling of Assemblies
 Integrated Lot-Sizing
 Integrated Material Handling

Part 4: Scheduling in Practice

 Dispatching Rules
 Filtered Beam Search
 Local Search: SA, Tabu Search, GA

Several Research Articles and Case Studies

 Scheduling: Theory, Algorithms and Systems

d. University of Dortmund
Professor Uwe Schwiegelshohn

e. University of Bonn
Professor Tim Nieberg
• Course Title: Scheduling
• Course Description: The term scheduling represents the assignment of resources over
time to perform some tasks, jobs or activities. Feasible schedules are compared with
respect to a given optimality criterion. Mostly, the optimization problem is
combinatorial and very complex. From a computational point of view these problems
are hard (NP-hard) and the classical techniques fail in practice. Therefore, an optimal
solution is often approximated. The following topics will be discussed:
• Classification of scheduling models
• Single-machine models
• Parallel-machine models
• Open shop, flow shop and job shop models
• Timetabling
• Transportation
• On-line models
 Scheduling: Theory, Algorithms and Systems

f. University of Leeds
Professor Natalia Shakhlevich

Course Title: Scheduling: Models and Algorithms

Course Description: On completion of this module, students should: understand the

general concepts of scheduling theory, have an appreciation of a variety of techniques
and approaches, be able to apply basic scheduling algorithms to solve a wide range of
problems, have some experience of using scheduling software, understand the importance
of algorithm analysis.

Syllabus: Scheduling applications and terminology. Exact and approximation

algorithms for single-stage processing systems (single machine, parallel machines) and
multi-stage systems (flow shop, open shop, job shop). General scheduling techniques:
dispatching rules, branch and bound algorithm, beam search, shifted bottleneck
procedure. Local search methods: iterative improvement, threshold acceptance,
simulated annealing, tabu search, genetic algorithms. Computational complexity,
algorithm analysis.
 Scheduling: Theory, Algorithms and Systems

2. Scheduling Systems

a. LEKIN
This CD contains a copy of the LEKIN
scheduling system, which is being used
at hundreds of universities and
companies worldwide.

b. LiSA

This program is provided by Heidemarie Braesel, University of

Magdeburg.

c. TORSCHE

Provided by Michal Kutil, Czech Technical University, Prague.

 Scheduling: Theory, Algorithms and Systems

3. Case
“Managing Operations in the Time-Shared Jet Business”.
(Pinar Keskinocak, Georgia Institute of Technology, and
Sridhar Tayur, Carnegie Mellon University)
 Scheduling: Theory, Algorithms and Systems

4. Mini Cases:
Asprova

a. Kihara Manufacturing Company

b. Mitsubishi Electric Corporation (Nakatsugawa Works)
c. Autoparts Manufacturer
d. Mitsubishi Electric Corporation (Nagoya Plant)
e. Mitusbishi Heavy Industries, Ltd.

Preactor

f. Plastform
g. Teikon

SAP

h. Grammer
i. Mittal Steel Company
j. mySAP Supply Chain Management

Taylor Software

k. BCM Kosmetik Gmbh

l. Beaver Plastics
m. Fountain Set (Holdings) Limited
n. Lexmark
o. Major Pharmaceuticals Manufacturer
p. Major Printing Supplies Company
 Scheduling: Theory, Algorithms and Systems

5. Handouts

This section includes papers that are useful additional reading. The
papers are selected based on the insights and perspectives they provide.

Natalia Shakhlevich (University of Leeds) …… 12 Handouts

 Scheduling: Theory, Algorithms and Systems

6. Movies
Double-click on the movie. The movie should automatically open in
either Windows Media Player, or Winamp. If you cannot view the
movie, go to the Microsoft website (http://www.microsoft.com) and
download Windows Media Player.

a. Saïga

Aéroports de Paris (A 14 minute film)

Presenting Saïga, an application

developed with ILOG products by
Aéroports de Paris. Designed to
optimize resource allocation at airports,
Saïga includes a graphical user
interface, a planning and allocation
optimization module, and a real-time
control engine. ILOG products are used at many other airports
throughout the world as well. At London’s Heathrow Airport, for
example, British Airways is using an ILOG-based application to
design the proposed Terminal 5.

Airports are not the only operations that use ILOG products; they
are also widely used in the telecommunications, defense,
transportation and manufacturing industries. Also featured in the
film is an ILOG-based system used by Motorola to schedule the
satellites in IRIDIUM, a global communication system.
 Scheduling: Theory, Algorithms and Systems

b. United Airlines

PEGASUS Software (A 10 minute film)

Managing flight schedules tends to be a very
complicated process and involves many
different variables, like aircraft scheduling,
maintenance, crew scheduling and so on.
Moreover, it has to be flexible enough to
meet the changing expectations of the
customers. PEGASUS, the scheduling system developed by United
Airlines, uses a heuristic system, instead of a linear program, to develop
flight schedules that are both efficient and flexible.

c. Preactor International

Preactor International is a world leader in

Production Planning and Scheduling software
used by a wide range of businesses. So
successful has Preactor's breakthrough
technology been that the number of
companies using the product recently reached
the 3,500 mark. These companies are a mix of
small and medium sized as well as large
corporations located in 67 countries. Preactor is used by companies in
discrete, process and mixed mode type of environments. It is equally at
home in modelling plants that involve machines, packing lines, tanks,
assembly lines and so on in make to order, make to stock, engineer to
order, repetitive and continuous processes.

View publication stats