Homework_07

Homework_07 - IOE 543: SCHEDULING WINTER 2010 HOMEWORK # 7...

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

View Full Document Right Arrow Icon
IOE 543: SCHEDULING WINTER 2010 HOMEWORK # 7 (Due at the beginning of class on Thursday, 3/25) 1. Consider the following information for a job shop with four machines. Our goal is to minimize the makespan with no preemptions allowed. Jobs Routing Processing Times 1 Machines 1, 2, 3 p 11 = 9, p 21 = 8, p 31 = 4 2 Machines 1, 2, 4 p 12 = 5, p 22 = 6, p 42 = 3 3 Machines 3, 1, 2 P 33 = 10, p 13 = 4, p 23 = 9 (a) Apply the shifting bottleneck heuristic to this set of jobs. In solving the 1 | r j | L max problems that arise in the process, pick a good schedule using your judgment. (b) Consider the following heuristic for the same problem: Each time a machine is freed, select the job (among the ones immediately available for processing on the machine) with the largest total remaining processing (including the processing on the machine freed). If multiple machines are freed at any point in time, first consider the machine with the largest remaining workload. What is the makespan when you use this
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/16/2012 for the course IEOR 466 taught by Professor Richard during the Spring '12 term at Columbia.

Page1 / 2

Homework_07 - IOE 543: SCHEDULING WINTER 2010 HOMEWORK # 7...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online