{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Homework_06

# Homework_06 - IOE 543 SCHEDULING WINTER 2010 HOMEWORK 6(Due...

This preview shows pages 1–2. Sign up to view the full content.

IOE 543: SCHEDULING WINTER 2010 HOMEWORK # 6 (Due at the beginning of class Tuesday, 3/16) 1. Consider a flow shop with two machines, where jobs visit Machine 1 first and Machine 2 second. Assume that there are two units of storage space between the two machines. Suppose we have five jobs to process in this flow shop. The processing times of the jobs at each of the two machines are shown in the following table: Machine 1 Machine 2 Job 1 3 4 Job 2 2 4 Job 3 2 3 Job 4 1 3 Job 5 1 2 These jobs will follow a permutation schedule in the order of Jobs 1, 2, 3, 4 and 5. Determine the resulting makespan. 2. Consider a flow shop with four machines where there is unlimited storage space between successive machines. Suppose we have four jobs to process in this flow shop. The processing times of the jobs at each of the four machines are shown in the following table: Machine 1 Machine 2 Machine 3 Machine 4 Job 1 3 4 5 6 Job 2 2 3 4 5 Job 3 6 5 4 3 Job 4 1 2 5 4 Apply the slope heuristic to determine the permutation sequence(s) to be used in this flow shop.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

Homework_06 - IOE 543 SCHEDULING WINTER 2010 HOMEWORK 6(Due...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online