Production Scheduling Management
Title of the Course： Production Scheduling Management
Course Teacher： Ming LIU
Language： English
Students： Foreign students
Inside Class Credit Hours： 18
Extracurricular class hours：18
Prerequisite： Operations Research,
Number of students : ≤ 40
Semester： First
Credit: 1
1. Profile and Contact way of the Teachers
LIU Ming, is an assistant professor at School of Economics and Management, Tongji
University. In 2009, he obtained his first Ph.D. in Ecole Centrale Paris. In 2010, he got
another Ph.D. in Xi’an Jiaotong University and obtained Excellent Doctor in Shaanxi Province.
His main research area is scheduling management and maritime logistics. He has been
supported by NSF (National Science Foundation) for the project of “ Scheduling with
deteriorating effects”. He has published more than 30 papers in international journals,
including Transportation Science, European Journal of Operational Research, Theoretical
Computer Science, Journal of Combinatorial Optimizations, and so on.
TEL: 021-65975791
Email: mingliu@tongji.edu.cn
1
2. Course Description
Scheduling deals with the allocation of scarce resources to tasks over time. It is a
decision-making process with the goal of optimizing one or more objectives.
The resources and tasks in an organization can take many forms. The resources may be
machines in a workshop, runways at an airport, crews at a construction site, processing units
in a computing environment, and so on. The tasks may be operations in a production process,
take-offs and landings at an airport, stages in a construction project, executions of computer
programs, and so on. Each task may have a certain priority level, an earliest possible starting
time, and a due date. The objective may be the minimization of the completion time of the last
task, and another may be the minimization of the number of tasks completed after their
respective due dates.
In the current competitive environment of manufacturing and service industries, scheduling
has become a necessity for survival in the marketplace. Companies have to meet shipping
dates that have been committed to customers, as failure to do so may result in a significant
loss of goodwill.
3. Course Objectives and Requirements
1. Objective: The purpose of this course is to teach the theory of scheduling. This part
deals with the detailed scheduling of jobs. Given a collection of jobs to be processed in a
certain machine environment, the problem is to sequence the jobs, subject to given
constraints, in such a way that one or more performance criteria are optimized. The scheduler
may have to deal with various forms of uncertainties, such as random job processing times,
machines subject to breakdown, rush orders, and so on. One important thing is to equip the
students with the basic knowledge to learn and further study some specific scheduling
problems.
2
2. Requirement: Prerequisite knowledge for this course is an elementary course in
Operations Research. Students need to complete the homework and a final project on time.
4. Course Arrangement
Production Scheduling
Course
Unit
Management
Hours
Content
Teaching time
20 hours
Materials
Cases
Unit one：Preliminaries
1
4
1.
Introduction to scheduling
Chapter 2, in book of
SAP’s
2.
Machine environment
<Scheduling: Theory,
Advanced
3.
Processing characteristics and
Algorithms, and
Planner and
constraints
Systems (Second
Optimizer(AP
4.
Objective functions
Edition)>
O)
5.
Classes of scheduling
Unit 2: Single machine model
The total weighted completion
Chapter 3, in book of
time
<Scheduling: Theory,
2.
The maximum lateness
Algorithms, and
3.
The number of tardy jobs
Systems (Second
4.
The total tardiness
Edition)>
5.
The total weighted tardiness
1.
2
4
Unit 3: Computational complexity
1.
3
4
4
4
IBM’s
independent
agent
architecture
Book of <Computers
Decision problem v.s.
and Intractability: A
Travelling
guide to the Theory of
Salesman
NP-Completeness>
Problem
Unit 4：Parallel machine models
Chapter 5, in book of
i2’s
The makespan without
<Scheduling: Theory,
tradematrix
preemptions
Algorithms, and
production
The makespan with
Systems (Second
scheduler
Optimization problem
2.
Class of P
3.
Class of NP
4.
NP-Complete v.s. NP-hard
1.
2.
3
preemptions
3.
Edition)>
The total completion time
without preemptions
4.
The total completion time with
preemptions
Unit 5：Shop models
5
2
1.
Flow shop
2.
Job shop
3.
Open shop
4.
Heuristics
5.
Branch and bound algorithm
Chapter 6-8, in book of
<Scheduling: Theory,
Algorithms, and
Systems (Second
Edition)>
5. Teaching Methods
Teaching, discussion, and case study.
6. Learning Outcomes Expected
Field
Expectation
1. Basic framework and notation
2. Basic concept in complexity
3. Complexity hierarchy in scheduling
4. Analysis method: adjacent pairwise interchange
Knowledge
5. Analysis method: the smallest counterexample
6. Johnson algorithm
7. Dynamic programming in scheduling
8. Heuristic methods
9. Branch and bound algorithm
1. Modeling
Capability
2. Searching related references
3. Application of heuristic methods
4
An
implementatio
n of cybertec’s
cyberplan
4. Design of dynamic programming
5. Design of branch and bound algorithm
6. Analysis of approximation algorithms
1. Cautious attitude in work
2. Creative thinking
Personal
quality
3. Application-oriented research
4. sustainable study
5. Communication and cooperation
6. Oral presentation
7. Team working
7. Performance Evaluation: Means & Ratio
Test
percent
methods
（%）
Homework
30
Connection to expectation of learning
1. Based on the basic theoretical results, the students
learn more knowledge closely related to the content.
2. They have the ability of searching references.
Final project
70
1. Based on their interest, the students are free to
choose a topic of scheduling to research. They must
use their creation to establish the model on the basis
of application.
2. They must use searching engine to obtain literature,
such as google, elsever and sciencedirect database.
The capability of sustainable learning is developed.
3. A team consists of three students, they need to
communicate and cooperate. Team working is trained.
5
4. After preparation, the students have to present their
final project orally with slides (PPT).
8.Textbook，References and Reading Materials
1. Teaching materials
[1] Michael Pinedo, Scheduling: Theory, Algorithms, and Systems (Second Edition),
Prentice-Hall, Inc, 2005.
[2] Peter Brucker, Scheduling Algorithms (Fourth Edition), Springer, 2004.
[3] Michael R. Garey and David S. Johnson, Computers and Intractability: A guide to the
Theory of NP-Completeness, Freeman & Co., San Francisco, 1979.
2. Website
[1] Library of Tongji University：http://www.lib.tongji.edu.cn/
[2] Sciencedirect：http://www.sciencedirect.com/
[3] Google：http://www.google.com/
3. Journals
[1] Journal of Scheduling
[2] European Journal of Operational Research
[3] Operations Research
[4] Management Science
9. Cases
[1] SAP’s Advanced Planner and Optimizer(APO)
[2] IBM’s independent agent architecture
[3] i2’s tradematrix production scheduler
[4] An implementation of cybertec’s cyberplan
6
10. Assignment Requirements
Students are free to choose a topic related to scheduling. The project should be
specifically associated with real-time applications. Students need to search references,
establish models, design and analysis algorithms. Finally, form a report and make oral
presentation.
Requirement：
1)
Briefly make a state-of-the-art about the topic.
2)
Each team contains three students.
3)
Perform oral presentation with slides (or PPT) and hand over a WORD (or PDF)
report.
Criteria（100 point）:
1)
Integrity of state-of-the-art
10 point
2)
Modeling
10 point
3)
Design of algorithms
20 point
4)
Analysis of the algorithms
20 point
5)
Team working
20 point
6)
Presentation and report
20 point
The criteria of assignment evaluation (100 points)
1)
Whether the case material collection is completed or not
20 points
2)
Whether the case analysis is system in-depth or not
25 points
3)
Whether the insights is linked with work practice closely or not
25 points
4)
Participation of group members in case discussion
20 points
5)
Whether the PPT and document is made seriously and beautiful
10 points
Appendix:
1. Slides
7