A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES
|
|
- Clinton Allison
- 8 years ago
- Views:
Transcription
1 A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES by Zakaria Yahia Abdelrasol Abdelgawad A Thesis Submitted to the Faculty of Engineering at Cairo University in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in MECHANICAL DESIGN AND PRODUCTION FACULTY OF ENGINEERING, CAIRO UNIVERSITY GIZA, EGYPT 2012
2 A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES by Zakaria Yahia Abdelrasol Abdelgawad A Thesis Submitted to the Faculty of Engineering at Cairo University in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in MECHANICAL DESIGN AND PRODUCTION Under the Supervision of Prof. Dr. Mohamed A. Shalaby Dr. Tamer F. Abdelmaguid Professor of Industrial Engineering, Mechanical Design and Production Department, Faculty of Engineering, Cairo University Assistant Professor, Mechanical Design and Production Department, Faculty of Engineering, Cairo University FACULTY OF ENGINEERING, CAIRO UNIVERSITY GIZA, EGYPT 2012 ii
3 A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES by Zakaria Yahia Abdelrasol Abdelgawad A Thesis Submitted to the Faculty of Engineering at Cairo University in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in MECHANICAL DESIGN AND PRODUCTION Approved by the Examining Committee: Prof. Dr. Reda M.S. Abdulaal, Chairman Prof. Dr. Mohammed H. Gadallah, Member Prof. Dr. Mohamed A. Shalaby, Main Advisor FACULTY OF ENGINEERING, CAIRO UNIVERSITY GIZA, EGYPT 2012 iii
4 Table of Contents TABLE OF CONTENTS... IV LIST OF TABLES... VI LIST OF FIGURES... VII NOMENCLATURE... VIII ACKNOWLEDGMENTS... X ABSTRACT... XI CHAPTER 1: INTRODUCTION SIGNIFICANCE OF RESEARCH RESEARCH OBJECTIVES PROBLEM DEFINITION RESEARCH APPROACH ORGANIZATION OF THE THESIS... 8 CHAPTER 2: LITERATURE REVIEW INTRODUCTION DYNAMIC JSSP WITH SEQUENCE-DEPENDENT SETUPS DYNAMIC FJSP SUMMARY AND CONCLUSIONS CHAPTER 3: SIMULATION MODEL MODEL ASSUMPTIONS PART MOVEMENT IN THE SYSTEM JOB DATA PROCESSING TIME SETUP TIME ARRIVAL TIME DUE-DATE OF JOBS DOWNTIME SEQUENCING RULE PERFORMANCE MEASURES Mean Flow Time Mean Tardiness Average Utilization VERIFICATION AND VALIDATION OF THE SIMULATION MODEL iv
5 CHAPTER 4: PROPOSED ROUTING RULES INTRODUCTION WINQ FOR THE WORKING MACHINES (WINQ+BD): MODIFIED WINQ (MWINQ): SHORTEST WAITING AND SETUP TIME (SWST): CHAPTER 5: EXPERIMENTAL DESIGN AND RESULTS INTRODUCTION COMPARISON OF ROUTING RULES MEAN FLOW TIME (MFT) MEAN TARDINESS (MT) AVERAGE UTILIZATION (AU%) STATISTICAL ANALYSIS OF RESULTS BASIC DEFINITIONS EXPERIMENTAL RESULTS AND ANALYSIS MEAN FLOW TIME MEAN TARDINESS AVERAGE UTILIZATION % CHAPTER 6: SUMMARY AND CONCLUSIONS REFERENCES APPENDIXA: PROCESS PLANS AND PROCESSING TIMES APPENDIX B: SETUP TIME MATRICES v
6 List of Tables Table 2-1: Scheduling Rules applied in the Dynamic JSSP with SDS Table 2-2: Routing Rules applied in the Dynamic FJSP Table 5-1: Factors and values for each factor level Table 5-2: Routing rules comparison table for mean flow time (MFT) Table 5-3: Routing rules comparison table for mean tardiness (MT) Table 5-4: Routing rules comparison table for average utilization (AU%) Table 5-5 : Main and interaction effects and P-value Table A-1: Process plans and processing times for low flexibility ratio case...68 Table A-2: Process plans and processing times for high flexibility ratio case...69 Table B-1: Low setup time matrix for machine number Table B-2: Low setup time matrix for machine number Table B-3: Low setup time matrix for machine number Table B-4: Low setup time matrix for machine number Table B-5: Low setup time matrix for machine number Table B-6: Low setup time matrix for machine number Table B-7: Low setup time matrix for machine number Table B-8: Low setup time matrix for machine number Table B-9: Low setup time matrix for machine number Table B-10: Low setup time matrix for machine number Table B-11: High setup time matrix for machine number Table B-12: High setup time matrix for machine number Table B-13: High setup time matrix for machine number Table B-14: High setup time matrix for machine number Table B-15: High setup time matrix for machine number Table B-16: High setup time matrix for machine number Table B-17: High setup time matrix for machine number Table B-18: High setup time matrix for machine number vi
7 Table B-19: High setup time matrix for machine number Table B-20: High setup time matrix for machine number List of Figures Figure 3-1: SIMUL8 block diagram Figure 3-2: Control logic for parts Figure 3-3: Classification based on objective functions Figure 4-1: WINQ routing rule flow chart Figure 4-2: BL routing rule flow chart Figure 4-3: WINQ+BD routing rule flow chart Figure 4-4: MWINQ routing rule flow chart Figure 4-5: SWST routing rule flow chart Figure 5-1: Mean flow time (MFT) comparison results Figure 5-2: Mean tardiness(mt) comparison results Figure 5-3: Average utilization (AU%) comparison results Figure 5-4: Main effect plots for Mean Flow Time Figure 5-5: Interaction effect plots for Mean Flow Time Figure 5-6: Main effect plots for Mean Tardiness Figure 5-7: Interaction effect plots for Mean Tardiness Figure 5-8: Main effect plots for Average Utilization % Figure 5-9: Interaction effect plots for Average Utilization % vii
8 Nomenclature µ g The Mean Number of Operations per Job. µ p The Average Time Required for Processing and Setups per Operation. µ s The Overall Mean Setup Time. a The Mean Inter-arrival Time. a i The Arrival Time of Job i. ANOVA Analysis of the Variance. AU Average Machines Utilization. BL Balanced Load. C i The Completion Time of job i. CWT The Accumulated Working Time (Setup and Processing) of Machine i. D i The Due Date of Job i. F i Flow Time of job i. FJSP Flexible Job Shop Problem. FR Flexibility Ratio. JSSP Job Shop Scheduling Problem. k The Due Date Tightness Factor. L i Lateness of Job i. m The Number of Machines in The Shop. MFT Mean Flow Time. MT Mean Tardiness. MTBF Mean Time between Failures. MTTR Mean Time to Repair. MWINQ Modified Work in Next Queue. n The Total Number of Jobs. viii
9 p The Overall Mean Processing Time. PDT Percentage Downtime or Breakdown level. QL i The Queue Length Associated with Machine i. R Number of The Available Alternative Machines for an Operation. RPD The Relative Percentage Deviation. SDS Sequence Dependent Setups. SR Setup time Ratio. SSPT Shortest Setup Time and Processing Time Scheduling Rule. ST The required setup time for the next operation. SWST Shortest Waiting and Setup Times. T i Tardiness of job i. TI Traffic Intensity or Shop Load. TWK The total Work Content. U i Utilization of Machine i. WINQ Work in Next Queue. WINQ & BD Work in Next Queue with Exclusion of the Broken Down Machines. WST The Total Estimated Waiting and Setup Times. ix
10 Acknowledgments My sincere appreciation goes to both Prof. Dr. Mohammed A. Shalaby and Dr. Tamer F. Abdelmaguid, my academic and thesis advisors, for their valuable support, guidance, encouragement, and patience. By all means, this thesis would not have been a reality without their knowledge, constructive criticism, and supervision. I am so grateful for my loving and supporting wife, for without her I would have not had the extra pushing that I needed from time to time to keep focused on my studies. I wish to express my thanks to my mother, and my brothers for their ongoing support to me through all the ups and downs on life. It is to my wife and my children whom I dedicate this thesis. x
11 Abstract This thesis addresses the problem of scheduling a dynamic job shop in which there are alternative machines that can be used to process a given operation. The machine setup times are considered and assumed as sequence-dependent. Machines are prone to failure, and stochastic processing, setup and down times are assumed. The target of this study is to develop new routing rules which define the route of each part by selecting an appropriate machine for each operation. A simulation study is conducted to investigate the performance of job shop under the developed routing rules. The performance is evaluated using three performance measures, namely mean flow time, mean tardiness, and average utilization. The developed new routing rules in this study are: Work in next queue with exclusion of the broken down machine (WINQ+BD), Modified Work in Next Queue (MWINQ) and Shortest Waiting and Setup Times (SWST). These new rules are compared via simulation with two well-known routing rules: Work in Next Queue (WINQ) and Balanced Load (BL), which are reported in the literature. A set of experimental problems are developed with considering four factors; shop load, flexibility ratio, setup time ratio and downtime ratio. The simulation results show that the SWST rule outperforms the other rules for the mean flow time and mean tardiness performance measures. Furthermore, the performance of the SWST rule improves at higher levels of all factors. While, for the average utilization, the WINQ, WINQ+BD and MWINQ rules result in the best performance and the differences between them and the SWST rule, are minor. xi
12 Chapter 1 Introduction 1.1 Significance of Research Sequencing problems are very common occurrences. They exist whenever there is a choice as to the order in which a number of tasks can be performed, Conway et al. (1967). Sequencing and scheduling are forms of decision-making that play an important role in manufacturing as well as in service industries. They are used in many applications such as procurement and production, transportation and distribution, and information processing and communication. The scheduling function in a company is to allocate limited resources to the processing tasks. To be competitive, a company has to schedule activities in such way as to use the resources available in an effective manner. Studies in job shop scheduling problem (JSSP) are significant due to several reasons. One of them is, about 50% - 75% of all manufactured parts fall into the low volume and high variety and mid-volume and mid variety categories, and with the trend towards variety in products, this percentage is likely to increase, Adams et al. (1988). Although the experience of industries such as machine tool, metal processing, paper packaging, and printing shows that setup time varies and it is jobsequence dependent, most of authors who considered JSSP are either to neglect or to include the setup times in the processing times so as to simplify the problem. While in most real manufacturing systems, arrival pattern of jobs is a dynamic and there are a lot of natural variations in processing and setup times, there is a small number of authors whose considered dynamic JSSP and stochastic times. Also few authors have considered the JSSP with SDS and alternate routing. Authors who considered this problem assumed a static arrival 1
13 pattern. This low interest is due to the problem difficulties especially with these assumptions. A practical example in which SDS times can be encountered is in semiconductor industries. For instance, semiconductor testing requires that a circuit be tested under different temperatures. The testing facility needs time to adjust to the required temperature in which case the time required depends on the current temperature and the target temperature. Thus, setup times depend significantly on the sequence by which semiconductor components are tested. Other examples include cutting and stitching machines in a commercial printing firm, the stamping operation in plastics manufacturing, die changing in metal processing and roll slitting in the paper industry, printing, metal and chemical processing etc. For the case of alternate routing, often in industry, there are several nonidentical machines that can be used in executing a specific operation. In this problem, a job can be processed on either of a number of machines, perhaps with either a time or a cost penalty if an alternate machine is selected. This problem could arise if a machine is overloaded and an operation can be executed on an older machine that takes longer processing time. The routing flexibility is also used to tackle production stops, if busy or inoperative machines occur. It replaces and often outperforms the availability of alternative process plans for a given part. The scope of this research is the JSSP with the condition of alternate routing of operations along with the consideration of SDS times in a dynamic scheduling environment that takes into consideration machine failure and time uncertainty. 2
14 1.2 Research Objectives According to the literature, the JSSP in most cases is NP-hard. So JSSP remains an open issue to be solved. Optimization techniques can give very good solutions. It is especially true for small problem sizes and static problems. The disadvantage of combinatorial optimization comes from the dimensionality of the problem formulation. Regardless of whether it is formulated as a disjunctive programming or mixed integer programming model, the dimensionality is high. Due to the large dimensionality, the optimization techniques that have been developed often require excessive computational time during which the system to be scheduled has changed. So, the performance of generated schedules is not satisfactory. However, due to the complexity and unpredictability of manufacturing environments, existing optimization techniques are not efficient enough to deal with the dynamic nature of manufacturing systems. Another disadvantage of combinatorial optimization is that it often over simplifies the system. Most methods developed in combinatorial optimization use minimization of makespan as objective function. In practice, a manufacturing system represents a continuous flow of production which cannot be clearly segmented in order to create a measure of makespan. Unrealistic simplifications also include omission of SDSs while setups are common phenomena in manufacturing systems. Other new techniques like, expert system has the advantages of the possibility of customization and flexibility of the system where the complexity of building, verifying and changing the model are the main disadvantages. Dispatching rules have been used in the last decades to address scheduling problems for their simplicity and ease of use. Dispatching rules are simple algorithms that have been developed to control the production sequences. The effects of dispatching rules are normally studied with the use of computer simulation models. The reason for using simulation models is evident. First, it is almost impossible to test all the available dispatching rules on the physical system due to the required time frame and associated cost. Second, without 3
15 testing alternative rules, there is no way to predict how they will affect the system's behavior. Computer simulation models have made it feasible to quickly compare alternative dispatching rules and test their effect on shop operation performance regardless of the problem dimensionality. In order to find the optimal sequence of jobs, dispatching rules have been applied to determine job priority. As soon as a machine becomes free, it has to be decided which of the waiting jobs is to be loaded on the machine. For making this decision, a priority rule is used to assign a priority value to each of the waiting jobs. The job having the highest priority, which is defined by either the smallest or the largest priority value, is selected for processing next. In the flexible job shop environments, there are alternative machines to perform an operation, so routing rules used to select a machine among these alternative machines. Routing rule selects a machine according to specific criteria, that to improve the considered performance measure. The rules proposed in this area are few: the most prominent heuristic in this area is still the least work in next queue (WINQ). The first objective of this study is to develop simple real-time alternate machine selection rules (routing rules) applicable for dynamic routing of parts, to minimize mean flow time and mean tardiness, and maximizing average utilization in flexible job shop with sequence-dependent setups and machines breakdown. The second objective of this dissertation is to analyze the performance of the proposed routing rules against the different values of the experimental factors to be sure that the proposed rules are applicable in cases of machine breakdowns, heavy traffic intensity, high setup times, and at different flexibility ratios. 4
16 1.3 Problem Definition We consider a scheduling problem in which jobs arrive continuously over time (dynamically) to a job shop consisting of a set of different machines. The time between arrivals of jobs is a random variable with a known probability distribution function. Each arriving job has a pre-assigned due date. There is a finite set of job types where each job type has a predetermined sequence of manufacturing operations, where operation needs to be processed on one machine out of a set of alternate machines. The type of an arriving job follows a given discrete probability distribution function. The duration or processing time of each operation on its selected machine is a random variable with a known probability distribution function. There is a machine setup time needed before an operation can start on its selected machine. The length of the machine setup time of an operation is a random variable whose distribution function depends on which operation has just finished its processing on the same machine. This is referred to as sequence-dependent setup time. Furthermore, machine failures may occur randomly. Both time between failures and downtime are random variables with known probability distribution functions for each machine. The job shop becomes a queuing system: a job leaves one machine and proceeds on its route to the selected machine for the next operation, only to find other jobs already waiting for the machine to complete its current task, so that a queue of jobs in front of that machine is formed. The studied problem essentially involves two types of decisions. The first one concerns the selection of a machine to process each operation from its set of eligible machines. The second one is of deciding the order or priority for the jobs waiting to be processed at each machine. 5
17 The scheduling problem considered in the present work can be defined as follows: jobs arrive continuously into the system to be processed on multiple machines, There are m machines M 1,...,M m and n jobs J 1,...,J n. Each job consists of a sequence of operations O jh, (h=1,...n), denoting the h th operation of job j, with the total number of operations equal to N. The operation O jh is executed on the machine M jh with processing time p jh. For any two successive operations O jh and O kl to be processed on the same machine (M jh =M kl ), there is a setup time S jh,kl between them. Operation O jh can be executed on a machine M jh or on its alternative machine M jh,ar. Job j arrives at time r j and is due at time d j. If job j is completed after d j, there will be a delay penalty. On the other hand, no penalty incurs if a job is completed on or before its due date. In this study, the delay penalty of job j is defined as its tardiness which is equal to max {0, C j d j }, where C j is the completion time of job j. The arrival time, due date, routing and processing times of a job are not known until the job arrives in the shop. The objective is to find a production sequence of the jobs on the processors such that one or some selected criteria are optimized. The following objectives based on flow time and due dates are considered: Minimization of mean flow time per job, Minimization of mean tardiness per job, and Maximization of average machine utilization of all machines. The present study focuses on scheduling a dynamic job shop under the following assumptions: An operation cannot start before its preceding operation for the same job is completed. Each machine can perform only one operation at a time. 6
18 Whenever an operation starts on a given machine, it cannot be preempted by another operation. The machines are different and there is only one machine of each type. Job type assigned according to suitable probability distribution. Arrival times and due dates are only known in time and not a prior. Jobs inter-arrival times and due dates follow suitable probability distributions. Each job has one or more possible sequence(s) of operations (alternate routing). Processing times of all jobs on each machine follow stochastic distributions. Machine setup for a given job is dependent on the preceding job on the same machine. An operation can be processed on a set of alternative machine types. Machine breakdowns are allowed, and more than one machine may fail in the same time. Time between failures is a random variable. If an operation is interrupted due to machine breakdown, it presumes its remaining processing time after repair. 1.4 Research Approach The effect of different routing rules is studied through the following methodology: Creating a simulation model for the considered configuration. In this regard SIMUL8 simulator software is used for modeling the problem. Using the Design of Experiments (D.O.E) method to set up runs for studying the performance of the proposed routing rules based on the performance measures of interest. Executing the simulation runs and collecting the results. 7
19 Comparing the results of the proposed rules with the results of rules considered from the literature. Evaluating and analyzing the performance of the routing rules for each set of experiments based on the performance measure through ANOVA (Analysis of the Variance) statistical analysis. Presenting conclusions of this study, and the recommended future work. 1.5 Organization of the Thesis The remainder of this thesis organized as follow: Chapter 2 provides a detailed survey of the previous studies of scheduling problems related to our main assumptions. Chapter 3 provides an overview of the configuration, data, times, values applied in the model. Chapter 4 presents the details of the three proposed routing rules. Chapter 5 covers the applied design of experiments to evaluate the performance of routing rules. In this regard the factors and experimental conditions of interest are presented. Then the results are generally presented, followed by discussions and analyses of results. Chapter 6 presents concluding remarks, the highlights of the research and recommendations for future research. 8
20 Chapter 2 Literature Review 2.1 Introduction The first comprehensive survey paper on scheduling problems with separate setup times or costs, was conducted by Allahverdi et al. (1999). It reviewed the literature since the mid-1960s. Allahverdi et al. (2008) provided an extensive review of the scheduling literature which appeared after They classified the separate setup time (cost) scheduling problems relative to shop environment to single machine, parallel machines, flow shop and job shop. Then they sub classified the problems relative to batches and non-batches consideration, and then relative to setup dependency to sequence independent, and sequence dependent setups (SDS). Low-volume, high-variety production systems in which products are made to order and alternative machines exist are referred to as flexible job shops. The scheduling problem in those systems, referred to as flexible job shop scheduling problem (FJSP), is a generalization of the traditional job shop scheduling problem (JSSP) in which there is no alternative machines. The JSSP is known to be NP-hard (Garey et al., 1977), and so is the FJSP. Therefore, in a dynamic environment in which scheduling decisions need to be made quickly, it is not an option to look for an optimal solution for the FJSP. Rather, heuristic scheduling rules are more reasonable and convenient. As mentioned earlier, the job shop scheduling problem in most cases is NPhard. So job shop scheduling remains an open issue to be solved. Optimization techniques can give very good solutions. It is especially true for small problem sizes and static problems. The disadvantage of combinatorial optimization 9
Factors to Describe Job Shop Scheduling Problem
Job Shop Scheduling Job Shop A work location in which a number of general purpose work stations exist and are used to perform a variety of jobs Example: Car repair each operator (mechanic) evaluates plus
More information1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir. Chapter Three
Chapter Three Scheduling, Sequencing and Dispatching 3-1- SCHEDULING Scheduling can be defined as prescribing of when and where each operation necessary to manufacture the product is to be performed. It
More informationHMLV Manufacturing Systems Simulation Analysis Using the Database Interface
HMLV Manufacturing Systems Simulation Analysis Using the Database Interface JURAJ ŠVANČARA Faculty of Electrical Engineering and Information Technology Slovak University of Technology in Bratislava Ilkovicova
More informationCHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION
31 CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION 3.1 INTRODUCTION In this chapter, construction of queuing model with non-exponential service time distribution, performance
More informationDiscrete-Event Simulation
Discrete-Event Simulation Prateek Sharma Abstract: Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the
More informationHigh-Mix Low-Volume Flow Shop Manufacturing System Scheduling
Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute
More informationPerformance Analysis of Job-Shop Production Systems under Different Order Release Control Parameters
Performance Analysis of Job-Shop Production Systems under Different Order Release Control Parameters Paulo S. A. Sousa and Maria R. A. Moreira Abstract Controlling the flow of materials inside job-shops
More informationAutomated Scheduling Methods. Advanced Planning and Scheduling Techniques
Advanced Planning and Scheduling Techniques Table of Contents Introduction 3 The Basic Theories 3 Constrained and Unconstrained Planning 4 Forward, Backward, and other methods 5 Rules for Sequencing Tasks
More informationModeling Stochastic Inventory Policy with Simulation
Modeling Stochastic Inventory Policy with Simulation 1 Modeling Stochastic Inventory Policy with Simulation János BENKŐ Department of Material Handling and Logistics, Institute of Engineering Management
More informationResource grouping selection to minimize the maximum over capacity planning
2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Resource grouping selection to minimize the maximum over capacity
More informationPriori ty ... ... ...
.Maintenance Scheduling Maintenance scheduling is the process by which jobs are matched with resources (crafts) and sequenced to be executed at certain points in time. The maintenance schedule can be prepared
More informationOperations and Supply Chain Simulation with AnyLogic 7.2
Operations and Supply Chain Simulation with AnyLogic 7.2 Decision-oriented introductory notes for management students in master programs Prof. Dr. Dmitry Ivanov Berlin School of Economics and Law Professor
More informationResearch Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
Hindawi Publishing Corporation Advances in Operations Research Volume 2009, Article ID 153910, 10 pages doi:10.1155/2009/153910 Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent
More informationAn investigation into production scheduling systems
Computer Science Kjell Olofsson An investigation into production scheduling systems D-dissertation (10 p) 2004:06 This report is submitted in partial fulfillment of the requirements for the Master s degree
More informationPART III. OPS-based wide area networks
PART III OPS-based wide area networks Chapter 7 Introduction to the OPS-based wide area network 7.1 State-of-the-art In this thesis, we consider the general switch architecture with full connectivity
More informationAbstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling
Abstract number: 015-0551 Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Karuna Jain and Kanchan Joshi Shailesh J. Mehta School of Management, Indian Institute
More informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationvii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK
vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS LIST OF SYMBOLS LIST OF APPENDICES
More informationPRIORITY DISPATCH SCHEDULING IN AN AUTOMOBILE REPAIR AND MAINTENANCE WORKSHOP
Journal of Engineering Science and Technology Vol. 6, No. 5 (2011) 606-618 School of Engineering, Taylor s University PRIORITY DISPATCH SCHEDULING IN AN AUTOMOBILE REPAIR AND MAINTENANCE WORKSHOP AKINYEMI
More informationCoordination in vehicle routing
Coordination in vehicle routing Catherine Rivers Mathematics Massey University New Zealand 00.@compuserve.com Abstract A coordination point is a place that exists in space and time for the transfer of
More informationEfficient Parallel Processing on Public Cloud Servers Using Load Balancing
Efficient Parallel Processing on Public Cloud Servers Using Load Balancing Valluripalli Srinath 1, Sudheer Shetty 2 1 M.Tech IV Sem CSE, Sahyadri College of Engineering & Management, Mangalore. 2 Asso.
More informationManufacturing Systems Modeling and Analysis
Guy L. Curry Richard M. Feldman Manufacturing Systems Modeling and Analysis 4y Springer 1 Basic Probability Review 1 1.1 Basic Definitions 1 1.2 Random Variables and Distribution Functions 4 1.3 Mean and
More informationTai Kam Fong, Jackie. Master of Science in E-Commerce Technology
Trend Following Algorithms in Automated Stock Market Trading by Tai Kam Fong, Jackie Master of Science in E-Commerce Technology 2011 Faculty of Science and Technology University of Macau Trend Following
More informationIntroduction to Engineering System Dynamics
CHAPTER 0 Introduction to Engineering System Dynamics 0.1 INTRODUCTION The objective of an engineering analysis of a dynamic system is prediction of its behaviour or performance. Real dynamic systems are
More informationAn improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
This is the Pre-Published Version. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines Q.Q. Nong, T.C.E. Cheng, C.T. Ng Department of Mathematics, Ocean
More informationFair Scheduling Algorithm with Dynamic Load Balancing Using In Grid Computing
Research Inventy: International Journal Of Engineering And Science Vol.2, Issue 10 (April 2013), Pp 53-57 Issn(e): 2278-4721, Issn(p):2319-6483, Www.Researchinventy.Com Fair Scheduling Algorithm with Dynamic
More informationAS-D1 SIMULATION: A KEY TO CALL CENTER MANAGEMENT. Rupesh Chokshi Project Manager
AS-D1 SIMULATION: A KEY TO CALL CENTER MANAGEMENT Rupesh Chokshi Project Manager AT&T Laboratories Room 3J-325 101 Crawfords Corner Road Holmdel, NJ 07733, U.S.A. Phone: 732-332-5118 Fax: 732-949-9112
More informationA SIMULATION MODEL FOR RESOURCE CONSTRAINED SCHEDULING OF MULTIPLE PROJECTS
A SIMULATION MODEL FOR RESOURCE CONSTRAINED SCHEDULING OF MULTIPLE PROJECTS B. Kanagasabapathi 1 and K. Ananthanarayanan 2 Building Technology and Construction Management Division, Department of Civil
More informationIntegrated support system for planning and scheduling... 2003/4/24 page 75 #101. Chapter 5 Sequencing and assignment Strategies
Integrated support system for planning and scheduling... 2003/4/24 page 75 #101 Chapter 5 Sequencing and assignment Strategies 5.1 Overview This chapter is dedicated to the methodologies used in this work
More information-SQA- SCOTTISH QUALIFICATIONS AUTHORITY HIGHER NATIONAL UNIT SPECIFICATION GENERAL INFORMATION ----------------------------------------
-SQA- SCOTTISH QUALIFICATIONS AUTHORITY HIGHER NATIONAL UNIT SPECIFICATION GENERAL INFORMATION -Unit Number- 7481684 -Superclass- -Title- RB OPERATIONAL RESEARCH B ----------------------------------------
More information1: B asic S imu lati on Modeling
Network Simulation Chapter 1: Basic Simulation Modeling Prof. Dr. Jürgen Jasperneite 1 Contents The Nature of Simulation Systems, Models and Simulation Discrete Event Simulation Simulation of a Single-Server
More informationClassification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
More informationDiscrete-Event Simulation
Discrete-Event Simulation 14.11.2001 Introduction to Simulation WS01/02 - L 04 1/40 Graham Horton Contents Models and some modelling terminology How a discrete-event simulation works The classic example
More information2 Organizations and Organizational Structures 2.1 Functional and Project Organizations, Typical Goals and Performance Measures
2 Organizations and Organizational Structures 2.1 Functional and Project Organizations, Typical Goals and Performance Measures The history of organizations is probably as long as the history of mankind.
More informationFAULT TOLERANCE FOR MULTIPROCESSOR SYSTEMS VIA TIME REDUNDANT TASK SCHEDULING
FAULT TOLERANCE FOR MULTIPROCESSOR SYSTEMS VIA TIME REDUNDANT TASK SCHEDULING Hussain Al-Asaad and Alireza Sarvi Department of Electrical & Computer Engineering University of California Davis, CA, U.S.A.
More informationAn Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem
An Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem Tatsunobu Kawai, Yasutaka Fujimoto Department of Electrical and Computer Engineering, Yokohama National University, Yokohama 240-8501
More informationAnalysis Of Shoe Manufacturing Factory By Simulation Of Production Processes
Analysis Of Shoe Manufacturing Factory By Simulation Of Production Processes Muhammed Selman ERYILMAZ a Ali Osman KUŞAKCI b Haris GAVRANOVIC c Fehim FINDIK d a Graduate of Department of Industrial Engineering,
More informationDetermining Inventory Levels in a CONWIP Controlled Job Shop
Determining Inventory Levels in a CONWIP Controlled Job Shop Sarah M. Ryan* Senior Member, IIE Department of Industrial and Management Systems Engineering University of Nebraska-Lincoln Lincoln, NE 68588-0518
More informationScheduling of Wafer Test Processes in Semiconductor Manufacturing
Scheduling of Wafer Test Processes in Semiconductor Manufacturing Yufeng Lu Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements
More informationSchneps, Leila; Colmez, Coralie. Math on Trial : How Numbers Get Used and Abused in the Courtroom. New York, NY, USA: Basic Books, 2013. p i.
New York, NY, USA: Basic Books, 2013. p i. http://site.ebrary.com/lib/mcgill/doc?id=10665296&ppg=2 New York, NY, USA: Basic Books, 2013. p ii. http://site.ebrary.com/lib/mcgill/doc?id=10665296&ppg=3 New
More informationThe problem with waiting time
The problem with waiting time Why the only way to real optimization of any process requires discrete event simulation Bill Nordgren, MS CIM, FlexSim Software Products Over the years there have been many
More informationProject management: a simulation-based optimization method for dynamic time-cost tradeoff decisions
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 2009 Project management: a simulation-based optimization method for dynamic time-cost tradeoff decisions Radhamés
More informationUNITY CALL CENTER REPORTING. Version 1.0
UNITY CALL CENTER REPORTING Version 1.0 Contents Introduction... 3 Accessing the Reports... 3 Abandoned Call Report... 4 Settings:... 4 Report:... 5 Agent Activity Detail Report... 6 Settings:... 6 Report:...
More informationObservations on PCB Assembly Optimization
Observations on PCB Assembly Optimization A hierarchical classification scheme based on the number of machines (one or many) and number of boards (one or many) can ease PCB assembly optimization problems.
More informationReal Time Scheduling Basic Concepts. Radek Pelánek
Real Time Scheduling Basic Concepts Radek Pelánek Basic Elements Model of RT System abstraction focus only on timing constraints idealization (e.g., zero switching time) Basic Elements Basic Notions task
More informationHow To Manage A Call Center
THE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT Roger Klungle AAA Michigan Introduction With recent advances in technology and the changing nature of business, call center management has become a rapidly
More informationThe Service Optimization Challenge Business Paper
The Service Optimization Challenge Business Paper Table of Contents Introduction............................................2 The Service Optimization Challenge.......................... 3 Avoiding Losses
More informationFlexible Manufacturing System
Flexible Manufacturing System Introduction to FMS Features of FMS Operational problems in FMS Layout considerations Sequencing of Robot Moves FMS Scheduling and control Examples Deadlocking Flow system
More informationUsing Queueing Network Models to Set Lot-sizing Policies. for Printed Circuit Board Assembly Operations. Maged M. Dessouky
Using Queueing Network Models to Set Lot-sizing Policies for Printed Circuit Board Assembly Operations Maged M. Dessouky Department of Industrial and Systems Engineering, University of Southern California,
More informationAN EFFICIENT LOAD BALANCING APPROACH IN CLOUD SERVER USING ANT COLONY OPTIMIZATION
AN EFFICIENT LOAD BALANCING APPROACH IN CLOUD SERVER USING ANT COLONY OPTIMIZATION Shanmuga Priya.J 1, Sridevi.A 2 1 PG Scholar, Department of Information Technology, J.J College of Engineering and Technology
More informationHSR HOCHSCHULE FÜR TECHNIK RA PPERSW I L
1 An Introduction into Modelling and Simulation 4. A Series of Labs to Learn Simio af&e Prof. Dr.-Ing. Andreas Rinkel andreas.rinkel@hsr.ch Tel.: +41 (0) 55 2224928 Mobil: +41 (0) 79 3320562 Lab 1 Lab
More informationPROJECT MANAGEMENT PROFESSIONAL CERTIFIED ASSOCIATE IN PROJECT MANAGEMENT (PMP & CAPM) EXAM PREPARATION WORKSHOP
TSE015 PROJECT MANAGEMENT PROFESSIONAL CERTIFIED ASSOCIATE IN PROJECT MANAGEMENT (PMP & CAPM) EXAM PREPARATION WORKSHOP Course Outline I. Introduction and Course Objectives A. About PMI B. PMP and CAPM
More informationINTEGRATED OPTIMIZATION OF SAFETY STOCK
INTEGRATED OPTIMIZATION OF SAFETY STOCK AND TRANSPORTATION CAPACITY Horst Tempelmeier Department of Production Management University of Cologne Albertus-Magnus-Platz D-50932 Koeln, Germany http://www.spw.uni-koeln.de/
More informationHelical Antenna Optimization Using Genetic Algorithms
Helical Antenna Optimization Using Genetic Algorithms by Raymond L. Lovestead Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements
More informationScheduling of a computer integrated manufacturing system: A simulation study
JIEM, 011 4(4):577-609 Online ISSN: 01-095 Print ISSN: 01-84 http://dx.doi.org/10.96/jiem.1 Scheduling of a computer integrated manufacturing system: A simulation study Nadia Bhuiyan 1, Gerard Gouw 1,
More informationComparing Steady-state Performance of Dispatching Rule-pairs in Open Shops
International Journal of Applied Science and Engineering 006.4, 3: 59-73 Comparing Steady-state Performance of Dispatching Rule-pairs in Open Shops Horng-Chyi Horng * Department of Industrial Engineering
More informationA Profit-Maximizing Production Lot sizing Decision Model with Stochastic Demand
A Profit-Maximizing Production Lot sizing Decision Model with Stochastic Demand Kizito Paul Mubiru Department of Mechanical and Production Engineering Kyambogo University, Uganda Abstract - Demand uncertainty
More informationReal Time Bus Monitoring System by Sharing the Location Using Google Cloud Server Messaging
Real Time Bus Monitoring System by Sharing the Location Using Google Cloud Server Messaging Aravind. P, Kalaiarasan.A 2, D. Rajini Girinath 3 PG Student, Dept. of CSE, Anand Institute of Higher Technology,
More informationCHAPTER 1. Basic Concepts on Planning and Scheduling
CHAPTER 1 Basic Concepts on Planning and Scheduling Scheduling, FEUP/PRODEI /MIEIC 1 Planning and Scheduling: Processes of Decision Making regarding the selection and ordering of activities as well as
More informationAnalysis And Comparison Of Dispatching Rule- Based Scheduling In Dual-Resource Constrained Shop-Floor Scenarios
Analysis And Comparison Of Dispatching Rule- Based Scheduling In Dual-Resource Constrained Shop-Floor Scenarios Bernd Scholz-Reiter, Jens Heger, Torsten Hildebrandt Abstract--There has been a lot of research
More informationApplied mathematics and mathematical statistics
Applied mathematics and mathematical statistics The graduate school is organised within the Department of Mathematical Sciences.. Deputy head of department: Aila Särkkä Director of Graduate Studies: Marija
More informationArena 9.0 Basic Modules based on Arena Online Help
Arena 9.0 Basic Modules based on Arena Online Help Create This module is intended as the starting point for entities in a simulation model. Entities are created using a schedule or based on a time between
More informationDeployment of express checkout lines at supermarkets
Deployment of express checkout lines at supermarkets Maarten Schimmel Research paper Business Analytics April, 213 Supervisor: René Bekker Faculty of Sciences VU University Amsterdam De Boelelaan 181 181
More informationA Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks
World Applied Sciences Journal 7 (10): 1324-1330, 2009 ISSN 1818-4952 IDOSI Publications, 2009 A Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks Siamak Baradaran and S.M.T.
More informationSchedule Risk Analysis Simulator using Beta Distribution
Schedule Risk Analysis Simulator using Beta Distribution Isha Sharma Department of Computer Science and Applications, Kurukshetra University, Kurukshetra, Haryana (INDIA) ishasharma211@yahoo.com Dr. P.K.
More informationScheduling Allowance Adaptability in Load Balancing technique for Distributed Systems
Scheduling Allowance Adaptability in Load Balancing technique for Distributed Systems G.Rajina #1, P.Nagaraju #2 #1 M.Tech, Computer Science Engineering, TallaPadmavathi Engineering College, Warangal,
More informationImproving Outpatient Waiting Time Using Simulation Approach
2014 UKSim-AMSS 8th European Modelling Symposium Improving Outpatient Waiting Time Using Simulation Approach Arwa Jamjoom 1, Manal Abdullah 2, Maysoon Abulkhair 3, Thoria Alghamdi 4, Aisha Mogbil 5 1,2,3,4,5
More informationSINGLE-STAGE MULTI-PRODUCT PRODUCTION AND INVENTORY SYSTEMS: AN ITERATIVE ALGORITHM BASED ON DYNAMIC SCHEDULING AND FIXED PITCH PRODUCTION
SIGLE-STAGE MULTI-PRODUCT PRODUCTIO AD IVETORY SYSTEMS: A ITERATIVE ALGORITHM BASED O DYAMIC SCHEDULIG AD FIXED PITCH PRODUCTIO Euclydes da Cunha eto ational Institute of Technology Rio de Janeiro, RJ
More informationThe Trip Scheduling Problem
The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems
More informationDispatching rule-based algorithms for a dynamic flexible flow shop scheduling problem with time-dependent process defect rate and quality feedback
Available online at www.sciencedirect.com Procedia CIRP CMS (2013) 000 000 Forty Sixth CIRP Conference on Manufacturing Systems 2013 Dispatching rule-based algorithms for a dynamic flexible flow shop scheduling
More informationGENERAL PROCEDURES AND GUIDELINES
Graduate Program Electrical and Computer Engineering Wallace H. Coulter School of Engineering GENERAL PROCEDURES AND GUIDELINES Revised: August 18, 2010 Table of Contents I. INTRODUCTION.. 1 II. ADMINISTRATIVE
More informationConclusions and Suggestions for Future Research
6 Conclusions and Suggestions for Future Research In this thesis dynamic inbound contact centers with heterogeneous agents and retrials of impatient customers were analysed. The term dynamic characterises
More informationAnalysis of Micromouse Maze Solving Algorithms
1 Analysis of Micromouse Maze Solving Algorithms David M. Willardson ECE 557: Learning from Data, Spring 2001 Abstract This project involves a simulation of a mouse that is to find its way through a maze.
More informationCompletion Time Scheduling and the WSRPT Algorithm
Completion Time Scheduling and the WSRPT Algorithm Bo Xiong, Christine Chung Department of Computer Science, Connecticut College, New London, CT {bxiong,cchung}@conncoll.edu Abstract. We consider the online
More informationMODELLING AND ANALYSIS OF INTEGRATED PRODUCTION - INVENTORY - DISTRIBUTION SYSTEMS. A. NOORUL HAQ Department of Mechanical Engineering
MODELLING AND ANALYSIS OF INTEGRATED PRODUCTION - INVENTORY - DISTRIBUTION SYSTEMS 0 00 By A. NOORUL HAQ Department of Mechanical Engineering z-l1l2 THESIS SUBMITTED IN FULFILMENT OF THE REQUIREMENTS FOR
More informationA two-level scheduler to dynamically schedule a stream of batch jobs in large-scale grids
Managed by A two-level scheduler to dynamically schedule a stream of batch jobs in large-scale grids M. Pasquali, R. Baraglia, G. Capannini, L. Ricci, and D. Laforenza 7th Meeting of the Institute on Resource
More informationHow To Evaluate The Performance Of The Process Industry Supply Chain
Performance Evaluation of the Process Industry Supply r Chain: Case of the Petroleum Industry in India :.2A By Siddharth Varma Submitted in fulfillment of requirements of the degree of DOCTOR OF PHILOSOPHY
More informationOptimal Scheduling for Dependent Details Processing Using MS Excel Solver
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of
More informationA Review on Load Balancing In Cloud Computing 1
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 4 Issue 6 June 2015, Page No. 12333-12339 A Review on Load Balancing In Cloud Computing 1 Peenaz Pathak, 2 Er.Kamna
More informationSUPPLY CHAIN MODELING USING SIMULATION
SUPPLY CHAIN MODELING USING SIMULATION 1 YOON CHANG AND 2 HARRIS MAKATSORIS 1 Institute for Manufacturing, University of Cambridge, Cambridge, CB2 1RX, UK 1 To whom correspondence should be addressed.
More informationProject Scheduling: PERT/CPM
Project Scheduling: PERT/CPM CHAPTER 8 LEARNING OBJECTIVES After completing this chapter, you should be able to: 1. Describe the role and application of PERT/CPM for project scheduling. 2. Define a project
More informationMIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 132 139 MIP-Based Approaches for Solving
More informationBasic Queuing Relationships
Queueing Theory Basic Queuing Relationships Resident items Waiting items Residence time Single server Utilisation System Utilisation Little s formulae are the most important equation in queuing theory
More information- 1 - intelligence. showing the layout, and products moving around on the screen during simulation
- 1 - LIST OF SYMBOLS, TERMS AND EXPRESSIONS This list of symbols, terms and expressions gives an explanation or definition of how they are used in this thesis. Most of them are defined in the references
More informationElevator Simulation and Scheduling: Automated Guided Vehicles in a Hospital
Elevator Simulation and Scheduling: Automated Guided Vehicles in a Hospital Johan M. M. van Rooij Guest Lecture Utrecht University, 31-03-2015 from x to u The speaker 2 Johan van Rooij - 2011 current:
More informationWhat is Modeling and Simulation and Software Engineering?
What is Modeling and Simulation and Software Engineering? V. Sundararajan Scientific and Engineering Computing Group Centre for Development of Advanced Computing Pune 411 007 vsundar@cdac.in Definitions
More informationJoint Optimization of Overlapping Phases in MapReduce
Joint Optimization of Overlapping Phases in MapReduce Minghong Lin, Li Zhang, Adam Wierman, Jian Tan Abstract MapReduce is a scalable parallel computing framework for big data processing. It exhibits multiple
More informationAn Autonomous Agent for Supply Chain Management
In Gedas Adomavicius and Alok Gupta, editors, Handbooks in Information Systems Series: Business Computing, Emerald Group, 2009. An Autonomous Agent for Supply Chain Management David Pardoe, Peter Stone
More informationA Comparison of General Approaches to Multiprocessor Scheduling
A Comparison of General Approaches to Multiprocessor Scheduling Jing-Chiou Liou AT&T Laboratories Middletown, NJ 0778, USA jing@jolt.mt.att.com Michael A. Palis Department of Computer Science Rutgers University
More informationCOMPARISON OF DISPATCHING RULES IN JOB-SHOP SCHEDULING PROBLEM USING SIMULATION: A CASE STUDY
ISSN 1726-4529 Int j simul model 11 (2012) 3, 129-140 Original scientific paper COMPARISON OF DISPATCHING RULES IN JOB-SHOP SCHEDULING PROBLEM USING SIMULATION: A CASE STUDY Kaban, A. K. * ; Othman, Z.
More informationSPARE PARTS INVENTORY SYSTEMS UNDER AN INCREASING FAILURE RATE DEMAND INTERVAL DISTRIBUTION
SPARE PARS INVENORY SYSEMS UNDER AN INCREASING FAILURE RAE DEMAND INERVAL DISRIBUION Safa Saidane 1, M. Zied Babai 2, M. Salah Aguir 3, Ouajdi Korbaa 4 1 National School of Computer Sciences (unisia),
More informationHybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling
Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling R.G. Babukartik 1, P. Dhavachelvan 1 1 Department of Computer Science, Pondicherry University, Pondicherry, India {r.g.babukarthik,
More informationSTRATEGIC CAPACITY PLANNING USING STOCK CONTROL MODEL
Session 6. Applications of Mathematical Methods to Logistics and Business Proceedings of the 9th International Conference Reliability and Statistics in Transportation and Communication (RelStat 09), 21
More informationIntegrating Your ERP and MES to Improve Operations
GE Intelligent Platforms Integrating Your ERP and MES to Improve Operations Advanced enterprise integration applications enable companies to leverage real-time information exchange between the business
More informationThe International Journal Of Science & Technoledge (ISSN 2321 919X) www.theijst.com
THE INTERNATIONAL JOURNAL OF SCIENCE & TECHNOLEDGE Efficient Parallel Processing on Public Cloud Servers using Load Balancing Manjunath K. C. M.Tech IV Sem, Department of CSE, SEA College of Engineering
More informationMaterial Requirements Planning. Lecturer: Stanley B. Gershwin
Material Requirements Planning Lecturer: Stanley B. Gershwin MRP Overview Primary source: Factory Physics by Hopp and Spearman. Basic idea: Once the final due date for a product is known, and the time
More information2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering
2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering Compulsory Courses IENG540 Optimization Models and Algorithms In the course important deterministic optimization
More informationThe Problem of Scheduling Technicians and Interventions in a Telecommunications Company
The Problem of Scheduling Technicians and Interventions in a Telecommunications Company Sérgio Garcia Panzo Dongala November 2008 Abstract In 2007 the challenge organized by the French Society of Operational
More informationSupervised Learning Linear Priority Dispatch Rules for Job-Shop Scheduling
Supervised Learning Linear Priority Dispatch Rules for Job-Shop Scheduling Helga Ingimundardottir and Thomas Philip Runarsson School of Engineering and Natural Sciences, University of Iceland hei2@hi.is
More informationjobs that obey the norms must ensure the load balancing qualities. Load balancing should be interpreted as releasing a balanced mix of jobs to the
Summary The term job shops is used to indicate companies that produce customer-specific components in small batches. Jobs (production orders) in a job shop are characterised by a large variety of routings
More information