MT2_543F03sol

MT2_543F03sol - IOE 543 GEZA BOTTLIK MIDTERM NO. 2 Solution...

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

View Full Document Right Arrow Icon
IOE 543 FALL 2003 GEZA BOTTLIK MIDTERM NO. 2 Solution Problem No. 1 Creating neighborhoods for permutation schedules is quite straightforward. As I mentioned in class, creating them for general job shops requires additional definition. One method consists of making exchanges along critical paths – those, that if lengthened, would increase C max . The objective here is to minimize C max . I have created a seed schedule for the problem below. Using an adjacent pair-wise exchange method, create a neighborhood of two schedules. I have provided two empty Gantt charts for you to use. Discuss how effective your choices were. How could this approach to getting better schedules be improved? (15 points) There are many critical paths – one can exchange adjacent jobs on any machine as long as a path is maintained. One such path is shown below with an exchange. The corresponding Gantt chart is on the next page and indicates no Change in C max . Another path and exchange also does not result in any improvement. In general, this technique is not very effective, but can be improved by looking ahead or back or both an additional exchange. Page 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 M1 2 5 M2 2 3 M3 5 4 M4 7 6 1 2 1 1 1 7 7 5 4 6 4 3 3 3 2 6 6 7 TC and Processing Times Job 1 M1 3 M2 2 M3 3 M4 1 2 M1 1 M2 1 M3 2 M4 1 3 M1 2 M2 1 M3 3 M4 2 4 M2 2 M3 1 M4 3 5 M3 1 M2 2 M1 1 6 M4 1 M3 3 M2 3 M1 2 7 M4 1 M1 2 M2 2 M3 3 (1,1) (1,2) (1,3) (1,4) (7,3) (5,1) (3,1) (3,2) (3,3) (3,4) (2,4)
Background image of page 1

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

View Full DocumentRight Arrow Icon
IOE 543 FALL 2003 GEZA BOTTLIK MIDTERM NO. 2 Solution Page 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 M1 2 5 M2 2 3 M3 5 4 M4 7 6 1 2 6 4 1 7 5 6 3 6 1 7 1 7 2 4 3 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 M1 2 5 M2 2 3 M3 5 4 M4 6 7 1 2 2 4 3 6 6 1 7 3 4 1 7 5 1 7 3 6
Background image of page 2
IOE 543 FALL 2003 GEZA BOTTLIK MIDTERM NO. 2 Solution Problem No. 2 I have started an active schedule for the problem below. Complete the schedule using a probabilistic selection method with the following weights; EDD 60%, SPT 20% and LWKR 20%. Show your work. What are your values for C max , Fbar and Tbar? (20 points) (Assume that I have not made any mistakes) The problem does not specifically ask you to use an active schedule for the remainder, although I did that way and so did most of you. Those who did not used a randomized selection method based on the given percentages at each step. Most of the time this resulted in a worse schedule than the active one. My example is given below, and my active schedule is on the next page. The Gantt chart and results
Background image of page 3

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

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

This note was uploaded on 10/08/2010 for the course ISE 514 taught by Professor Bottlik during the Fall '08 term at USC.

Page1 / 9

MT2_543F03sol - IOE 543 GEZA BOTTLIK MIDTERM NO. 2 Solution...

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

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