Service Manager Forecasting (traffic, orders, …) Determine the Level of Service (Newsboy) Estimate Manpower Requirements Shift Scheduling (LP, IP) Assigning.

Slides:

Advertisements

Similar presentations

Operations Scheduling

Advertisements

Chapter 13 Queueing Models

Introduction to Queuing Theory

IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.

Operations Scheduling

Operations Scheduling

Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.

OPSM 405 Service Management Class 19: Managing waiting time: Queuing Theory Koç University Zeynep Aksin

Operations Management

Previously Optimization Probability Review Inventory Models Markov Decision Processes.

Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.

MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E

Waiting Lines Students should be able to:

Previously Optimization Probability Review Inventory Models Markov Decision Processes.

Chapter 9: Queuing Models

1 Chapter 15 Scheduling. 2 Scheduling: Establishing the timing of the use of equipment, facilities and human activities in an organization Answering “when”

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

1 Chapter 7 Dynamic Job Shops Advantages/Disadvantages Planning, Control and Scheduling Open Queuing Network Model.

Introduction to ModelingMonte Carlo Simulation Expensive Not always practical Time consuming Impossible for all situations Can be complex Cons Pros Experience.

Flows and Networks Plan for today (lecture 5): Last time / Questions? Waiting time simple queue Little Sojourn time tandem network Jackson network: mean.

McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.

A bit on Queueing Theory: M/M/1, M/G/1, GI/G/1 Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. (As of Dec 1: Swinburne.

D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D.

15-1Scheduling William J. Stevenson Operations Management 8 th edition.

15-1Scheduling William J. Stevenson Operations Management 8 th edition.

Introduction to Operations Research

McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.

Lecture 10: Queueing Theory. Queueing Analysis Jobs serviced by the system resources Jobs wait in a queue to use a busy server queueserver.

1 Queuing Analysis Overview What is queuing analysis? - to study how people behave in waiting in line so that we could provide a solution with minimizing.

Introduction to Queueing Theory

Scheduling Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.

Topics To Be Covered 1. Tasks of a Shop Control Manager.

1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.

Scheduling. Scheduling: The allocation of resources over time to accomplish specific tasks. Demand scheduling: A type of scheduling whereby customers.

1 Chapter 10 Scheduling 1 Chapter 10 SCHEDULING McGraw-Hill/Irwin © 2003 The McGraw-Hill Companies, Inc., All Rights Reserved.

Approximating the Performance of Call Centers with Queues using Loss Models Ph. Chevalier, J-Chr. Van den Schrieck Université catholique de Louvain.

MGTSC 352 Lecture 25: Congestion Management MEC example Manufacturing example.

M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...

CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.

Queuing Models in Operations

Production Manager 1 Strategic Planning Forecasting

1 Forecasting, Planning and Scheduling

Chapter 6 Queueing Models

Chapter 16 & 9 Scheduling Work & Employees. Scheduling Outline What needs to be scheduled? –doctor’s office, restaurant, mfg. plant, hospital –employees.

Waiting Line Theory Akhid Yulianto, SE, MSc (log).

1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.

Lot-Sizing and Lead Time Performance in a Manufacturing Cell Article from Interfaces (1987) by U. Karmarkar, S. Kekre, S. Kekre, and S. Freeman Illustrates.

1 By: Prof. Y. Peter Chiu POM Chap-8: Scheduling ~ Homework Problems ~

© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.

16 Scheduling (focus on sequencing; FCFS, SPT, EDD pages , and Johnson’s rule pages ) Homework; 6, 7, 11.

CHAPTER 8 Operations Scheduling

Queuing Models Economic Analyses.

Demo on Queuing Concepts

Birth-Death Process Birth – arrival of a customer to the system

Chap 11 Learning Objectives

Variability 8/24/04 Paul A. Jensen

Queuing Models and Capacity Planning

8 Job Sequencing & Operations Scheduling CHAPTER Arranged by

Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry

Model Antrian M/G/1.

Lecture 13 – Queuing Systems

24 February 2019 Model Antrian M/D/1.

Model Antrian M/M/s.

Queuing Theory III.

Queuing Theory III.

Presentation transcript:

Service Manager Forecasting (traffic, orders, …) Determine the Level of Service (Newsboy) Estimate Manpower Requirements Shift Scheduling (LP, IP) Assigning Shifts to Workers (Assignment, LP) Job Sequencing and Scheduling

Determine the Level of Service Choose Service Criteria (t.d. Average Waiting Time or P(wait>T) P(wait) or P(balking) “Newsboy Problem” Probability Distribution of Demand Estimate Cost Under & Over Usually difficult => Service Level

Manpower Requirements Experience Statistics Queueing Theory QTP, Armann Ingolfsson Crystal Ball Simul8 ProModel

Queueing Theory Analytical Models of Waiting Systems Markov-assumptions, i.e. expon (both arrivals & service) Poisson Memoryless Process! Open/Closed System (“Limited Source”) Wait/Balk (“Limited Queue”) Steady State: Arrivals < Capacity

Open Systems, M/M/s M/M/1 og M/M/s TEMPLATE.XLS Given: Arrival og cap. s*µ,Ws=1/µ Steady State: U = Ls/s = / s*µ < 1 Key Results: L, Lq, W, Wq L = Lq + Ls, W = Wq + Ws Little: L = *W og Lq= *Wq

Optimizing Waiting Systems Given (beside, µ): Cs og Cq Find economical no of servers s Difficult to estimate Cq, therefore service level Other models, see G/G/s (approx) etc LIMITED_Q_TEMPLATE.XLS LIMITED_SOURCE_TEMPLATE.XLS

Simulating Waiting Systems Simulation more realistic, “you can always simulate”! Not limited to Markov assumptions Sometimes expensive model building Sometimes too great expectations MULTISERVERSIM.XLS Simul8, ProModel, …

Shift Scheduling Scheduling shifts on days/weeks See p. 148 in Rardin Based on known manpower requirements Ex p. 142 í W&A, WorkerScheduling.xls, Work 5 days, off 2 days Determine how many start at time t Min no of employees needed, LP

Assigning shifts or tasks “Assignment”, see p 235- in W&A Transport Model with all RHS = 1 Assigning jobs to men/machines Swim Teams, Exam Shedules, Fishing Vessels Landings, … See p 58 in Rardin “Crew Scheduling”, See p 572 in Rardin Assigning Shifts: Employees grade shifts

Job Sequencing See p 609- in Rardin Orders or Batches Given: Processing Times, Due Dates Criteria: Flow and/or Due Dates Rules: FCFS, SPT, Slack, EDD Complexity: n jobs to m machines, min setup time, …