Scribd
Upload
5 views1 page

Tutorial 8-Scheduling

The document outlines a tutorial for a course on Production Planning and Control at Cairo University, focusing on operations scheduling. It includes specific problems for students to solve in class and for submission, along with a data set for scheduling jobs on machines A and B. The problems involve developing schedules to minimize various metrics such as mean flow time, lateness, and tardy jobs.

Uploaded by

Mohamed Mostafa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

Tutorial 8-Scheduling

The document outlines a tutorial for a course on Production Planning and Control at Cairo University, focusing on operations scheduling. It includes specific problems for students to solve in class and for submission, along with a data set for scheduling jobs on machines A and B. The problems involve developing schedules to minimize various metrics such as mean flow time, lateness, and tardy jobs.

Uploaded by

Mohamed Mostafa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Cairo University – Faculty of Engineering – Mechanical Design & Production Dept.

Production Planning and Control (MDP4340) – Spring 2026


Tutorial #8: Operations Scheduling
Problems to be solved by students in class with guidance from the TA: 1 (b, c), 2(b)
Problems to be solved by the TA in class: 1 (a, d), 2 (a), 3
Problems to be solved by students and submitted next week: ---

The following data set is used in conjunction with problems 1-3.

Job Processing Time Due Date


Machine A Machine B
1 1 5 10
2 10 6 20
3 5 11 15
4 2 8 10
5 8 12 10
6 7 14 25
7 8 7 15
8 4 10 25
9 3 6 10
10 6 12 20

1) Consider scheduling the 10 jobs in the above table on a single machine A


a) Develop a schedule that minimizes the mean flow time. What are the resulting makespan,
average flow time, average lateness, average tardiness, maximum lateness and number of
tardy jobs?
b) Develop a schedule that minimizes the mean lateness. What are the resulting makespan,
average flow time, average lateness, average tardiness, maximum tardiness and number of
tardy jobs?
c) Develop a schedule that minimizes the maximum lateness. What are the resulting
makespan, average flow time, average lateness, average tardiness, maximum tardiness and
number of tardy jobs?
d) Develop a schedule that minimizes the number of tardy jobs. What are the resulting
makespan, average flow time, average lateness, average tardiness, maximum lateness and
number of tardy jobs?

2) For the above data set, assume there are 2 machines of type A. That is, each of the 10 jobs can
be scheduled on either one of the machines.
a) Develop a schedule for each machine that minimizes the mean flow time. What are the
resulting makespan, average flow time, average lateness, average tardiness, maximum
lateness and number of tardy jobs?
b) Develop a schedule for each machine that tends to minimize the makespan. What is the
resulting makespan, average flow time, average lateness, average tardiness, maximum
lateness and number of tardy jobs?

3) For the above data set, assume that the configuration is a 2-machine flow shop. That is, all jobs
first visit machine A then machine B. Develop a schedule that minimizes the makespan. What
are the resulting makespan, average flow time, average lateness, average tardiness, maximum
lateness and number of tardy jobs?

You might also like