Operations Management

Slides:



Advertisements
Similar presentations
Operations Scheduling
Advertisements

Operations Management
Chapter 17 Scheduling.
Scheduling.
Scheduling for Low-volume Operations Chapter 15 Operations Management by R. Dan Reid & Nada R. Sanders 2nd Edition © Wiley 2005 PowerPoint Presentation.
© The McGraw-Hill Companies, Inc., 1998 Irwin/McGraw-Hill Module 11 Operations Scheduling Chapter 16 (pp ) Work Center and definitions  Objectives.
Operations Management For Competitive Advantage 1 Operations Scheduling Operations Management For Competitive Advantage Chapter 15.
Scheduling.
© The McGraw-Hill Companies, Inc., Chapter 16 Operations Scheduling.
© 2000 by Prentice-Hall Inc Russell/Taylor Oper Mgt 3/e Chapter 16 Scheduling.
Operations Scheduling
Chapter 17 Scheduling Brian – THE JEANS SUPPLY CHAIN IMAGE GOES HERE
Operations Scheduling
DOM 102: Principles of Operations Management Operations Scheduling
Scheduling Chapter 19.
Short Term Scheduling Introduction What – Scheduling or timing of operations Where – Timing of operations affects the overall strategy Why – Reduce costs,
Short-Term Scheduling
Operations Management
Inputs and Outputs to Aggregate Production Planning
Scheduling Operations Management - 5 th Edition Chapter 16 Roberta Russell & Bernard W. Taylor, III.
Operations Management R. Dan Reid & Nada R. Sanders
Scheduling.
1 ISQA 459/559 Mellie Pullman Scheduling Shop Floor.
1 Chapter 15 Scheduling. 2 Scheduling: Establishing the timing of the use of equipment, facilities and human activities in an organization Answering “when”
Scheduling – Day 2. Production Planning Process Process Planning Strategic Capacity Planning Aggregate Planning Master Production Scheduling Material.
CHAPTER 19 Scheduling Operations Management, Eighth Edition, by William J. Stevenson Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 16: Learning Objectives
Operations Scheduling. Scheduling in a Process-Focused Environment.
Operations Management Contemporary Concepts and Cases Chapter Thirteen Scheduling Operations Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights.
Industrial Systems Engineering Dept. İzmir University of Economics
Copyright 2009, John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Scheduling Operations Management - 5 th Edition Chapter 17.
Scheduling.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 13 Scheduling To Accompany.
15-1Scheduling William J. Stevenson Operations Management 8 th edition.
15-1Scheduling William J. Stevenson Operations Management 8 th edition.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
1 1 Slide Short – Term Scheduling Professor Ahmadi.
Scheduling Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Scheduling Process and Production Management.
Topics To Be Covered 1. Tasks of a Shop Control Manager.
Operations Management Operations Scheduling
1 Slides used in class may be different from slides in student pack Chapter 19 Operations Scheduling  Work Center Defined  Typical Scheduling and Control.
Chapter 15 – Scheduling Operations Management by R. Dan Reid & Nada R. Sanders 2nd Edition © Wiley 2005 PowerPoint Presentation by R.B. Clough - UNH.
Scheduling for Low-volume Operations Chapter 15 Operations Management by R. Dan Reid & Nada R. Sanders 2nd Edition © Wiley 2005 PowerPoint Presentation.
Chapter 17 Scheduling. Management 3620Chapter 17 Schedule17-2 Overview of Production Planning Hierarchy Capacity Planning 1. Facility size 2. Equipment.
1 Manufacturing Operations Scheduling B2 [ ] B2 [ ] E5 [ E5 [ P9 [---] P9 [---] D1 [ D1 [
Scheduling. Definition of scheduling Establishing the timing of the use of equipment, facilities and human activities in an organization In the decision-making.
Scheduling. Scheduling: The allocation of resources over time to accomplish specific tasks. Demand scheduling: A type of scheduling whereby customers.
Scheduling for Low-volume Operations
© Wiley 2007 Chapter 15 – Scheduling Operations Management by R. Dan Reid & Nada R. Sanders 3rd Edition © Wiley 2005 PowerPoint Presentation by R.B. Clough.
CHAPTER SEVENTEEN SCHEDULING Chapter 17 Scheduling.
CHAPTER 4 : SCHEDULING Presented by: HAMKA BIN TAIP
Scheduling Operations IDS 605 Spring Data Collection for Scheduling l Jobs l Activities l Employees l Equipment l Facilities Transparency 18.1.
Chapter 16 & 9 Scheduling Work & Employees. Scheduling Outline What needs to be scheduled? –doctor’s office, restaurant, mfg. plant, hospital –employees.
© The McGraw-Hill Companies, Inc., Chapter 16 Operations Scheduling.
Copyright 2009 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Scheduling Operations Management - 6 th Edition Chapter 17 Roberta.
Activity Scheduling and Control
Scheduling McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Scheduling.
16 Scheduling (focus on sequencing; FCFS, SPT, EDD pages , and Johnson’s rule pages ) Homework; 6, 7, 11.
Lecture 14 Production Activity Control (Continued) Books Introduction to Materials Management, Sixth Edition, J. R. Tony Arnold, P.E., CFPIM, CIRM, Fleming.
Scheduling Operations
assemble-to-order (ATO) A system that produces standard modules to be
Chap 11 Learning Objectives
8 Job Sequencing & Operations Scheduling CHAPTER Arranged by
Operations Management
Inputs and Outputs to Aggregate Production Planning
Presentation transcript:

Operations Management Chapter 15 – Scheduling Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010 © Wiley 2010

Learning Objectives Explain the different kinds of scheduling operations Describe different shop loading methods Develop a schedule using priority rules Calculate scheduling for multiple workstations Develop a schedule performance measures Describe the theory of constraints Describe scheduling techniques for service applications Develop a workforce schedule in which each employee has two consecutive days off © Wiley 2010

Scheduling Operations Companies differentiate based on product volume and product variety Differentiation affects how the company organizes its operations Each kind of company operation needs different scheduling techniques Scheduling has specific definitions for routing, bottleneck, due date, slack and queue © Wiley 2010

Scheduling Definitions Routing: The operations to be performed, their sequence, the work centers, & the time standards Bottleneck: A resource whose capacity is less than the demand placed on it Due date: When the job is supposed to be finished Slack: The time that a job can be delayed & still finish by its due date Queue: A waiting line © Wiley 2010

Characteristics of High-Volume Operations High-volume aka flow operations, like automobiles, bread, gasoline can be repetitive or continuous High-volume standard items; discrete or continuous with smaller profit margins Designed for high efficiency and high utilization High volume flow operations with fixed routings Bottlenecks are easily identified Commonly use line-balancing to design the process around the required tasks © Wiley 2010

Low-Volume Operations Low-volume, job shop operations, are designed for flexibility. Use more general purpose equipment Customized products with higher margins Each product or service may have its own routing (scheduling is much more difficult) Bottlenecks move around depending upon the products being produced at any given time © Wiley 2010

Gantt Charts - Low-Volume Tool Developed in the early 1900’s by Henry Gantt Load charts illustrate the workload relative to the capacity of a resource Shows today’s job schedule by employee © Wiley 2010

Gantt Chart con’t Progress charts: Illustrate the planned schedule compared to actual performance Brackets show when activity is scheduled to be finished. Note: design & pilot run both finish late; feedback has not started yet. © Wiley 2010

Scheduling Work - Work Loading Infinite loading: Ignores capacity constraints, but helps identify bottlenecks in a proposed schedule to enable proactive management Finite loading: Allows only as much work to be assigned as can be done with available capacity – but doesn’t prepare for inevitable slippage © Wiley 2010

Other Scheduling Techniques Forward Scheduling – starts processing when a job is received Backward Scheduling – begin scheduling the job’s last activity so that the job is finished on due date © Wiley 2010

Monitoring Workflow Input/Output Control I/O control is a capacity-control technique used to monitor work flow at individual work centers Monitors how well available capacity is used and provides insight into process problems © Wiley 2010

How to Sequence Jobs Which of several jobs should be scheduled first? Techniques are available to do short-term planning of jobs based on available capacity & priorities Priority rules: Decision rules to allocate the relative priority of jobs at a work center Local priority rules: determines priority based only on jobs at that workstation Global priority rules: also considers the remaining workstations a job must pass through © Wiley 2010

Commonly Used Priorities Rules First come, first served (FCFS) Last come, first served (LCFS) Earliest due date (EDD) Shortest processing time (SPT) Longest processing time (LPT) Critical ratio (CR): (Time until due date)/(processing time) Slack per remaining Operations (S/RO) Slack /(number of remaining operations) © Wiley 2010

Measuring Performance Job flow time: Time a job is completed minus the time the job was first available for processing; avg. flow time measures responsiveness Average # jobs in system: Measures amount of work-in-progress; avg. # measures responsiveness and work-in-process inventory Makespan: The time it takes to finish a batch of jobs; measure of efficiency Job lateness: Whether the job is completed ahead of, on, or behind schedule; Job tardiness: How long after the due date a job was completed, measures due date performance © Wiley 2010

Scheduling Performance Calculations Job A finishes on day 10 Job B finishes on day 13 Job C finishes on day 17 Job D ends on day 20 Calculation mean flow time: MFT= (sum job flow times)/ # of jobs = (10+13+17+20)/4 = 60/4 = 15 days Calculating average number of jobs in the system: Average # Jobs =(sum job flow times)/ # days to complete batch = (60)/20 = 3 job Makespan is the length of time to complete a batch Makespan = Completion time for Job D minus start time for Job A = 20 – 0 = 20 days © Wiley 2010

Simple Sequencing Rules PROCESSING DUE JOB TIME DATE A 5 10 B 10 15 C 2 5 D 8 12 E 6 8

Simple Sequencing Rules: FCFS A 0 5 5 10 0 B 5 10 15 15 0 C 15 2 17 5 12 D 17 8 25 12 13 E 25 6 31 8 23 FCFS START PROCESSING COMPLETION DUE SEQUENCE TIME TIME TIME DATE TARDINESS

Simple Sequencing Rules: DDATE B 21 10 31 15 16 DDATE START PROCESSING COMPLETION DUE SEQUENCE TIME TIME TIME DATE TARDINESS

Simple Sequencing Rules: SLACK B (15-0) - 10 = 5 C (5-0) – 2 = 3 D (12-0) – 8 = 4 E (8-0) – 6 = 2 Simple Sequencing Rules: SLACK E 0 6 6 8 0 C 6 2 8 5 3 D 8 8 16 12 4 A 16 5 21 10 11 B 21 10 31 15 16 SLACK START PROCESSING COMPLETION DUE SEQUENCE TIME TIME TIME DATE TARDINESS

Simple Sequencing Rules: CR A (10)/5 = 2.00 B (15)/10 = 1.50 C (5)/2 = 2.50 D (12)/8 = 1.50 E (8)/6 = 1.33 Simple Sequencing Rules: CR E 0 6 6 8 0 D 6 8 14 12 2 B 14 10 24 15 9 A 24 5 29 10 19 C 29 2 31 5 26 CR START PROCESSING COMPLETION DUE SEQUENCE TIME TIME TIME DATE TARDINESS

Simple Sequencing Rules: SPT A 2 5 7 10 0 E 7 6 13 8 5 D 13 8 21 12 9 B 21 10 31 15 16 SPT START PROCESSING COMPLETION DUE SEQUENCE TIME TIME TIME DATE TARDINESS

Simple Sequencing Rules: Summary FCFS 18.60 9.6 3 23 DDATE 15.00 5.6 3 16 SLACK 16.40 6.8 4 16 CR 20.80 11.2 4 26 SPT 14.80 6.0 3 16 AVERAGE AVERAGE NO. OF MAXIMUM RULE COMPLETION TIME TARDINESS JOBS TARDY TARDINESS

Sequencing Jobs through Two Work Centers –Johnson’s Rule Johnson’s Rule – a technique for minimizing makespan in a two-stage, unidirectional process Step 1 – List the jobs and the processing time for each activity Step 2 – Find the shortest activity processing time among the jobs not yet scheduled If the shortest Processing time is for a 1st activity, schedule that job in the earliest available position in the job sequence If the shortest processing time is for 2nd activity, schedule that job in the last available position in the job sequence When you schedule a job eliminate it from further consideration Step 3 – Repeat step 2 until you have put all activities for the job in the schedule © Wiley 2010

Johnson’s Rule Example: Vicki’s Office Cleaners does the annual major cleaning of university buildings. The job requires mopping (1st activity) and waxing (2nd activity) of each building. Vicki wants to minimize the time it takes her crews to finish cleaning (minimize makespan) the five buildings. She needs to finish in 20 days. © Wiley 2010

Scheduling Bottlenecks In the 1970’s Eli Goldratt introduced optimized production technology (OPT) OPT focused on bottlenecks for scheduling & capacity planning Definitions: Throughput: quantity of finished goods that can be sold Transfer batch: quantity of items moved at the same time from one resource to the next Process batch: quantity produced at a resource before switching to another product © Wiley 2010

OPT Principles Balance the process rather than the flow Non-bottleneck usage is driven by some other constraint in the system Usage and activation of a resource are not the same A hour lost at a bottleneck is lost forever, but an hour lost at a non-bottleneck is a mirage © Wiley 2010

OPT Principles – con’t Bottleneck determine throughput and inventory in system The transfer batch does not need to be equal to the process batch The process batch should be variable Consider all constraints simultaneously. Lead times are the result of the schedule and are not predetermined. © Wiley 2010

Theory of Constraints TOC is an extension of OPT – theory is that a system’s output is determined by its constraints Identify the bottleneck(s) in the process Exploit (fully utilize) the bottleneck(s) Subordinate all other decisions to Step 2 - Schedule non-bottlenecks to support maximum use of bottleneck activities Elevate the Bottleneck(s) Do not let inertia set in © Wiley 2010

Scheduling for Service Organizations Demand management: Appointments & reservations Posted schedules Delayed services or backlogs (queues) Scheduling Employees: Staff for peak demand (if cost isn’t prohibitive) Floating employees or employees on call Temporary, seasonal, or part-time employees © Wiley 2010

Step 3 - Find the pair of days with the lowest total needed Developing a Workforce Schedule: Tibrewala, Philippe, and Brown developed a technique for scheduling a seven day operation giving each employee two consecutive days off. This example shows how a staff of six people can be scheduled. Step 1 – Find out the minimum number of employees needed for each day of the week Step 2 – Given the above requirements, calculate the number of employees needed for each pair of consecutive days Step 3 - Find the pair of days with the lowest total needed © Wiley 2010

Workforce Scheduling con’t Step 4 – Update the number of employees you still need to schedule for each day Step 5 – Using the updated staffing needs, repeat steps 2 through 4 until you have satisfied all needs © Wiley 2010

Scheduling con’t © Wiley 2010

Schedule con’t © Wiley 2010

Final Schedule This technique gives a work schedule for each employee to satisfy minimum daily staffing requirements Next step is to replace numbers with employee names Manager can give senior employees first choice and proceed until all employees have a schedule © Wiley 2010

Chapter 15 Highlights Scheduling in the high-volume environment is typically done through line design and balancing. Scheduling in a low-volume environment typically involves the use of priority rules. Shop loading techniques included infinite or finite loading. Finite loading loads jobs up to a predetermined capacity level. Loading can be done using forward or backward scheduling Priority rules are used to make scheduling decisions. SPT always minimizes mean job flow times, mean job lateness, and average number of jobs in system. Earliest due date rule minimize the maximum tardiness of the jobs. Performance measures reflect the priorities of the organization. Mean flow time, mean job lateness, mean job tardiness, makespan, and the average number of jobs in the system measure the effectiveness of schedules. Johnson’s Rule is a effective technique for minimizing makespan when two successive workstations are needed to complete the process. When scheduling bottleneck systems, the basic principles of OPT apply. TOC expands OPT into a managerial philosophy of continuous improvement. Service organizations use different techniques such as appointments, reservations, and posted schedules for effective use of service capacity. © Wiley 2010