Lecture 13 - Production Activity Control. The contents of this chapter include all of the following: Production activity control, gantt chart, critical ratio scheduling, finite loading, scheduling, assignment method.
Trang 1Production Activity Control
Books
• Introduction to Materials Management, Sixth Edition, J. R. Tony Arnold, P.E., CFPIM, CIRM, Fleming College, Emeritus, Stephen N. Chapman, Ph.D., CFPIM, North Carolina State University, Lloyd M. Clive, P.E., CFPIM, Fleming College
• Operations Management for Competitive Advantage, 11th Edition, by Chase, Jacobs, and Aquilano, 2005, N.Y.: McGrawHill/Irwin.
• Operations Management, 11/E, Jay Heizer, Texas Lutheran University, Barry Render, Graduate School of Business, Rollins College, Prentice Hall
Trang 4Production Activity Control in the MPC System
Trang 5Basic Data
Trang 6Routing Data and Operation Setback Chart
Trang 7The incoming orders at Tom's Sailboard follow different routes through the shop but all orders must stop at each of the three work centers in the plant. The table below shows all tasks for four jobs that arrive over 5 days and need to be scheduled at the company.
Trang 8a. Construct a Gantt chart depicting the processing and idle times for the three
work centers for these four jobs
Arrival Job/WC Processing time (days) Order date routing WC 1 WC 2 WC 3
Trang 9b. How many days does each job wait in queue for processing at work center 2?
The determination of how long jobs wait at work center 2 is as follows: B and G are processed immediately at work center 2, order K must wait 1 day (11/14) and order H waits 4 days (11/12, 11/13 at WC3) and (11/16 and 11/17 at WC2)
Trang 112 The jobs below are waiting to be processed at the P&W Grinder at the Knox Machine Company. (There are no other jobs and the machine is empty.)
Trang 12a. The production manager has heard about three dispatching rules: the
Shortest Operation Next Rule, the FirstCome/FirstServed Rule, and the Earliest Due Date Rule. In what sequence would these jobs be processed
at the P&W grinder if each rule was applied?
1. The shortest operation next rule: BDAC
2. The firstcome, firstserved rule: DABC
3. The earliest due date rule: CADB
Machine processing Date job arrived Job due
Job time (in days)* at this machine date
Trang 13b. If it's now the morning of July 10 and the Shortest
Operation Next Rule is used, when would each of the four jobs start and be completed on the P&W grinder? (Express your schedule in terms of the
calendar dates involved, assuming that there are 7 working days each week.)
P & W Grinder
Trang 14Eight weeks remain for constructing the a 50foot yacht. Assume that each week consists of 5 work days, for a total lead time of 40 days. The work required to complete the yacht comprises 10 operations, 4 days for each.
Trang 15a. On Tuesday morning of week 3, 3 of the 10
operations had been completed and the yacht was waiting for the fourth operation. What's the critical ratio priority?
04
1 28
11
40 Remaining
Work
Remaining
Time Ratio
Critical
Trang 1640 Remaining
Work
Remaining
Time Ratio
Critical
Trang 17Finite Loading
Trang 18The Bundy Company produces for three
products (A, K, and P). Each order goes through the same three machine centers, but not
Trang 19Processing time Machine at machine center
Order routing1 2 3 due date
Trang 20Using the horizontal loading procedure with earliest
duedate priority sequencing rule, prepare a Gantt chart showing the production schedule for the three orders above.
K-3 P-3
Trang 21Using the vertical loading procedure and the shortest operationnext priority sequencing rule, prepare a Gantt chart showing the production schedule for the three
Trang 22Process Design Impact Scheduling
Trang 23Scheduling
Trang 24needed to produce a product or provide a service
Trang 26• Minimize idle time
• Minimize workinprocess inventory
Trang 29solution has been found. Make assignments where zeros appear
‾ Else modify matrix:
‾ subtract minimum uncrossed value from all uncrossed values
‾ add it to all cells where two lines intersect
‾ other values in matrix remain unchanged
5. Repeat steps 3 and 4 until optimum solution is reached
Trang 32Solution goes hereOnly 1 leader can
be assigned to each project
Click “Solve” for solution
Sum of all rows and columns = 1
Trang 33Assignments indicated by 1
Cost of solution
Trang 34End of Lecture 13