Final Exam lecture Notes

Final Exam lecture Notes - ISE-410 Final Exam: Lecture...

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

View Full Document Right Arrow Icon
ISE-410 Final Exam: Lecture Notes Scheduling : assignment of each operation of each job a release time and a completion time Flow Shop Scheduling : all jobs follow the same sequence o Assembly, repetitive o Theoretical best is prevented by downtime Starvation Blocking o Add buffers/queues to decouple the stages of the flow shop Question is: how much and where do you add it? Job Shop Scheduling : o CNC, automated Important Factors : o Make span: max completion time o Cycle time: flow time o Utilization: useful only if you’re doing it on a bottleneck machine o Meet due dates Is minimizing average lateness = minimizing average tardiness? o NO : negative lateness improves the objective , does nothing for tardiness Minimizing F avg C avg W avg L avg indirectly minimizes WIP o All equivalent objectives EDD : earliest due date o Minimize max L i (lateness) SPT : shortest processing time o Minimize L avg (average lateness) Moore’s Algorithm
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 12/24/2007 for the course ISE 410 taught by Professor Dessouky during the Fall '07 term at USC.

Page1 / 3

Final Exam lecture Notes - ISE-410 Final Exam: Lecture...

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