0% found this document useful (0 votes)
12 views16 pages

Work Center Scheduling Techniques

Uploaded by

210100094
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views16 pages

Work Center Scheduling Techniques

Uploaded by

210100094
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

WORK CENTER SCHEDULING

McGraw-Hill/Irwin
Objectives of Work-Center Scheduling
1. Meet due dates
2. Minimize lead time
3. Minimize setup time or cost
4. Minimize work-in-process inventory
5. Maximize machine utilization

• It is unlikely, and often undesirable, to simultaneously


satisfy all of these objectives
Job Sequencing
• Sequencing: the process of determining the job order on
machines or work centers
• Also known as priority sequencing
• Priority rules: the rules used in obtaining a job sequence
• Can be simple or complex
• Can use one or more pieces of information
• Common rules shown on next slide
Priority Rules for Job Sequencing
• FCFS (First come, First served): Jobs are processed in
the order they arrive at the department.
• SOT (Shortest Operating Time): Jobs are processed in
increasing order of their processing time.
• EDD (Earliest Due Date First): Process the jobs with
earliest due date first.
• STR (Slack Time Remaining): Process the jobs in
increasing order slack time, where
slack time = due date – processing time.
• Random Order: Process the orders on whim or
convenience.
Standard Measures of Schedule Performance
1. Meeting due dates
2. Minimizing the flow time
3. Minimizing work-in-process inventory
4. Minimizing idle time
Example 1: n Jobs on One Machine
Example 1: FCFS Rule
Example 1: SOT Rule
Example 1: EDD
Example 1: LCFS Schedule
Example 1: Random Schedule
Example 1: STR Rule STR = Due date -
Processing time
Comparison of Priority Rules
Scheduling n Jobs on Two Machines
• Two or more jobs must be processed on two machines in
a common sequence
• Wish to minimize the flow time from the beginning of the
first job to the finish of the last job
• Use Johnson’s rule
1. List the operation time for each job
2. Select the shortest operation time
3. If the shortest time is on the first machine, do first
• If the shortest time is on the second machine, do the job last
• For ties, do first
4. Repeat steps 2-3 for each remaining job
Example 22.2: n Jobs on Two Machines
Calculate total elapsed time and idle time for each
machine

A B C D E F
M1 2 5 4 3 2 1
M2 6 8 1 2 3 5

Total elapsed time -26

22-16

You might also like