Scribd
Upload
39 views1 page

Tutorial #7

This document outlines problems for a production and operations management class involving scheduling jobs on different machine configurations to minimize various performance measures like mean flow time, lateness, and makespan. Students are assigned problems to solve in class with guidance from a TA and problems to solve and submit involving scheduling 10 jobs on a single machine or across 2 machines to minimize objectives like flow time, lateness, and makespan.

Uploaded by

Modather Salah
Copyright
© Attribution Non-Commercial (BY-NC)
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
39 views1 page

Tutorial #7

This document outlines problems for a production and operations management class involving scheduling jobs on different machine configurations to minimize various performance measures like mean flow time, lateness, and makespan. Students are assigned problems to solve in class with guidance from a TA and problems to solve and submit involving scheduling 10 jobs on a single machine or across 2 machines to minimize objectives like flow time, lateness, and makespan.

Uploaded by

Modather Salah
Copyright
© Attribution Non-Commercial (BY-NC)
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
You are on page 1/ 1

Cairo University Faculty of Engineering Mechanical Design & Production Dept.

t. Production & Operations Management (MDP408b) Spring 2011 Tutorial #7: 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 1 2 3 4 5 6 7 8 9 10 Processing Time Machine A Machine B 1 5 10 6 5 11 2 8 8 12 7 14 8 7 4 10 3 6 6 12 Due Date 10 20 15 10 10 25 15 25 10 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