Ch 15 Short-Term Scheduling Lecture Notes 2009

# Ch 15 Short-Term Scheduling Lecture Notes 2009 - Chapter 15...

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

Chapter 15: Short-Term Scheduling Three Main Methods (A) Assignment Method 1. Create zero opportunity costs by repeatedly subtracting the lowest costs from each row and column 2. Draw the minimum number of vertical and horizontal lines necessary to cover all the zeros in the table. If the number of lines equals either the number of rows or the number of columns, proceed to step 4. Otherwise proceed to step 3. 3. Subtract the smallest number not covered by a line from all other uncovered numbers. Add the same number to any number at the intersection of two lines. Return to step 2. 4. Optimal assignments are at zero locations in the table. Select one, draw lines through the row and column involved, and continue to the next assignment. (B) Johnson’s Rule 1. List all jobs and times for each work center 2. Choose the job with the shortest activity time. If that time is in the first work center, schedule the job first. If it is in the second work center, schedule the job last. 3. Once a job is scheduled, it is eliminated from the list 4. Repeat steps 2 and 3 working toward the center of the sequence (C) Scheduling Service Employees With Cyclical Scheduling 1. Determine the staffing requirements 2. Identify two consecutive days with the lowest total requirements and assign

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 7

Ch 15 Short-Term Scheduling Lecture Notes 2009 - Chapter 15...

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

View Full Document
Ask a homework question - tutors are online