The Learning and Forgetting Effects of Dynamic Workers on the Performance of Dispatching Rules in Flow Shops Horng-Chyi HORNG and Shu-Pei HU Department.

Slides:



Advertisements
Similar presentations
Operations Scheduling
Advertisements

Operations Scheduling
ISE480 Sequencing and Scheduling Izmir University of Economics ISE Fall Semestre.
 1  Outline  performance measures for a single-server station  discrete-event simulation  hand simulation  process-oriented simulation approach.
 Basic Concepts  Scheduling Criteria  Scheduling Algorithms.
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Short Term Scheduling Introduction What – Scheduling or timing of operations Where – Timing of operations affects the overall strategy Why – Reduce costs,
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 5: CPU Scheduling.
Scheduling in Batch Systems
Job Release-Time Design in Stochastic Manufacturing Systems Using Perturbation Analysis By: Dongping Song Supervisors: Dr. C.Hicks & Dr. C.F.Earl Department.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E
Ant Colonies As Logistic Processes Optimizers
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
6/25/2015Page 1 Process Scheduling B.Ramamurthy. 6/25/2015Page 2 Introduction An important aspect of multiprogramming is scheduling. The resources that.
An overview of design and operational issues of kanban systems M. S. AKTÜRK and F. ERHUN Presented by: Y. Levent KOÇAĞA.
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
Scheduling.
Lab 01 Fundamentals SE 405 Discrete Event Simulation
1 Fall 2005 Analysis of global and local decision rules in a dual kanban job shop Rafael Diaz, Ph.D. Student, Old Dominion University Ali Ardalan, Ph.D.,
Law of Variable Proportions
Operations Scheduling. Scheduling in a Process-Focused Environment.
Truck set-up scheduling for the Elgin, IL facility Vijay Viswanathan, Graduate Student Dr. Jaejin Jang, Associate Professor Department of Industrial Engineering.
1 CAPACITY PLANNING (Chapter 6) How capacity is measured. p. 221 Capacity utilization = Avg output/Max capacity 221 Capacity planning over ST/MT/LT Factors.
Case study - Student selection for last year of Industrial Engineer at Politecnico di Roma MCDA Summer School 2010 Ecole Centrale de Paris Elise ARNAUD.
Queueing Analysis of Production Systems (Factory Physics)
INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY, P.P , MARCH An ANFIS-based Dispatching Rule For Complex Fuzzy Job Shop Scheduling.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
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.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Chapter 2 – Fundamental Simulation ConceptsSlide 1 of 46 Chapter 2 Fundamental Simulation Concepts.
1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria.
1 Manufacturing Operations Scheduling B2 [ ] B2 [ ] E5 [ E5 [ P9 [---] P9 [---] D1 [ D1 [
Chapter 10 Verification and Validation of Simulation Models
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
Scheduling. Definition of scheduling Establishing the timing of the use of equipment, facilities and human activities in an organization In the decision-making.
1 ISE 195 Introduction to Industrial & Systems Engineering.
1 OUTPUT ANALYSIS FOR SIMULATIONS. 2 Introduction Analysis of One System Terminating vs. Steady-State Simulations Analysis of Terminating Simulations.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
Law of Variable Proportions
Heuristic Methods for the Single- Machine Problem Chapter 4 Elements of Sequencing and Scheduling by Kenneth R. Baker Byung-Hyun Ha R2.
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.
Activity Scheduling and Control
0 Production and Operations Management Norman Gaither Greg Frazier Slides Prepared by John Loucks  1999 South-Western College Publishing.
Scheduling.
A stochastic scheduling algorithm for precedence constrained tasks on Grid Future Generation Computer Systems (2011) Xiaoyong Tang, Kenli Li, Guiping Liao,
CPU Scheduling G.Anuradha Reference : Galvin. CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
Analytical Tools for Process Analysis and Improvement
CHAPTER 8 Operations Scheduling
Chapter 10 Verification and Validation of Simulation Models
Production Activity Control
Process Scheduling B.Ramamurthy 11/18/2018.
CPU Scheduling G.Anuradha
Process Scheduling B.Ramamurthy 12/5/2018.
Variability 8/24/04 Paul A. Jensen
Operating systems Process scheduling.
Process Scheduling B.Ramamurthy 2/23/2019.
Process Scheduling B.Ramamurthy 2/23/2019.
Process Scheduling B.Ramamurthy 4/11/2019.
Process Scheduling B.Ramamurthy 4/7/2019.
Process Scheduling B.Ramamurthy 4/19/2019.
Process Scheduling B.Ramamurthy 4/24/2019.
Process Scheduling B.Ramamurthy 5/7/2019.
Presentation transcript:

The Learning and Forgetting Effects of Dynamic Workers on the Performance of Dispatching Rules in Flow Shops Horng-Chyi HORNG and Shu-Pei HU Department of Industrial Engineering and Management, Chaoyang University of Technology Wufong Township, Taichung County 41349, Taiwan

2 Presentation Outline  Introduction  Learning and Forgetting  Simulation Construction  Experimental Design  Results and Analysis  Conclusions

3 Introduction  The problem of worker shortage comes along with the decreasing birth rate for the recent decade in Taiwan.  One possible solution is training workers to become so- called multitasking workers.  The flexibility of production scheduling increases when adopting multitasking workers, however, so does the complexity.  The purpose of this study is to evaluate how the performance of dispatching rules affected by the learning and forgetting effects of workers.

4 Commonly used dispatching rules  Flow shops Dispatching RulesDefinitions ATmin. Z ij = r i AT-RPTmin. Z ij = r i - rk i FIFOmin. Z ij = r ij PT/TISmin. Z ij = P ij / ( t-r i ) SPTmin. Z ij = P ij  Reference: C. Rajendran and O. Holthaus, “A Comparative Study of Dispatching Rules in Dynamic Flow Shops and Job Shops,” European Journal of Operational Research, Vol. 116, 1999, pp

5 Worker assignment rules  Two categories: “when” and “where”.  Adopting CEN (centralized): the most flexible “when” rule that move away a worker whenever he/she completed the current job.  Adopting FCFS (first come first serve): a “where” rule that prevents jobs waiting in a queue for too long.  Reference: H.V. Kher, 2000, “Examination of Worker Assignment and Dispatching Rules for Managing Vital Customer Priorities in Dual Resource Constrained Job Shop Environments,” Computer and Operations Research, Vol. 27, 2000, pp

6 Learning and Forgetting  Learning effects  The efficiency of a worker in processing jobs at a certain station shall improve as the number of jobs he/she continuously completed increases.  Forgetting effects  The deteriorating of a worker’s efficiency in processing jobs at a certain station as he/she, for some reasons was removed away from that station, stopped processing the same jobs for a period of time.  Reference: J.C. Fisk and D.P. Ballou, “Production Lot Sizing under a Learning Effect,” IIE Transactions, Vol. 14, No. 4, 1982, pp S. Globerson, and N. Levin, “Incorporating Forgetting into Learning Curves,” International Journal of Operations and Production Management, Vol. 7, No. 4, 1987, pp

7 Models for learning and forgetting  Learning model – Mazur and Hastie (1978)  Adding forgetting effects – Nembhard and Uzumeri (2000)

8 Simulation Construction  A hypothetical multi-station, single-server flow shop.  Performance measurements:  mean flowtime of jobs  maximum flowtime of jobs, and  work-in-process (WIP).

9 Experimental Factors  number of stations: 10, 20, and 30;  number of multitasking workers: 10, 20, and 30;  processing time: Normal(3,12), Uniform(1, 5), and Exponential(3) for coefficient of variation(CV) equals to 33.33%, 38.49%, and 100%, respectively; and  utilization rate: 75%, 82.5%, and 90%.

10 Experimental Design (I) StagesDescriptions 1 st stageNo learning nor forgetting effects 2 nd stageOnly learning effects 3 rd stageLearning effects with complete forgotten 4 th stageLearning effects with constant forgetting rate 5 th stageLearning effects with random forgetting rate

11 The 2 nd stage learning model Production Rate 0 Time k Worker assigned to other station

12 The 3 rd stage learning and forgetting model Production Rate 0 Time k Worker assigned to other station

13 The 4 th stage learning and forgetting model Production Rate 0 Time k Worker assigned to other station

14 The 5 th stage learning and forgetting model Production Rate 0 Time k Worker assigned to other station

15 Experimental Design (II)  At each stage, a 2 2 factorial design with n c = 3 center points is adopted as guideline for performing simulation experiments.  Two major factors are number of station and utilization rate.  At each simulation run, there are 30 replications for statistical comparison purposes. Replication length is set to be 12,500 minutes in which the first 2,500 minutes is the system warm-up period.

16 Results and Analysis  Simulation results from the 1 st stage and 2 nd stage serve as fundamental basis for comparison with subsequent stages one by one.  The 1 st stage simulation results are validated and compared to those mentioned in the literature.  Mean flowtime ~ SPT and PT/TIS  WIP ~ SPT and PT/TIS  Maximum flowtime ~ AT, FIFO, and AT-RPT

17 NORMUNIFEXPO F max WIPF max WIPF max WIP 2 nd Stage SPT PT/TIS AT-RPT FIFO AT SPT PT/TIS FIFO SPT PT/TIS AT-RPT FIFO AT SPT PT/TIS SPT PT/TIS FIFO AT AT-RPT SPT 1 st Stage SPT PT/TIS FIFO AT FIFO AT-RPT Best rule(s) from the 2 nd stage experiment for large system with high utilization rate

18 NORMUNIFEXPO F max WIPF max WIPF max WIP 3 rd Stage SPT AT AT-RPT FIFO SPT PT/TIS SPT AT AT-RPT SPT AT FIFO SPT 2 nd Stage SPT PT/TIS SPT PT/TIS AT-RPT AT SPT PT/TIS SPT PT/TIS FIFO SPT AT SPT PT/TIS 1 st Stage AT FIFO AT-RPT SPT AT AT-RPT AT FIFO SPT Best rule(s) from the 3 rd stage experiment for small system with low utilization rate

19 NORMUNIFEXPO F max WIPF max WIPF max WIP 4 th Stage SPT AT-RPT AT FIFO SPT AT-RPT AT SPT AT-RPT FIFO AT SPT 2 nd Stage SPT PT/TIS AT-RPT AT SPT PT/TIS SPT PT/TIS SPT PT/TIS SPT PT/TIS AT-RPT AT FIFO SPT PT/TIS 1 st Stage Best rule(s) from the 4 th stage experiment for medium-size system with medium utilization rate

20 NORMUNIFEXPO F max WIPF max WIPF max WIP 5 th Stage SPT PT/TIS AT AT-RPT SPT PT/TIS SPT PT/TIS AT-RPT AT SPT PT/TIS SPT PT/TIS AT FIFO AT-RPT SPT PT/TIS 2 nd Stage SPT PT/TIS FIFO AT-RPT AT FIFO SPT PT/TIS FIFO SPT PT/TIS FIFO AT-RPT AT FIFO SPT PT/TIS FIFO AT AT-RPT FIFO 1 st Stage Best rule(s) from the 5 th stage experiment for small system with high utilization rate

21 Conclusions  In general, SPT is the best dispatching rule for the mean flowtime and WIP criteria. On the other hand, AT and AT-RPT perform better than others in the maximum flowtime criterion.  Only when the system is relatively small with lower utilization rate, does the learning effect without forgetting effect produces different ranking of best rules than that of no learning effect case.  The rule PT/TIS is a good candidate for the mean flowtime and WIP criteria. However, it is significantly influenced by the models for the forgetting effects of workers.  The incorporation of the forgetting effects of workers to the system actually changes the rankings of best rules in statistical sense.

22 Research Directions  Considering the effects caused by the shortage of workers;  Incorporating more worker assignment rules; and  Examining the effects of learning and forgetting effects on other production systems, such as job shops.

23 Thanks for listening!