ISE 448: Sequencing and Scheduling-Elective (3-0-3)

Instructor : Dr. Mohamed Noomane Darghouth

Office: 22-235
Tel: 1086
E-mail: [email protected]
Office Hours: U-T 10:00 AM – 11:00 AM
Note: The best way to reach me is by email.

Catalog Description : Scheduling problems, optimality of schedules, processing, basic

single machine results, precedence constraints and efficiency,
constructive algorithms for flow-shops and job-shops, branch and
bound methods, integer programming formulations, hard problems
and NP-completeness. Heuristic methods. Parallel Processing and
Batch Sequencing. Open-Shop Scheduling problems.

Prerequisite(s) : ISE 303.

Textbook : Baker, K.R. and Trietsch D., “Principles of Sequencing and

Scheduling”, 2nd Edition, 2019.

References :
1. Dileep R. Sule, “Production Planning and Industrial
Scheduling”, 2008.
2. French, S., “Sequencing and Scheduling”, Ellis Harwood, 1982.
3. Pinedo, M., “Planning and Scheduling in manufacturing and
Services”, 2008.
4. Pinedo, M., “Scheduling: Theory, Algorithms and Systems”,
1995.
5. Baker, K.R., “Introduction to Sequencing and Scheduling”,
1974.

Objectives : To give students the necessary tools to formulate, analyze and solve
machine scheduling problems.

Learning Outcomes : 1. Identify different job-shop production system structures.

2. Identify different measures of the optimality of schedules.
3. Construct optimal schedules for some basic single machine
problems.
4. Construct optimal schedules for some basic flow-shop problems.
5. Construct integer programming formulation for the flow-shop
scheduling Problem.
6. Solve machine scheduling problems using Branch and Bound
approach.
 7. Apply different heuristics for solving the parallel scheduling
problem.
8. Apply different heuristics for solving the flow-shop scheduling
problem.
9. Apply different heuristics for solving the Job-shop scheduling
problem.
10. Apply different heuristics for solving the Open-shop scheduling
problem.

Detailed topics :

Topic Book Reference/Section

1 Introduction to sequencing and scheduling, terminology Handout
assumptions, notations and complexity
2 Single-Machine Scheduling Chapter 6 “Dileep R. Sule”
Tardiness Problem 6.1
Exact method for single machine scheduling problem 6.2
- Exhaustive Enumeration 6.2.1
- Brand and Bound Algorithm 6.2.2
Commonly used heuristic Rules 6.3
- Earliest Due Date Rule 6.3.1
- Cost Over Time (COVERT) Rule 6.3.2
- Shortest Processing Time (SPT) Rule 6.3.3
- Largest Penalty per Unit Length (LPUL) Rule 6.3.4
- Shortest Processing Time and LPUL Rule 6.3.5
- Shortest Weighted Processing Time (SWPT) Rule 6.3.6
- Largest Weight (WT) and LPUL Rule 6.3.7
- Critical Ratio (CR) Rule 6.3.8
Description of an Efficient Heuristic 6.4
- Backward Phase 6.4.1
- Forward Phase 6.4.2
Single Machine Problem with Early and Late Penalties 6.5
- Backward Phase 6.5.1
Some Well-Known Theorems 6.6
3 Other Objectives in Single-Machine Scheduling Chapter 7 “Dileep R. Sule”
- Common Due Date 7.1
- Early and Late Due Dates 7.3
- Minimization of the Average 7.5
- Minimization of the Maximum Delay 7.6
- Minimize the Number of Jobs That Are Delayed 7.7
4 Flow-shop Problems Chapter 8 “Dileep R. Sule”
Two-Machine Problem 8.1
 Three-Machine Problem 8.2
n Jobs/m-Machines Problem 8.5
- Minimize Machine Idle Time Method 8.5.1
- Palmer Procedure 8.5.2
- Nawaz Heuristic 8.5.3
- Campbell, Dudek, and Smith (CDS) Procedure 8.5.4
5 Parallel Processing and Batch Sequencing Chapter 9 “Dileep R. Sule”
Parallel Processing 9.1
- Jobs with Equal Weight and No Due Dates 9.1.1
- Jobs with Priorities Ranked by Weights 9.1.2
- Jobs with Due Dates 9.1.3

6 Job-Shop Scheduling Chapter 11 “Dileep R. Sule”

Job Shop 11.1
Job Shop Scheduling to Minimize Makespan (SPT) 11.2
- Shortest Processing Rule 11.2.1
Job Shop Scheduling to Minimize Tardiness 11.3
- The CEXSPT Rule 11.3.1
- Minimizing Penalty Using Modified Shifting 11.3.2
Bottleneck
7 Open-Shop Scheduling Chapter 12 “Dileep R. Sule”
- Minimize Makespan: Two-Machine Problem 12.1
- Minimize Makespan: Multiple-Machine Problem 12.2

ATTENDANCE
• University rules concerning attendance will be strictly enforced. Also, attendance
will count in your final grade.
• Mobile phones should not be visible in class. You will be considered absent if your
mobile is visible.
• Mobile phones are not allowed during exams. A visible mobile during exams is
considered cheating
GRADING SCHEME
The following standard grading scheme will be used

Aggregate Letter Aggregate Letter

Percentage Percentage
Grade Grade
Range Range
95-100 A+ 75-79 C+
90-94 A 70-74 C
85-89 B+ 65-69 D+
80-84 B 60-64 D
<= 59 F

ASSESSMENTS
- Midterm Exam Wednesday October 27, 2022 25%
- Final exam TBD 35%
- Homework 3 homework (See calendar) 15%
- Quizzes 5 quizzes (See calendar) 20%
- Attendance 5%

STUDENT RESPONSIBILITIES:
 Team work and student presentations will be encouraged throughout the
course
 You will be encouraged to participate in the class by cold calling
 Keep up with the material presented in class. If you get behind it, it will be
difficult to recover
 Be prepared for class. Read and prepare the assigned chapter(s) and related
materials before coming to class
 Submit assignments on time. Late assignments will not be accepted
 You are expected to attend all lectures and on time sharp
 Do not leave before the end of class
 A grade of "DN" will be given to students who exceed the unexcused absences
limit. Only prompt official or medical excuses will be accepted within a week
from the absence
 Please turn off mobile phones during all class activities
ACADEMIC INTEGRITY POLICY:
Cheating will not be tolerated! This includes plagiarism. University Study and
Examinations Regulations Article.38 states that “Cheating, or attempting to cheat, or
violating instructions and examination regulations shall render the offender subject to
punishment in accordance with the student disciplinary rules as issued by the University
Council” along with its implementation rules.
Check Students responsibilities in the Guidelines for Conducting Exams at KFUPM
http://regweb.kfupm.edu.sa/news11.htm

Prepared by: Dr. M.N. Darghouth Date: August 28, 2022