Your SlideShare is downloading. ×
0
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Scheduling
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Scheduling

1,677

Published on

Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
1,677
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
131
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide
  • 1
  • 6
  • 10
  • 90
  • 91
  • 93
  • 97
  • 100
  • 106
  • 107
  • 107
  • 2
  • 12
  • 12
  • 34
  • 34
  • 34
  • 61
  • 88
  • Transcript

    • 1. Scheduling Chapter 16
    • 2. How Scheduling fits the Operations Management Philosophy Operations As a Competitive Weapon Operations Strategy Project Management Process Strategy Process Analysis Process Performance and Quality Constraint Management Process Layout Lean Systems Supply Chain Strategy Location Inventory Management Forecasting Sales and Operations Planning Resource Planning Scheduling
    • 3. Scheduling <ul><li>Scheduling : The allocation of resources over time to accomplish specific tasks. </li></ul><ul><li>Demand scheduling : A type of scheduling whereby customers are assigned to a definite time for order fulfillment. </li></ul><ul><li>Workforce scheduling : A type of scheduling that determines when employees work. </li></ul><ul><li>Operations scheduling : A type of scheduling in which jobs are assigned to workstations or employees are assigned to jobs for specified time periods. </li></ul>
    • 4. Performance Measures <ul><li>Job flow time : The amount of time a job spends in the service or manufacturing system. Also referred to as throughput time or time spent in the system, including service . </li></ul><ul><li>Makespan : The total amount of time required to complete a group of jobs. </li></ul><ul><li>Past due ( Tardiness ): The amount of time by which a job missed its due date or the percentage of total jobs processed over some period of time that missed their due dates. </li></ul><ul><li>Work-in-process (WIP) inventory: Any job that is waiting in line, moving from one operation to the next, being delayed, being processed, or residing in a semi-finished state. </li></ul><ul><li>Total inventory : The sum of scheduled receipts and on-hand inventories. </li></ul><ul><li>Utilization : The percentage of work time that is productively spent by an employee or machine. </li></ul>
    • 5. Gantt Charts <ul><li>Gantt chart : Used as a tool to monitor the progress of work and to view the load on workstations. </li></ul><ul><ul><li>The chart takes two basic forms: (1) the job or activity progress chart, and (2) the workstation chart. </li></ul></ul><ul><li>The Gantt progress chart graphically displays the current status of each job or activity relative to its scheduled completion date. </li></ul><ul><li>The Gantt workstation chart shows the load on the workstations and the nonproductive time. </li></ul>
    • 6. Gantt Progress Chart Gantt Progress Chart for an Auto Parts Company Plymouth Ford Pontiac Job 4/20 4/22 4/23 4/24 4/25 4/26 4/21 4/17 4/18 4/19 Current date Scheduled activity time Actual progress Start activity Finish activity Nonproductive time
    • 7. Gantt Workstation Chart Gantt Workstation Chart for Hospital Operating Rooms
    • 8. Scheduling Customer Demand <ul><li>Three methods are commonly used to schedule customer demand: </li></ul><ul><li>Appointments assign specific times for service to customers. </li></ul><ul><li>Reservations are used when the customer actually occupies or uses facilities associated with the service. </li></ul><ul><li>Backlogs: </li></ul><ul><ul><li>The customer is given a due date for the fulfillment a product order, or </li></ul></ul><ul><ul><li>Allow a backlog to develop as customers arrive at the system. Customers may never know exactly when their orders will be fulfilled </li></ul></ul>
    • 9. Scheduling Employees <ul><li>Rotating schedule : A schedule that rotates employees through a series of workdays or hours. </li></ul><ul><li>Fixed schedule : A schedule that calls for each employee to work the same days and hours each week. </li></ul><ul><li>Constraints : The technical constraints imposed on the workforce schedule are the resources provided by the staffing plan and the requirements placed on the operating system. </li></ul><ul><ul><li>Other constraints, including legal and behavioral considerations, also can be imposed. </li></ul></ul>
    • 10. The Amalgamated Parcel Service is open 7 days a week. The schedule of requirements is: The manager needs a workforce schedule that provides two consecutive days off and minimizes the amount of total slack capacity. To break ties in the selection of off days, the scheduler gives preference to Saturday and Sunday if it is one of the tied pairs. If not, she selects one of the tied pairs arbitrarily. Workforce Scheduling Example 16.1 Day M T W Th F S Su Number of employees 6 4 8 9 10 3 2 Required employees
    • 11. Required employees Workforce Scheduling Example 16.1 Steps 1 &amp; 2 Step 1 . Find all the pairs of consecutive days that exclude the maximum daily requirements. Select the unique pair that has the lowest total requirements for the 2 days. Friday contains the maximum requirements (10), and the pair S–Su has the lowest total requirements. Therefore, Employee 1 is scheduled to work Monday through Friday. Step 2 . If a tie occurs, choose one of the tied pairs or ask the employee to make a choice. Day M T W Th F S Su Number of employees 6 4 8 9 10* 3 2 Employee 1 X X X X X
    • 12. Required employees Step 3 . Subtract the requirements satisfied by the Employee 1 from the net requirements for each day the employee is to work and repeat step one. Again the pair S–Su has the lowest total requirements. Therefore, Employee 2 is scheduled to work Monday through Friday. Workforce Scheduling Example 16.1 Step 3 Day M T W Th F S Su Number of employees 6 4 8 9 10* 3 2 Employee 1 X X X X X Requirements 5 3 7 8 9* 3 2 Employee 2 X X X X X
    • 13. Required employees Workforce Scheduling Example 16.1 Step 4 Step 4 . Repeat steps 1 through 3 until all the requirements have been satisfied. After Employees 1, 2, and 3 have reduced the requirements, the pair with the lowest requirements changes, and Employee 4 will be scheduled for Wednesday through Sunday. Day M T W Th F S Su Number of employees 6 4 8 9 10* 3 2 Employee 1 X X X X X Requirement 5 3 7 8 9* 3 2 Employee 2 X X X X X Requirement 4 2 6 7 8* 3 2 Employee 3 X X X X X Requirement 3 1 5 6 7* 3 2
    • 14. Workforce Scheduling Example 16.1 Step 4 continued Day M T W Th F S Su Number of employees 6 4 8 9 10* 3 2 Employee 1 X X X X X Requirement 5 3 7 8 9* 3 2 Employee 2 X X X X X Requirement 4 2 6 7 8* 3 2 Employee 3 X X X X X Requirement 3 1 5 6 7* 3 2 Employee 4 X X X X X Requirement 3 1 4 5 6* 2 1 Employee 5 X X X X X Required employees
    • 15. Workforce Scheduling Example 16.1 Step 4 continued Day M T W Th F S Su Requirement 2 0 3 4 5* 2 1 Employee 6 X X X X X Requirement 2 0 2 3 4* 1 0 Employee 7 X X X X X Requirement 1 0 1 2 3* 1 0 Employee 8 X X X X X Requirement 0 0 0 1 2* 1 0 Employee 9 X X X X X Requirement 0 0 0 0 1* 0 0 Employee 10 X X X X X Required employees
    • 16. Workforce Scheduling Example 16.1 Day M T W Th F S Su Employee 1 X X X X X off off Employee 2 X X X X X off off Employee 3 X X X X X off off Employee 4 off off X X X X X Employee 5 X X X X X off off Employee 6 off off X X X X X Employee 7 X X X X X off off Employee 8 X X X X X off off Employee 9 off X X X X X off Employee 10 X X X X X off off Final Schedule
    • 17. M T W Th F S Su Employee 1 X X X X X off off Employee 2 X X X X X off off Employee 3 X X X X X off off Employee 4 off off X X X X X Employee 5 X X X X X off off Employee 6 off off X X X X X Employee 7 X X X X X off off Employee 8 X X X X X off off Employee 9 off X X X X X off Employee 10 X X X X X off off Workforce Scheduling Example 16.1 Final Schedule Capacity, C 7 8 10 10 10 3 2 50 Requirements, R 6 4 8 9 10 3 2 42 Slack, C – R 1 4 2 1 0 0 0 8 Total Final Schedule
    • 18. Operations Scheduling <ul><li>Operations schedules are short-term plans designed to implement the master production schedule. </li></ul><ul><ul><li>Operations scheduling focuses on how best to use existing capacity. </li></ul></ul><ul><ul><li>Often, several jobs must be processed at one or more workstations. Typically, a variety of tasks can be performed at each workstation. </li></ul></ul><ul><li>Job shop : A firm that specializes in low- to medium-volume production and utilizes job or batch processes. </li></ul><ul><li>Flow shop : A firm that specializes in medium- to high-volume production and utilizes line or continuous processes. </li></ul>
    • 19. Manufacturing Process Shipping Department Raw Materials Legend: Batch of parts Workstation
    • 20. Job Shop Dispatching <ul><li>Dispatching : A method of generating schedules in job shops whereby the decision about which job to process next is made using simple priority rules whenever the workstation becomes available for further processing. </li></ul><ul><li>Priority sequencing rules : The rules that specify the job processing sequence when several jobs are waiting in line at a workstation. </li></ul><ul><li>Critical ratio (CR) : A ratio that is calculated by dividing the time remaining until a job’s due date by the total shop time remaining for the job. CR = (Due date – Today’s date)/Total shop time remaining </li></ul><ul><ul><li>Total Shop Time = Setup, processing, move, and expected waiting times of all remaining operations, including the operation being scheduled. </li></ul></ul>
    • 21. <ul><li>Earliest due date (EDD) : A priority sequencing rule that specifies that the job with the earliest due date is the next job to be processed. </li></ul><ul><li>First-come, first-served (FCFS) : A priority sequencing rule that specifies that the job arriving at the workstation first has the highest priority. </li></ul><ul><li>Shortest processing time (SPT) : A priority sequencing rule that specifies that the job requiring the shortest processing time is the next job to be processed. </li></ul>Job Shop Dispatching
    • 22. <ul><li>Slack per remaining operations (S/RO) : A priority sequencing rule that determines priority by dividing the slack by the number of operations that remain, including the one being scheduled. </li></ul>Job Shop Dispatching S/RO = ((Due date – Today’s date) – Total shop time remaining) Number of operations remaining
    • 23. <ul><li>Single-dimension rules : A set of rules such as FCFS, EDD, and SPT, that bases the priority of a job on a single aspect of the job, such as arrival time at the workstation, the due date, or the processing time. </li></ul><ul><li>Priority rules, such as CR and S/RO, incorporate information about the remaining workstations at which the job must be processed. We call these rules multiple-dimension rules . </li></ul><ul><li>Multiple-dimension rules : A set of rules that apply to more than one aspect of a job. </li></ul>Scheduling Jobs for One Workstation
    • 24. <ul><li>Five engine blocks are waiting for processing. The processing times have been estimated. Expected completion times have been agreed. The table shows the situation as of Monday morning. Customer pickup times are measured in business hours from Monday morning. </li></ul><ul><li>Determine the schedule by using the EDD rule and then the SPT rule. </li></ul><ul><li>Calculate the average hours early, hours past due, WIP inventory, and total inventory for each method. </li></ul><ul><li>If low job flow times and WIP inventories are critical, which rule should be chosen? </li></ul>Example 16.2 Single-Dimension Rule Sequencing
    • 25. Average hours early = 0.6 hour Example 16.2 Single-Dimension Rule – EDD Average job flow time = 23 hours Average hours past due = 7.2 hours Average WIP = 2.61 blocks Average total inventory = 2.68 engine blocks 8 + 14 + 17 + 32 + 44 44 Job Scheduled Actual Engine Processing Flow Customer Customer Hours Block Begin Time Time Pickup Pickup Hours Past Sequence Work (hr) (hr) Time Time Early Due Ranger 8 10 Explorer 6 12 Econoline 150 3 18 Bronco 15 20 Thunderbird 12 22 0 + = 8 10 2 17 + = 32 32 12 8 + = 14 14 2 14 + = 17 18 1 32 + = 44 44 22 Average total inventory = 10 + 14 + 18 + 32 + 44 44
    • 26. Average hours early = 3.6 hour Example 16.2 Single-Dimension Rule – SPT Average job flow time = 20.4 hours Average hours past due = 7.6 hours Average WIP = 2.32 blocks Average total inventory = 2.73 engine blocks Econoline 150 Explorer Ranger Thunderbird Bronco 0 3 9 17 29 3 6 8 12 15 18 12 10 22 20 3 + 9 + 17 + 29 + 44 44 Job Scheduled Actual Engine Processing Flow Customer Customer Hours Block Begin Time Time Pickup Pickup Hours Past Sequence Work (hr) (hr) Time Time Early Due Ranger 8 10 Explorer 6 12 Econoline 150 3 18 Bronco 15 20 Thunderbird 12 22 0 + = 3 18 15 17 + = 29 29 7 8 + = 9 12 14 + = 17 17 3 7 29 + = 44 44 24 Average total inventory = 18 + 12 + 17 + 20 + 44 44
    • 27. Comparing the EDD and SPT Rules Using the previous example, a comparison of the EDD and SPT sequencing is shown below. <ul><li>The SPT schedule has a lower average job flow time and lower WIP inventory. </li></ul><ul><li>The EDD schedule has better customer service, (average hours past due) and lower maximum hours past due. </li></ul><ul><li>EDD also has a lower total inventory because fewer hours were spent waiting for customers to pick up their engine blocks after they had been completed. </li></ul>EDD SPT Average job flow time 23.00 20.40 Average hours early 0.60 3.60 Average hours past due 7.20 7.60 Average WIP 2.61 2.32 Average total inventory 2.68 2.73
    • 28. Example 16.3 Multiple-Dimension Rule – CR 1 2.3 15 10 6.1 2.46 2 10.5 10 2 7.8 1.28 3 6.2 20 12 14.5 1.38 4 15.6 8 5 10.2 .78 Operation Time Time at Remaining Number of Engine to Due Date Operations Shop Time Job Lathe (hr) (Days) Remaining Remaining CR S/RO CR = Time remaining to due date Shop time remaining
    • 29. Example 16.3 Multiple-Dimension Rule – S/RO 1 2.3 15 10 6.1 2.46 0.89 2 10.5 10 2 7.8 1.28 1.10 3 6.2 20 12 14.5 1.38 0.46 4 15.6 8 5 10.2 .78 – 0.44 Operation Time Time at Remaining Number of Engine to Due Date Operations Shop Time Job Lathe (hr) (Days) Remaining Remaining CR S/RO S/RO = Time remaining to due date – Shop time remaining Number of operations remaining
    • 30. Comparing the CR and S/RO Rules 1 2.3 15 10 6.1 2.46 0.89 2 10.5 10 2 7.8 1.28 1.10 3 6.2 20 12 14.5 1.38 0.46 4 15.6 8 5 10.2 .78 – 0.44 Operation Time Time at Remaining Number of Engine to Due Date Operations Shop Time Job Lathe (hr) (Days) Remaining Remaining CR S/RO CR Sequence = 4 – 2 – 3 – 1 S/RO Sequence = 4 – 3 – 1 – 2 CR Sequence =
    • 31. Priority Rule Summary FCFS = 1 – 2 – 3 – 4 SPT = 1 – 3 – 2 – 4 EDD = 4 – 2 – 1 – 3 CR = 4 – 2 – 3 – 1 S/RO = 4 – 3 – 1 – 2 <ul><li>The S/RO rule is better than the EDD rule and the CR rule but it is much worse than the SPT rule and the FCFS rule for this example. </li></ul><ul><li>S/RO has the advantage of allowing schedule changes when due dates change. These results cannot be generalized to other situations because only four jobs are being processed. </li></ul>© 2007 Pearson Education Avg Flow Time 17.175 16.100 26.175 27.150 24.025 Avg Early Time 3.425 6.050 0 0 0 Avg Past Due 7.350 8.900 12.925 13.900 10.775 Avg WIP 1.986 1.861 3.026 3.129 2.777 Avg Total Inv 2.382 2.561 3.026 3.129 2.777 Shortest Slack per Processing Earliest Critical Remaining FCFS Time Due Date Ratio Operation
    • 32. Scheduling Jobs for Multiple Workstations <ul><li>Priority sequencing rules can be used to schedule more than one operation. Each operation is treated independently . </li></ul><ul><li>Identifying the best priority rule to use at a particular operation in a process is a complex problem because the output from one process becomes the input for another. </li></ul><ul><li>Computer simulation models are effective tools to determine which priority rules work best in a given situation. </li></ul><ul><li>When a workstation becomes idle, the priority rule is applied to the jobs waiting for that operation, and the job with the highest priority is selected. </li></ul><ul><li>When that operation is finished, the job is moved to the next operation in its routing, where it waits until it again has the highest priority. </li></ul>
    • 33. Johnson’s Rule <ul><li>Johnson’s rule : A procedure that minimizes makespan when scheduling a group of jobs on two workstations. </li></ul><ul><li>Step 1 . Find the shortest processing time among the jobs not yet scheduled. If two or more jobs are tied, choose one job arbitrarily. </li></ul><ul><li>Step 2 . If the shortest processing time is on workstation 1, schedule the corresponding job as early as possible. If the shortest processing time is on workstation 2, schedule the corresponding job as late as possible. </li></ul><ul><li>Step 3 . Eliminate the last job scheduled from further consideration. Repeat steps 1 and 2 until all jobs have been scheduled. </li></ul>
    • 34. Example 16.5 Johnson’s Rule at the Morris Machine Co. Sequence = M1 M2 M3 M4 M5 Eliminate M3 from consideration. The next shortest time is M2 at Workstation 1, so schedule M2 first. Eliminate M5 from consideration. The next shortest time is M1 at workstation #1, so schedule M1 next. Eliminate M1 and the only job remaining to be scheduled is M4. Time (hr) Motor Workstation 1 Workstation 2 M1 12 22 M2 4 5 M3 5 3 M4 15 16 M5 10 8 Shortest time is 3 hours at workstation 2, so schedule job M3 last. Eliminate M2 from consideration. The next shortest time is M5 at workstation #2, so schedule M5 next to last.
    • 35. The schedule minimizes the idle time of workstation 2 and gives the fastest repair time for all five motors. No other sequence will produce a lower makespan. Example 16.5 Johnson’s Rule at the Morris Machine Co. Workstation M2 (4) M1 (12) M4 (15) M5 (10) M3 (5) Idle—available for further work 0 5 10 15 20 25 30 Day 35 40 45 50 55 60 65 Idle 2 M2 (5) M1 (22) M4 (16) M5 (8) M3 (3) Idle 1 Gantt Chart for the Morris Machine Company Repair Schedule
    • 36. Labor-limited Environments <ul><li>The limiting resource thus far has been the number of machines or workstations available. A more typical constraint is the amount of labor available. </li></ul><ul><li>Labor-limited environment : An environment in which the resource constraint is the amount of labor available, not the number of machines or workstations. </li></ul><ul><li>Assign personnel to the workstation with the job that has been in the system longest. </li></ul><ul><li>Assign personnel to the workstation with the most jobs waiting for processing. </li></ul><ul><li>Assign personnel to the workstation with the largest standard work content. </li></ul><ul><li>Assign personnel to the workstation with the job that has the earliest due date. </li></ul>
    • 37. Linking Operations Scheduling to the Supply Chain <ul><li>Advanced planning and scheduling (APS) systems: Systems that seek to optimize resources across the supply chain and align daily operations with strategic goals. Four characteristics of these systems are: </li></ul><ul><li>Demand Planning . This capability enables companies in a supply chain to share demand forecasts. </li></ul><ul><li>Supply Network Planning . Optimization models based on linear programming can be used to make long-term decisions. </li></ul><ul><li>Available-to-Promise . Firms can use this capability to promise delivery to customers by checking the availability of components and materials at its suppliers. </li></ul><ul><li>Manufacturing Scheduling . This module attempts to determine an optimal grouping and sequencing of manufacturing orders based on detailed product attributes, production line capacities, and material flows. </li></ul>

    ×