Final Exam textbook Notes

Final Exam textbook Notes - ISE-410 Final Exam: Textbook...

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

View Full Document Right Arrow Icon
ISE-410 Final Exam: Textbook Notes Chapter 8 Jobs : activities to be done Single-machine problems Only one machine All jobs must be processed on it Machine can process at most one job at any time Once a job has been processed by the machine, it is completed Minimizing Flowtime : SPT (shortest processing time) o Place the jobs in order of non-decreasing processing times Last job = largest o Break ties arbitrarily o Also minimizes total lateness o Does not consider due dates Minimizing max Tardiness : EDD (earliest due date) o Place the jobs in order of due dates Shortest due date first, longest due date last o If all jobs cannot be on time, no jobs will be very tardy, but many may be somewhat tardy Minimize # Tardy Jobs : Hodgson’s Algorithm o Same as Moore’s Algorithm; see lecture notes Parallel Machines A job can be processed on any of the machines Once the job is processed by one of the machines, it is completed Machines are identical
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 textbook Notes - ISE-410 Final Exam: Textbook...

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