HW1+Solution

HW1+Solution - IOE543Winter2010 Homework1Solution...

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

View Full Document Right Arrow Icon
IOE 543 Winter 2010 Homework 1 Solution 2.1 (a) Optimal sequence: 2 >1 >3 >4 The objective value is 333 (d) Both generic rules give the same sequence 2 >1 >3 >4. Since the objective function is of the form ∑ w C , rule (ii) is more suitable for the problem 2.2 (a) The optimal sequence is 1 >2 >3 >4 or 2 >1 >3 >4 The objective value is 6 (d) Rule (iii) is the most suitable for the problem 2.3 (a) All the optimal sequences are: 1 >3 >2 >4 1 >3 >4 >2 2 >3 >1 >4 2 >3 >4 >1 2 >4 >3 >1 2 >4 >1 >3 3 >4 >2 >1 3 >4 >1 >2 The objective value is 2 (b) Assume we are trying to divide the jobs into two sets. Set 1 includes the jobs that will meet their due dates, and Set 2 includes the jobs that will not meet their due dates. First arrange all the jobs in increasing order of their due dates, in our case {1 >2 >3 >4}. Scan jobs from the one with the
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

HW1+Solution - IOE543Winter2010 Homework1Solution...

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