Short-Term Scheduling



Similar documents
Operations Management

Factors to Describe Job Shop Scheduling Problem

1 st year / / Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir. Chapter Three

An investigation into production scheduling systems

This supplement focuses on operations

Operations Management OPM-301-TE

BILL OF RESOURCES AND PRIORITY-CAPACITY BALANCING

Automated Scheduling Methods. Advanced Planning and Scheduling Techniques

Integrated support system for planning and scheduling /4/24 page 75 #101. Chapter 5 Sequencing and assignment Strategies

OPERATING SYSTEMS SCHEDULING

An Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem

Outline PRODUCTION/OPERATIONS MANAGEMENT P/OM. Production and Operations. Production Manager s Job. Objective of P/OM

Scheduling Algorithms for Dynamic Workload

Sequencing in Process Manufacturing The Product Wheel Approach

Fundamentals of Materials and Operations Management

Production Management

How Constraint Management fits the Operations Management Philosophy

Material Requirements Planning (MRP)

ALGORITHMS FOR SEQUENCING AND SCHEDULING IBRAHIM M. ALHARKAN

NEW MODELS FOR PRODUCTION SIMULATION AND VALIDATION USING ARENA SOFTWARE

Supply Chain Management (3rd Edition)

Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi

I/O Management. General Computer Architecture. Goals for I/O. Levels of I/O. Naming. I/O Management. COMP755 Advanced Operating Systems 1

Glossary of Inventory Management Terms

Manufacturing Efficiency Guide

PROJECT EVALUATION REVIEW TECHNIQUE (PERT) AND CRITICAL PATH METHOD (CPM)

Scheduling of a computer integrated manufacturing system: A simulation study

CPU Scheduling. Basic Concepts. Basic Concepts (2) Basic Concepts Scheduling Criteria Scheduling Algorithms Batch systems Interactive systems

Production Planning Solution Techniques Part 1 MRP, MRP-II

Scheduling Single Machine Scheduling. Tim Nieberg

COMPARISON OF DISPATCHING RULES IN JOB-SHOP SCHEDULING PROBLEM USING SIMULATION: A CASE STUDY

SIMULATION BASED APPROACH TO STUDY THE INTERACTION OF SCHEDULING AND ROUTING ON A LOGISTIC NETWORK

8 given situation. 5. Students will discuss performance management and determine appropriate performance measures for an

CISCM STUDY GUIDE. International Purchasing and Supply Chain Management Institute,

Resource grouping selection to minimize the maximum over capacity planning

CRITICAL CHAIN AND CRITICAL PATH, CAN THEY COEXIST?

Objectives. Chapter 5: CPU Scheduling. CPU Scheduler. Non-preemptive and preemptive. Dispatcher. Alternating Sequence of CPU And I/O Bursts

7. Service Systems [3] -- Demand/Capacity Management Models

Chapter 6. An advantage of the periodic method is that it is a easy system to maintain.

CHAPTER 6 AGGREGATE PLANNING AND INVENTORY MANAGEMENT 명지대학교 산업시스템공학부

MOS 3330 Test 2 Review Problems & Solutions

MASTER PRODUCTION SCHEDULE

Scheduling. Scheduling. Scheduling levels. Decision to switch the running process can take place under the following circumstances:

LOGISTICS & SUPPLY CHAIN MANAGEMENT

Production Management I. Operations Control

Manufacturing Planning and Control

1.3 ERP System Evolution

A Review on Load Balancing In Cloud Computing 1

Strategic Framework to Analyze Supply Chains

Logistics Management SC Performance, SC Drivers and Metrics. Özgür Kabak, Ph.D.

Home Phone Call Forward Guide

A Diagnostic Approach to Scheduling

CPU Scheduling. CPU Scheduling

CHAPTER 3 LONG-TERM FINANCIAL PLANNING AND GROWTH

Announcements. Basic Concepts. Histogram of Typical CPU- Burst Times. Dispatcher. CPU Scheduler. Burst Cycle. Reading

B2B Sales Benchmarks. Compare Yourself to your Peers & Discover the Best Tactics and Channels that Drive Revenue

Materials Management Terms in SAP

Simulation of a Claims Call Center: A Success and a Failure

Classification - Examples

Small Lot Production. Chapter 5

Lean Healthcare Metrics Guide

Material Requirements Planning (MRP)

/ Operating Systems I. Process Scheduling. Warren R. Carithers Rob Duncan

Operational Research. Project Menagement Method by CPM/ PERT

PART AND TOOL FLOW MANAGEMENT IN MULTI-CELL FLEXIBLE MANUFACTURING SYSTEM

TU-E2020 ADVANCED OPERATIONS MANAGEMENT. Demand management Sales & Operations Planning Master Production Scheduling

Return on Equity has three ratio components. The three ratios that make up Return on Equity are:

Supply Chain Management Newsletter

Universidad del Turabo MANA 705 DL Workshop Eight W8_8_3 Aggregate Planning, Material Requirement Planning, and Capacity Planning

CS Fall 2008 Homework 2 Solution Due September 23, 11:59PM

JD Edwards EnterpriseOne One View Reporting Functional Content Overview

CPU Scheduling Outline

A STUDY OF A HEURISTIC CAPACITY PLANNING ALGORITHM FOR WEAPON PRODUCTION SYSTEM

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi

We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: b + 90c = c + 10b

Visual Planning and Scheduling Systems. A White Paper. Gregory Quinn President Quinn & Associates Inc September 2006 Updated October 2006

OR topics in MRP-II. Mads Jepsens. OR topics in MRP-II p.1/25

Multiple-objective Scheduling for the Hierarchical Control of Flexible Manufacturing Cells

PARADIGMS THAT DRIVE COSTS IN MANUFACTURING. The whole purpose of a business enterprise is pretty simple to make a profit by selling

Realizing the Benefits of Finite Capacity Scheduling to Manage Batch Production Systems

Streamlining Your Manufacturing Supply Chain Using 5 Key Principles & Lean Tools

OVERHEAD, GENERAL, AND ADMINISTRATIVE COSTS

SUPPLY CHAIN (SC) DRIVERS AND OBSTACLES

MIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines

Critical Path Analysis & PERT Charts (taken from

ONLINE SUPPLEMENTAL BAPPENDIX PROJECT SCHEDULES WITH PERT/CPM CHARTS

2. is the number of processes that are completed per time unit. A) CPU utilization B) Response time C) Turnaround time D) Throughput

Material Requirements Planning. Lecturer: Stanley B. Gershwin

Chapter 18 Working Capital Management

SIMULATION ANALYSIS FOR ERP CONDUCTED IN JAPANESE SMES USING THE CONCEPT OF MFCA. Xuzhong Tang Soemon Takakuwa

Advanced GMAT Math Questions

CHAPTER 1. Basic Concepts on Planning and Scheduling

Transcription:

Strategic Implications of By scheduling effectively, companies use assets more effectively and create greater capacity per dollar invested, which, in turn, lowers cost This added capacity and related flexibility provides faster delivery and therefore better customer service Good scheduling is a competitive advantage which contributes to dependable delivery Forward Backward B E B E Today Due Date Today Due Date 1

Forward and Backward Forward scheduling: begins the schedule as soon as the requirements are known jobs performed to customer order schedule can be accomplished even if due date is missed often causes build-up of WIP Backward scheduling: begins with the due date of the final operation; schedules jobs in reverse order used in many manufacturing environments, catering, scheduling surgery The Goals of Minimize completion time Maximize utilization (make effective use of personnel and equipment) Minimize WIP inventory (keep inventory levels low) Minimize customer wait time 2

Capacity Planning 1. Facility size 2. Equipment procurement Long-term Aggregate 1. Facility utilization 2. Personnel needs 3. Subcontracting Intermediate-term Master Schedule 1. MRP 2. Disaggregation of master plan Short-term 1. Work center loading 2. Job sequencing Intermediate-term Short-term 3

Specifies the order in which jobs should be performed at work centers Priority rules are used to dispatch or sequence jobs FCFS: First come, first served SPT: Shortest processing time EDD: Earliest due date LPT: Longest processing time Priority Rules for Dispatching Jobs First come, first served The first job to arrive at a work center is processed first Earliest due date The job with the earliest due date is processed first Shortest processing time The job with the shortest processing time is processed first Longest processing time The job with the longest processing time is processed first Critical ratio The ratio of time remaining to required work time remaining is calculated, and jobs are scheduled in order of increasing ratio. 4

First Come, First Served Rule Process first job to arrive at a work center first Average performance on most scheduling criteria Appears fair & reasonable to customers Important for service organizations (: Restaurants) Earliest Due Date Rule Process job with earliest due date first Widely used by many companies If due dates important If MRP used (Due dates updated by each MRP run) Performs poorly on many scheduling criteria 5

Critical Ratio (CR) Ratio of time remaining to work time remaining Process job with smallest CR first Performs well on average lateness CR = = Time remaining Work days remaining Due date - Today' s date Work (lead) time remaining 6

Flow times Average completion time = # Jobs Process time Utilization = Flow time Average number of jobs in system Average job lateness = Flow time = Processing time Late times Number of Jobs 7

Apply the four popular sequencing rules to these five jobs Job Job Work (Processing) Time (Days) Job Due Date (Days) A 6 8 B 2 6 C 8 18 D 3 15 E 9 23 8

FCFS: Sequence A-B-C-D-E Job Sequence Job Work (Processing) Time Flow Time Job Due Date Job Lateness A 6 6 8 0 B 2 8 6 2 C 8 16 18 0 D 3 19 15 4 E 9 28 23 5 28 77 11 9

FCFS: Sequence A-B-C-D-E Average completion time = Number of jobs = 77/5 = 15.4 days Total job work time Utilization = = 28/77 = 36.4% Average number of jobs in the system = = 77/28 = 2.75 jobs Total job work time Average job lateness = Total late days Number of jobs = 11/5 = 2.2 days 10

SPT: Sequence B-D-A-C-E Job Sequence Job Work (Processing) Time Flow Time Job Due Date Job Lateness B 2 2 6 0 D 3 5 15 0 A 6 11 8 3 C 8 19 18 1 E 9 28 23 5 28 65 9 11

SPT: Sequence B-D-A-C-E Average completion time = Number of jobs = 65/5 = 13 days Total job work time Utilization = = 28/65 = 43.1% Average number of jobs in the system = = 65/28 = 2.32 jobs Total job work time Average job lateness = Total late days Number of jobs = 9/5 = 1.8 days 12

EDD: Sequence B-A-D-C-E Job Sequence Job Work (Processing) Time Flow Time Job Due Date Job Lateness B 2 2 6 0 A 6 8 8 0 D 3 11 15 0 C 8 19 18 1 E 9 28 23 5 28 68 6 13

EDD: Sequence B-A-D-C-E Average completion time = Number of jobs = 68/5 = 13.6 days Total job work time Utilization = = 28/68 = 41.2% Average number of jobs in the system = = 68/28 = 2.43 jobs Total job work time Average job lateness = Total late days Number of jobs = 6/5 = 1.2 days 14

LPT: Sequence E-C-A-D-B Job Sequence Job Work (Processing) Time Flow Time Job Due Date Job Lateness E 9 9 23 0 C 8 17 18 0 A 6 23 8 15 D 3 26 15 11 B 2 28 6 22 28 103 48 15

LPT: Sequence E-C-A-D-B Average completion time = Number of jobs = 103/5 = 20.6 days Total job work time Utilization = = 28/103 = 27.2% Average number of jobs in the system = = 103/28 = 3.68 jobs Total job work time Average job lateness = Total late days Number of jobs = 48/5 = 9.6 days 16

Summary of Rules Rule Average Completion Time (Days) Utilization (%) Average Number of Jobs in System Average Lateness (Days) FCFS 15.4 36.4 2.75 2.2 SPT 13.0 43.1 2.32 1.8 EDD 13.6 41.2 2.43 1.2 LPT 20.6 27.2 3.68 9.6 17

Comparison of Rules No one sequencing rule excels on all criteria SPT does well on minimizing flow time and number of jobs in the system But SPT moves long jobs to the end which may result in dissatisfied customers FCFS does not do especially well (or poorly) on any criteria but is perceived as fair by customers EDD minimizes lateness. 18