# Analysis of the job shop system with transport and setup times in deadlock-free operating conditions

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Archives of Control Sciences Volume 22(LVIII), 2012 No. 4, pages Analysis of the job shop system with transport and setup times in deadlock-free operating conditions JOLANTA KRYSTEK and MAREK KOZIK This paper presents a generalized job-shop problem taking into consideration transport time between workstations and setups machines in deadlock-free operating conditions. The automated transportation system, employing a number of automated guided vehicles is considered. The completion time of all jobs was applied as the optimization criterion. The created computational application was used to solve this problem in which chosen priority algorithms (FIFO, LIFO, LPT, SPT, EDD and LWR) were implemented. Various criteria were used to assess the quality of created schedules. Numerical results of the comparative research were presented for various criteria and rules of the priority. Key words: job shop, production schedule, transport, setup time, dispatch rules, deadlock 1. Introduction Job-shop problem is commonly considered a particularly difficult issue of combinatorial optimization. Because of very big practical significance, the problem with purpose criterion which is the completion time of all tasks has been thoroughly analyzed by many researchers and many accurate as well as approximate algorithms have been developed. Job shop problem can be summarized as follows: a collection of jobs and collection of machines are given. Each job has to be processed by a number of machines in a given order and there is no recirculation. Each job is a series of operations (tasks) which have to be performed in a sequence, without interruptions, by a machine assigned for each operation (task) within a determined amount of time. For each task execution time is specified, which is usually part of the time needed to prepare a workstation to perform a given task, and the time to restore it to its original state. It also often includes transport time to the generated object position. At any moment the machine can be performing up to one operation. The objective is to minimize the makespan C max. This problem consists of establishing a schedule (assignment of consecutive tasks to proper machines within a The authors are with Department of Automatic Control, Silesian University of Technology, Gliwice, Poland. s: This work was partly supported by the BK-214/Rau-1/2011. Preliminary version was presented on conference KKAPD Received

2 418 J. KRYSTEK, M. KOZIK determined amount of time) using a chosen priority rule. The problem described above belongs to problem class which are strongly NP-hard and is one of the classic problems of combinatorial optimization. In classical scheduling problems, decisions on technological tasks and transport tasks are often taken independently or problems are limited only to the technological tasks. This simplification causes the quality of production schedule to be unsatisfactory. In industrial production processes, in many cases, we often encounter situation in which setup time significantly exceeds processing time. Also the number of transport resources is limited which may cause system deadlock. 2. Formulation of the job shop problem with transport and setups Job shop problem is one of the most classical scheduling problems [2]. This problem is formulated as follows. Given are m machines M 1, M 2,..., M m and r tasks J 1, J 2,..., J r. The job J j consists of n j operations O 1 j, O 2 j,...,o n j j. It is convenient that the following operations for all tasks should be numbered k = 1,...,N, where N = n j=1 n j. Each operation k has the duration of the p k > 0 and the machine M(k), where the operation is provided. The operation must be carried out on the machine M(k) without the expropriation. We also assume that for two successive operations k = O i j and s(k) = O i+1, j, from the same task, the following condition is true: M(k) M(s(k)). (1) Let S k be the time of the initiation of operation k, then C k time, described by (2), is the end time of an operation k, and (S k ) sets out a schedule. C k = S k + p k (2) S k + p k S h (3) S h + p h S k. (4) Schedule (S k ) is executable if for any two consecutive operations k and s(k), from the same task, condition (2) is satisfied and if for any two operations k and h such that M(k) = M(h) condition (3) or (4) is satisfied. The aim is to find the following schedule that has minimal length of the ordering (called makespan) C max = maxc k for k = 1,...,N, where N = n j=1 n j. (5) Consideration of inter-machine transport and machine setups significantly increases the complexity of calculation algorithms. Quantity of transport resources (e.g. AGV - Automated Guided Vehicles) is most often limited, which considerably affects the final alignment. This is because the tasks are not always performed immediately one after

3 ANALYSIS OF THE JOB SHOP SYSTEM WITH TRANSPORT AND SETUP TIMES IN DEADLOCK-FREE OPERATING CONDITIONS 419 another. Time of transport between the machines is usually greater than zero and may cause occurrences of "gaps" in the final alignment. Transport operation usually consists of [5]: choosing transport resource and assigning it to specified transport operation, picking a pallet with detail from initial machine buffer, transporting the pallet between the machines in a specified time, placing the pallet with detail in initial buffer of consecutive production machine in accordance with the applied technological order. Transport times between specified resources result, among others, from the distance between the specific resources. In the situation where the number of transport machines (trucks, robots or other transport machines) is much smaller than the number of tasks (in extreme case equal to one), occurrence of the so called "transport conflicts" is possible. These conflicts occur in individual production phases when the number of tasks that require transport is higher than the number of available transport resources [5]. In the classic problem of job shop, setup did not occur openly or it was assumed that setup times equal zero. Setup is the process of changing equipment machines in the exercise task. The most general case assumes that setup time depends on the machine and on the order of tasks that are being performed. Setup times can be different for each type of operation which will be performed by the machine. This implicates the necessity to introduce setup times between individual machine tooling, which in consequence allows very precise establishment of production schedule. It is possible that machine setup time for a given job from task A to other job to task B can be different than time required for setup of machine "the other way around". 3. Implemented priority rules Because of NP-hardness of the considered problem, priority algorithms were used to solve it. They are single-phase algorithms, which characterize in high speed of generating production schedule, but unfortunately sometimes at the cost of quality of obtained solutions. Six rules of priority-based assignment of jobs for job-shop system were chosen for implementation [6]: 1. FIFO (First In First Out) - the job which will be first in line for the machine will be done first, 2. LIFO ( Last In - First Out) - the job which will be last in line for the machine will be done first,

4 420 J. KRYSTEK, M. KOZIK 3. SPT (Shortest Processing Time) - jobs are assigned to machines in accordance with non-decreasing processing times, 4. LPT (Longest Processing Time) - jobs are assigned to machines in accordance with decreasing processing times, 5. LWR (Least Work Remaining) - jobs are assigned to machines in accordance with the increasing sums of processing times for tasks remaining to be completed within the jobs, 6. EDD (Earliest Due Date) - jobs are assigned to machines in accordance with nondecreasing required earliest times for jobs completion. In each algorithm, the jobs are put in order according to established priority rule. Next, from list formed in such manner, the tasks are assigned to machines in the moments of their release from the previous task. Deciding upon the sequence of production jobs performance is one of the alignment problems. Such decisions are made during running assignment of jobs to machines which will perform them. Each decision regarding choice of job (from the collection awaiting to be planned to perform) regardless of the applied criterion, is giving that job a priority. Planning of stands workloads (scheduling) consists exclusively of more or less conscious successive prioritizing of jobs. According to exclusion principle, job queues create before the machines and it must be decided which job should be performed first. 4. Simulation experiments Example 1 For production system consisting of 4 production resources (M1 M4), 5 jobs in which maximum number of tasks is 4 and possessing three transport resources, the input data is presented in Tab. 1. Setup time are fixed and equals 10 time units. Table 4. Input data for example 1. Job Routes / (processing time) (p i j ) Release date (r i j ) Due date (d j ) 1 M1/(10) M2/(20) M3/(25) M2/(25) M1/(20) M5/(10) M4/(15) M2/(10) M4/(10) M1/(15) M3/(10) M4/(20) M3/(10) M5/(15) Figures 1 6 show the production schedules depending on the chosen priority rule.

5 ANALYSIS OF THE JOB SHOP SYSTEM WITH TRANSPORT AND SETUP TIMES IN DEADLOCK-FREE OPERATING CONDITIONS 421 Figure 1. Machines work schedule for the FIFO rule. Figure 2. Machines work schedule for the LIFO rule. Figure 3. Machines work schedule for the SPT rule. Figure 4. Machines work schedule for the LPT rule.

6 422 J. KRYSTEK, M. KOZIK Figure 5. Machines work schedule for the LWR rule. Figure 6. Machines work schedule for the EDD rule. Table 5. Results. Dispatch rules FIFO LIFO SPT LPT LWR EDD C max Completion time of all jobs depending on used dispatch rules are depicted in Tab. 2. Example 2 Production system consists of 4 machines (data given in Tab. 3, diagram in Fig. 7). In this system, 4 different jobs have to be executed, whereas not all tasks of individual jobs will be performed by all machines. Number of tasks within a job does not exceed 4 which implicates that maximum route length equals 4. In the described production system, 1 transport resource is available. Times of transport between the machines are fixed and equal to 10 time units. The purpose of the example is to present a situation in which a system deadlock occurred. The tasks were aligned in accordance with FIFO rule (transport and setup times were not considered). The result of the alignment is presented in Fig. 8. It can be observed that tasks 1.1 and 2.1 were completed in the same moment and must be transported to opposite workstations. This subsystem (two resources M 1, M 2 and

7 ANALYSIS OF THE JOB SHOP SYSTEM WITH TRANSPORT AND SETUP TIMES IN DEADLOCK-FREE OPERATING CONDITIONS 423 Table 6. Input data for example 2. Job Routes / (processing time) Release date (p i j ) (r i j ) 1 M1/(10) M2/(20) M3/(35) M2/(10) M1/(20) M5/(30) M4/(15) 0 3 M2/(10) M4/(10) M1/(15) M3/(10) M4/(20) - 30 Figure 7. Production system diagram. Figure 8. Machine work schedule with occurring deadlock. AGV) is presented in Fig. 9. Both resources demand access to the vehicle at the same time t = 0. Because of the AGV available for this route will be called by both resources simultaneously, therefore a conflict situation will occur system deadlock. In the described example, the problem of deadlock occurrence may be easily solved by applying priority rule. Assume that the transport time between the resources equals

8 424 J. KRYSTEK, M. KOZIK Figure 9. Production system diagram. to 10 time units. If this rule is accounted for the lowest resource number, the production schedule would be as presented in Fig. 10 and 11. Figure 10. Production system diagram. Figure 11. Machines work schedule without deadlock. By modifying the above example with machines setup time M 1 and M 2 for the jobs Z 1 and Z 2 (25 unit), with the assumption that setup of the machine takes place after delivering the job by a transport resource, the schedule is as shown in Fig. 12. Figure 12. Machine work schedule accounting for machines setup.

9 ANALYSIS OF THE JOB SHOP SYSTEM WITH TRANSPORT AND SETUP TIMES IN DEADLOCK-FREE OPERATING CONDITIONS Conclusions In conclusion one can highlight, that in order to guarantee a deadlock-free operation, one of the following strategies can be applied: 1. deadlock protection there are two possibilities for deadlock protection: all resources necessary to complete a given process may be assigned to this process before proceeding to its execution, optionally: establishing an order in which requests for specific resources must occur, 2. deadlock avoidance - system is checked, whether its status after execution of the processes is deadlock-free, 3. locating and eliminating deadlocks - system is periodically controlled in order to find out, whether a deadlock occurs. References [1] Z. BANASZAK and L. JAMPOLSKI: Computer Aided Modeling of the Flexible Production Systems. WNT, Warszawa, 1991, (in Polish). [2] P. BRUCKER: The Job-Shop Problem: Old and New Challenges. In Proc. of the 3rd Multidisciplinary Int. Conf. on Scheduling: Theory and Applications (MISTA), Paris, France, (2007), [3] D. KRENCZYK and A. DOBRZA NSKA-DANIKIEWICZ: The deadlock protection method used in the productions systems. J. of Materials Processing Technology, (2005), [4] J. KRYSTEK and M. KOZIK: Analysis of the job shop system with transport and setup times. Automatyka AGH, 13(2), Krakow, (2009) , (in Polish). [5] C. SMUTNICKI and A. TY NSKI: Simultaneous machine scheduling and AGV route planning in the FMS. Proc. of the 11th IEEE Int. Conf. on Methods and Models in Automation and Robotics. (2005), [6] S. PANWALKAR and W. ISKANDER: A Survey of Scheduling Rules. Operations Research, 25(1), (1977),

### SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES

SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES Al-Naimi Assistant Professor Industrial Engineering Branch Department of Production Engineering and Metallurgy University of Technology Baghdad - Iraq dr.mahmoudalnaimi@uotechnology.edu.iq

### Single Machine Scheduling with Interfering Job Sets

Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 009) 0- August 009, Dublin, Ireland MISTA 009 Single Machine Scheduling with Interfering Job Sets Ketan Khowala,

### Design and Operational Analysis of Tandem AGV Systems

Proceedings of the 2008 Industrial Engineering Research Conference J. Fowler and S. Mason. eds. Design and Operational Analysis of Tandem AGV Systems Sijie Liu, Tarek Y. ELMekkawy, Sherif A. Fahmy Department

### Workload balancing in identical parallel machine scheduling using a mathematical programming method

International Journal of Computational Intelligence Systems, Vol. 7, Supplement 1 (2014), 58-67 Workload balancing in identical parallel machine scheduling using a mathematical programming method Yassine

### DEADLOCK AVOIDANCE AND RE-ROUTING OF AUTOMATED GUIDED VEHICLES (AGVS) IN FLEXIBLE MANUFACTURING SYSTEMS (FMS)

DEADLOCK AVOIDANCE AND RE-ROUTING OF AUTOMATED GUIDED VEHICLES (AGVS) IN FLEXIBLE MANUFACTURING SYSTEMS (FMS) MD. Saddam Hussain 1, B. Satish Kumar 2, Dr. G.Janardhana Raju 3 Email: 1 Saddam.mohd321@gmail.com,

### SINGLE MACHINE SEQUENCING. ISE480 Sequencing and Scheduling Fall semestre

SINGLE MACHINE SEQUENCING 2011 2012 Fall semestre INTRODUCTION The pure sequencing problem is a specialized scheduling problem in which an ordering of the jobs completely determines a schedule. Moreover,

### Job Batching and Scheduling for Parallel Non- Identical Machines via MILP and Petri Nets

Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Job Batching and Scheduling for Parallel Non- Identical Machines via MILP and

### ISE480 Sequencing and Scheduling

ISE480 Sequencing and Scheduling INTRODUCTION ISE480 Sequencing and Scheduling 2012 2013 Spring term What is Scheduling About? Planning (deciding what to do) and scheduling (setting an order and time for

### Introduction to LEKIN

Introduction to LEKIN Gareth Beddoe 1 Introduction to LEKIN What is LEKIN? Machine Environments Methods Employed Graphical User Interface Setting up the Environment 2 Examples Single Machine Environment

### 1. For s, a, initialize Q ( s,

Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS

### Designing an Effective Scheduling Scheme Considering Multi-level BOM in Hybrid Job Shop

Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Designing an Effective Scheduling Scheme Considering Multi-level BOM

### COMBINE: A decision support system for real time traffic control

COMBINE: A decision support system for real time traffic control D. de Vries Holland Railconsult, The Netherlands Abstract This paper addresses the need for and benefits of advanced real-time traffic management

### Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 24 Sequencing and Scheduling - Assumptions, Objectives and Shop

Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department

### UNIT III GROUP TECHNOLOGY AND FMS

UNIT III GROUP TECHNOLOGY AND FMS GROUP TECHNOLOGY Group technology is a manufacturing technique and philosophy to increase production efficiency by exploiting the underlying sameness of component shape,

### AUTOMATED GUIDED VEHICLES (AGV) IN PRODUCTION ENTERPRISES

AUTOMATED GUIDED VEHICLES (AGV) IN PRODUCTION ENTERPRISES Lucjan Kurzak Faculty of Civil Engineering Czestochowa University of Technology, Poland E-mail: lumar@interia.pl tel/fax +48 34 3250936 Abstract

### SEQUENCING & SCHEDULING

SEQUENCING & SCHEDULING November 14, 2010 1 Introduction Sequencing is the process of scheduling jobs on machines in such a way so as to minimize the overall time, cost and resource usage thereby maximizing

### THE IMPACT OF THE AVAILABILITY OF RESOURCES, THE ALLOCATION OF BUFFERS AND NUMBER OF WORKERS ON THE EFFECTIVENESS OF AN ASSEMBLY MANUFACTURING SYSTEM

Volume8 Number3 September2017 pp.40 49 DOI: 10.1515/mper-2017-0027 THE IMPACT OF THE AVAILABILITY OF RESOURCES, THE ALLOCATION OF BUFFERS AND NUMBER OF WORKERS ON THE EFFECTIVENESS OF AN ASSEMBLY MANUFACTURING

### SIMULATION SYSTEMS SUPPORTING LEAN MANUFACTURING METHODS IMPLEMENTATION

S E L E C T E D E N G I N E E R I N G P R O B L E M S N U M B E R 4 I N S T I T U T E O F E N G I N E E R I N G P R O C E S S E S A U T O M A T I O N A N D I N T E G R A T E D M A N U F A C T U R I N G

### COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO

COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO Bathrinath S. 1, Saravanasankar S. 1 and Ponnambalam SG. 2 1 Department of Mechanical Engineering, Kalasalingam

### Minimizing Mean Tardiness in a Buffer-Constrained Dynamic Flowshop - A Comparative Study

015-0610 Minimizing Mean Tardiness in a Buffer-Constrained Dynamic Flowshop - A Comparative Study Ahmed El-Bouri Department of Operations Management and Business Statistics College of Commerce and Economics

### Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion

Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion Ajay Kumar Agarwal Assistant Professor, Mechanical Engineering Department RIMT, Chidana, Sonipat, Haryana,

### PLANNING AND CONTROL FOR JOB SHOP PRODUCTION 11.1 INTRODUCTION Objectives

UNIT 11 Objectives PLANNING AND CONTROL FOR JOB SHOP PRODUCTION After completion of this unit, you should be able to: understand the nature of job production appreciate the variety of problems that may

### CHAPTER 1 INTRODUCTION

1 CHAPTER 1 INTRODUCTION 1.1 MANUFACTURING SYSTEM Manufacturing, a branch of industry, is the application of tools and processes for the transformation of raw materials into finished products. The manufacturing

### A Sequencing Heuristic to Minimize Weighted Flowtime in the Open Shop

A Sequencing Heuristic to Minimize Weighted Flowtime in the Open Shop Eric A. Siy Department of Industrial Engineering email : eric.siy@dlsu.edu.ph Abstract: The open shop is a job shop with no precedence

### APPLIED A NEW METHOD FOR MULTI-MODE PROJECT SCHEDULING

project, project scheduling, resource-constrained project scheduling, project-driven manufacturing, multi-mode, heuristic, branch and bound scheme, make-to-order Iwona PISZ Zbigniew BANASZAK APPLIED A

### A LONG - TERM CONTRACTS PORTFOLIO MANAGEMENT CONFERENCE THE EUROPEAN ELECTRICITY MARKET SEPTEMBER 20-22, 2004, LODZ, POLAND

A LONG - TERM CONTRACTS PORTFOLIO MANAGEMENT CONFERENCE THE EUROPEAN ELECTRICITY MARKET SEPTEMBER 20-22, 2004, LODZ, POLAND Tomasz SAŁATA EuroCIM Warsaw (Poland) Jarosław PROTASIEWICZ EuroCIM Warsaw (Poland)

### A neural reinforcement learning approach to learn local dispatching policies in production scheduling

A neural reinforcement learning approach to learn local dispatching policies in production scheduling Simone Riedmiller Institut fur Werkzeugmaschinen und Betriebstechnik (wbk) University of Karlsruhe

### Evaluation of Value and Time Based Priority Rules in a Push System

Evaluation of Value and Time Based Priority Rules in a Push System Dr. V. Arumugam * and Abdel Monem Murtadi ** * Associate Professor, Business and Advanced Technology Center, Universiti Teknologi Malaysia,

### Comp 204: Computer Systems and Their Implementation. Lecture 10: Process Scheduling

Comp 204: Computer Systems and Their Implementation Lecture 10: Process Scheduling 1 Today Deadlock Wait-for graphs Detection and recovery Process scheduling Scheduling algorithms First-come, first-served

### We engineer your success. All over the world. General brochure. Logistics

We engineer your success. All over the world. General brochure Logistics Viscon Logistics a Storage systems a Sorting systems a Order picking systems a Product handling systems a Logistics control software

### Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA

, June 30 - July 2, 2010, London, U.K. Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA Imran Ali Chaudhry, Sultan Mahmood and Riaz

### Solving the FMS Scheduling Problem by Critical Ratio-Based Heuristics and the Genetic Algorithm

Solving the FMS Scheduling Problem by Critical Ratio-Based Heuristics and the Genetic Algorithm Tsung-Che Chiang and Li-Chen Fu Dept. of Computer Science and Information Engineering, National Taiwan University,

### Sujin Woottichaiwat. Received September 9, 2014; Accepted February 9, 2015

Research Article Efficiency Improvement of Truck Queuing System in the Freight Unloading Process Case Study of a Private Port in Songkhla Province Sujin Woottichaiwat Department of Industrial Engineering

### This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

### Process of vacuum metallisation a simulation in the taylor program

of Achievements in Materials and Manufacturing Engineering VOLUME 16 ISSUE 1-2 May-June 2006 Process of vacuum metallisation a simulation in the taylor program Division of Quality Management, Institute

### Mass Customized Large Scale Production System with Learning Curve Consideration

Mass Customized Large Scale Production System with Learning Curve Consideration KuoWei Chen and Richard Lee Storch Industrial & Systems Engineering, University of Washington, Seattle, U.S.A {kwc206,rlstorch}@uw.edu

### This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

### CHAPTER 1. Basic Concepts on Planning and Scheduling

CHAPTER 1 Basic Concepts on Planning and Scheduling Eugénio Oliveira Scheduling, FEUP/PRODEI /MIEIC 1 Planning and Scheduling: Processes of Decision Making regarding the and ordering of activities as well

### LOGISTICAL ASPECTS OF THE SOFTWARE TESTING PROCESS

LOGISTICAL ASPECTS OF THE SOFTWARE TESTING PROCESS Kazimierz Worwa* * Faculty of Cybernetics, Military University of Technology, Warsaw, 00-908, Poland, Email: kazimierz.worwa@wat.edu.pl Abstract The purpose

### Statistical Evaluation of the Usability of Decision-Oriented Graphical Interfaces in Scheduling Applications

Statistical Evaluation of the Usability of Decision-Oriented Graphical Interfaces in Scheduling Applications Anna Prenzel, Georg Ringwelski Hochschule Zittau/Görlitz Fakultät Elektrotechnik und Informatik

### Optimizing Inplant Supply Chain in Steel Plants by Integrating Lean Manufacturing and Theory of Constrains through Dynamic Simulation

Optimizing Inplant Supply Chain in Steel Plants by Integrating Lean Manufacturing and Theory of Constrains through Dynamic Simulation Atanu Mukherjee, President, Dastur Business and Technology Consulting,

### OPERATIONS RESEARCH Code: MB0048. Section-A

Time: 2 hours OPERATIONS RESEARCH Code: MB0048 Max.Marks:140 Section-A Answer the following 1. Which of the following is an example of a mathematical model? a. Iconic model b. Replacement model c. Analogue

### Manufacturing Systems & Single Station Manufacturing. Lecture 2

Manufacturing Systems & Single Station Manufacturing Lecture 2 Manufacturing Systems in Production Sstem System Manufacturing System Defined A collection o of integrated equipment e and human resources,

### Towards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems

Towards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems Mehdi Sliem 1(B), Nabila Salmi 1,2, and Malika Ioualalen 1 1 MOVEP Laboratory, USTHB, Algiers, Algeria {msliem,nsalmi,mioualalen}@usthb.dz

### Simulation based Performance Analysis of an End-of-Aisle Automated Storage and Retrieval System

Simulation based Performance Analysis of an End-of-Aisle Automated Storage and Retrieval System Behnam Bahrami, El-Houssaine Aghezzaf and Veronique Limère Department of Industrial Management, Ghent University,

### Real-Time and Embedded Systems (M) Lecture 4

Clock-Driven Scheduling Real-Time and Embedded Systems (M) Lecture 4 Lecture Outline Assumptions and notation for clock-driven scheduling Handling periodic jobs Static, clock-driven schedules and the cyclic

### Modeling and Analysis of Flexible Manufacturing System with FlexSim

ISSN (e): 50 005 Volume, 05 Issue, 0 October 05 International Journal of Computational Engineering Research (IJCER) Modeling and Analysis of Flexible Manufacturing System with FlexSim B.Santhosh Kumar,

### Proposal of Multi-Agent based Model for Dynamic Scheduling in Manufacturing

Proposal of Multi-Agent based Model for Dynamic Scheduling in Manufacturing ANA MADUREIRA JOAQUIM SANTOS Computer Science Department Institute of Engineering - Polytechnic of Porto GECAD Knowledge Engineering

### Lab: Response Time Analysis using FpsCalc Course: Real-Time Systems Period: Autumn 2015

Lab: Response Time Analysis using FpsCalc Course: Real-Time Systems Period: Autumn 2015 Lab Assistant name: Jakaria Abdullah email: jakaria.abdullah@it.uu.se room: 1235 Introduction The purpose of this

### SCHEDULING PROBLEMS FOR JOBS AND DIFFERENT MACHINES WITH MAKE SPAN CRITERION AND LEFT TIME ALIGNMENT

Mechanical Testing and Diagnosis ISSN 47 9635, (IV), Volume 3, pp. 3- SCHEDULING PROBLEMS FOR JOBS AND DIFFERENT MACHINES WITH MAKE SPAN CRITERION AND LEFT TIME ALIGNMENT Daniel REZMIRES*, Alfredo MONFARDINI**,

### STUDY NO 5 INTRODUCTION TO FLEXIBLE MANUFACTURING SYSTEM

STUDY NO 5 INTRODUCTION TO FLEXIBLE MANUFACTURING SYSTEM A flexible manufacturing system (FMS) is in which there is some amount of flexibility that allows the system to react in case of changes, whether

### ScienceDirect. Cloud Communication Concept for Bionic Assembly System

Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 69 ( 2014 ) 1562 1568 24th DAAAM International Symposium on Intelligent Manufacturing and Automation, 2013 Cloud Communication

### Automated Clash Resolution of Steel Rebar in RC Beam Column Joints using BIM and GA

Automated Clash Resolution of Steel Rebar in RC Beam Column Joints using BIM and GA M. Mangal a, Q. Wang a and J.C.P. Cheng a a Department of Civil and Environmental Engineering, The Hong Kong University

### EFFECT OF ACTIVITY SCHEDULINGS AND INVENTORY CONTROL: AN EXPERIMENTAL INVESTIGATION FOR PC ASSEMBLY

282 Journal of the Chinese Institute of Industrial Engineers, Vol. 20 No. 3, pp. 282-294 (2003) EFFECT OF ACTIVITY SCHEDULINGS AND INVENTORY CONTROL: AN EXPERIMENTAL INVESTIGATION FOR PC ASSEMBLY Abhyuday

### ENGG4420 CHAPTER 4 LECTURE 3 GENERALIZED TASK SCHEDULER

CHAPTER 4 By Radu Muresan University of Guelph Page 1 ENGG4420 CHAPTER 4 LECTURE 3 November 14 12 9:44 AM GENERALIZED TASK SCHEDULER In practical applications we need to be able to schedule a mixture of

### ARCHIVES OF CIVIL ENGINEERING, LIX, 3, 2013

DOI: 10.2478/ace-2013-0017 ARCHIVES OF CIVIL ENGINEERING, LIX, 3, 2013 IMPACT OF BASELINE TERMS ON THE COURSE OF CRITICAL PATHS AND TIME BUFFERS IN THE MODIFIED GOLDRATT S METHOD M. POŁOŃSKI 1, K. PRUSZYŃSKI

### INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH.

INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH. Dec 2014 DATE: 20.12.2014 Max. Marks: 100 TIME: 2.00 p.m to 5.00 p.m. Duration: 03

### Simulation of construction processes considering spatial constraints of crane operations

icccbe 2010 Nottingham University Press Proceedings of the International Conference on Computing in Civil and Building Engineering W Tizani (Editor) Simulation of construction processes considering spatial

### 3. Scheduling issues. Common approaches /2. Common approaches /1. Common approaches / /17 UniPD / T. Vardanega 06/03/2017

Common approaches /2 3. Scheduling issues Weighted round-robin scheduling With basic round-robin All ready jobs are placed in a FIFO queue The job at head of queue is allowed to execute for one time slice

### Priority-Driven Scheduling of Periodic Tasks. Why Focus on Uniprocessor Scheduling?

Priority-Driven Scheduling of Periodic asks Priority-driven vs. clock-driven scheduling: clock-driven: cyclic schedule executive processor tasks a priori! priority-driven: priority queue processor tasks

### Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations

Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 54006 Thessaloniki, Greece karatza@csd.auth.gr Abstract

### Utilization vs. Throughput: Bottleneck Detection in AGV Systems

Utilization vs. Throughput: Bottleneck Detection in AGV Systems Christoph Roser Masaru Nakano Minoru Tanaka Toyota Central Research and Development Laboratories Nagakute, Aichi 480-1192, JAPAN ABSTRACT

### New tool for aiding warehouse design process. Presented by: Claudia Chackelson, Ander Errasti y Javier Santos

New tool for aiding warehouse design process Presented by: Claudia Chackelson, Ander Errasti y Javier Santos Outline Introduction validation validation Introduction Warehouses play a key role in supply

### Chapter 3 Managing the Information Systems Project

Princess Noura University Computer Science and Information Faculty Information Systems Department IS321 Chapter 3 Managing the Information Systems Project Learning Objectives Discuss skills required to

### Increasing Throughput Using Automation. Jon Ranstrom Principal Engineer Navis

Increasing Throughput Using Automation Jon Ranstrom Principal Engineer Navis Agenda Introduction Automation Solution Q & A Solutions Across the Logistics Operation Marine Distribution Rail Industrie Retai

### AGV Path Planning and Obstacle Avoidance Using Dijkstra s Algorithm

AGV Path Planning and Obstacle Avoidance Using Dijkstra s Algorithm 1, Er. Atique Shaikh, 2, Prof. Atul Dhale 1, (Department of Automobile Engg, Mumbai University, MHSSCOE, Mumbai - 400008. 2, (Associate

Proceedings of the 202 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 202 Multi-Period Cell Loading in Cellular Manufacturing Systems Gökhan Eğilmez

### THE OPTIMAL SEQUENCE OF PRODUCTION ORDERS, TAKING INTO ACCOUNT THE COST OF DELAYS

Volume7 Number2 June2016 pp.21 28 DOI: 10.1515/mper-2016-0013 THE OPTIMAL SEQUENCE OF PRODUCTION ORDERS, TAKING INTO ACCOUNT THE COST OF DELAYS RobertDylewski 1,AndrzejJardzioch 2,IreneKrebs 3 1 UniversityofZielonaGóra,FacultyofMathematics,ComputerScienceandEconometrics,Poland

### Process Selection and Design Dr. Richard Jerz

Process Selection and Design Dr. Richard Jerz 1 Learning Objectives Explain the strategic importance of process selection. Explain the influence that process selection has on an organization. Explore process

### Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study

Robotics and Computer-Integrated Manufacturing ] (]]]]) ]]] ]]] www.elsevier.com/locate/rcim Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study V. Vinod

### A Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing

International Journal of Industrial Engineering, 15(1), 73-82, 2008. A Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing Muh-Cherng Wu and Ting-Uao Hung Department of Industrial Engineering

### Optimization of Re-handling and Load/Unload Operations in Small Container Terminal Operated by Reachstackers

ptimization of Re-handling and Load/Unload perations in Small Container Terminal perated by Reachstackers ADAM GALUSZKA 1, KRZYSZTF DANIEC 2 Institute of Automatic Control Silesian University of Technology

### LOWER BOUNDS FOR THE SCHEDULING PROBLEM WITH UNCERTAIN DEMANDS

Int. J. Appl. Math. Comput. Sci., 2006, Vol. 16, No. 2, 263 269 LOWER BOUNDS FOR THE SCHEDULING PROBLEM WITH UNCERTAIN DEMANDS DJAMEL BERKOUNE,,KHALED MESGHOUNI BESOA RABENASOLO LAGIS, UMR CNRS 8146, Ecole

### Code No: RR Set No. 1

Code No: RR410310 Set No. 1 IV B.Tech I Semester Supplimentary Examinations, February 2008 AUTOMATION IN MANUFACTURE ( Common to Mechanical Engineering and Production Engineering) Time: 3 hours Max Marks:

### XXVI. OPTIMIZATION OF SKUS' LOCATIONS IN WAREHOUSE

XXVI. OPTIMIZATION OF SKUS' LOCATIONS IN WAREHOUSE David Sourek University of Pardubice, Jan Perner Transport Faculty Vaclav Cempirek University of Pardubice, Jan Perner Transport Faculty Abstract Many

### Application of the method of data reconciliation for minimizing uncertainty of the weight function in the multicriteria optimization model

archives of thermodynamics Vol. 36(2015), No. 1, 83 92 DOI: 10.1515/aoter-2015-0006 Application of the method of data reconciliation for minimizing uncertainty of the weight function in the multicriteria

### SIMULATION BASED JOB SHOP PRODUCTION ANALYSER

SIMULATION BASED JOB SHOP PRODUCTION ANALYSER Wolfgang Kuehn Dep. of Electrical, Information and Media Engineering University of Wuppertal D 42119 Wuppertal wkuehn@uni-wuppertal.de Clemens Draschba SIPOC

### Chapter Outline. Study Objective 1 - Describe the Steps in Determining Inventory Quantities

Chapter 6 Financial Notes and BE Chapter Outline Study Objective 1 - Describe the Steps in Determining Inventory Quantities In a merchandising company, inventory consists of many different items. These

### Discrete Event Simulation

Chapter 2 Discrete Event Simulation The majority of modern computer simulation tools (simulators) implement a paradigm, called discrete-event simulation (DES). This paradigm is so general and powerful

### INTERNATIONAL JOURNAL OF APPLIED ENGINEERING RESEARCH, DINDIGUL Volume 2, No 3, 2011

Minimization of Total Weighted Tardiness and Makespan for SDST Flow Shop Scheduling using Genetic Algorithm Kumar A. 1 *, Dhingra A. K. 1 1Department of Mechanical Engineering, University Institute of

### INTELLIGENT PRODUCTION SCHEDULING A CASE STUDY

International Journal of Mechanical Engineering and Technology (IJMET) Volume 8, Issue 6, June 2017, pp. 283 298, Article ID: IJMET_08_06_029 Available online at http://www.iaeme.com/ijmet/issues.asp?jtype=ijmet&vtype=8&itype=6

### Practical Application of Training tasks Based on Flexible Manufacturing System Hongmei Fan

3rd International Conference on Science and Social Research (ICSSR 2014) Practical Application of Training tasks Based on Flexible Manufacturing System Hongmei Fan School of Automation, Nanjing Institute

### Hamdy A. Taha, OPERATIONS RESEARCH, AN INTRODUCTION, 5 th edition, Maxwell Macmillan International, 1992

Reference books: Anderson, Sweeney, and Williams, AN INTRODUCTION TO MANAGEMENT SCIENCE, QUANTITATIVE APPROACHES TO DECISION MAKING, 7 th edition, West Publishing Company,1994 Hamdy A. Taha, OPERATIONS

CHAPTER 4 By Radu Muresan University of Guelph Page 1 ENGG4420 CHAPTER 4 LECTURE 4 November 12 09 2:49 PM GENERALIZED TASK SCHEDULER In practical applications we need to be able to schedule a mixture of

### Lecture Note #4: Task Scheduling (1) EECS 571 Principles of Real-Time Embedded Systems. Kang G. Shin EECS Department University of Michigan

Lecture Note #4: Task Scheduling (1) EECS 571 Principles of Real-Time Embedded Systems Kang G. Shin EECS Department University of Michigan 1 Reading Assignment Liu and Layland s paper Chapter 3 of the

### The Realities of Modern Manufacturing

Ch 1 Introduction Sections: 1. Production Systems 2. Automation in Production Systems 3. Manual Labor in Production Systems 4. Automation Principles and Strategies 5. Organization of the Book The Realities

### MODELING AND CONTROL OF THE AGV SYSTEM IN AN AUTOMATED CONTAINER TERMINAL

MODELING AND CONTROL OF THE AGV SYSTEM IN AN AUTOMATED CONTAINER TERMINAL Qin Li, Jan Tijmen Udding, and Alexander Yu. Pogromsky Mechanical Engineering Department Eindhoven University of Technology Eindhoven,

### The role of the production scheduling system in rescheduling

IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS The role of the production scheduling system in rescheduling To cite this article: K Kalinowski et al 2015 IOP Conf. Ser.: Mater.

### CLS. Carton live storage. EASY-TO-VIEW PRODUCT PRESENTATION

CLS Carton live storage EASY-TO-VIEW PRODUCT PRESENTATION www.bito.com STORING PRODUCTS HAS NEVER BEEN MORE EFFICIENT 2 APPLICATION REDUCING TRAVEL TIME ACCELERATES WORKFLOWS IDEALLY SUITED FOR + + achieving

### Ch 15 Manual Assembly Lines

Ch 15 Manual Assembly Lines Sections: 1. Fundamentals of Manual Assembly Lines 2. Analysis of Single Model Assembly Lines 3. Line Balancing Algorithms 4. Mixed Model Assembly Lines 5. Workstation Considerations

### An Agent-Based Scheduling Framework for Flexible Manufacturing Systems

An Agent-Based Scheduling Framework for Flexible Manufacturing Systems Iman Badr International Science Index, Industrial and Manufacturing Engineering waset.org/publication/2311 Abstract The concept of

### Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search

Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search Andrew J. Henry Dissertation submitted to the faculty of the Virginia Polytechnic Institute and State

### Citation for published version (APA): Land, M. J. (2004). Workload control in job shops, grasping the tap s.n.

University of Groningen Workload control in job shops, grasping the tap Land, Martin IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please

### PRODUCTION PLANNING PROBLEMS IN CELLULAR MANUFACTURE

PRODUCTION PLANNING PROBLEMS IN CELLULAR MANUFACTURE J. Riezebos Assistant professor Production systems design, University of Groningen, P.O.Box 800, 9700 AV Groningen, The Netherlands, email J.Riezebos@Bdk.Rug.NL,

### Application of queuing theory in construction industry

Application of queuing theory in construction industry Vjacheslav Usmanov 1 *, Čeněk Jarský 1 1 Department of Construction Technology, FCE, CTU Prague, Czech Republic * Corresponding author (usmanov@seznam.cz)

### I. Mustakerov, D. Borissova - Software System for NVD Design by INTRODUCTION

I. Mustakerov, D. Borissova - Software System for NVD Design by... 1. INTRODUCTION There exist many application areas which can benefit of the mathematical modelling and the technological development of

### MATERIAL HANDLING IN FLEXIBLE MANUFACTURING SYSTEM Mr. Neeraj Nirmal 1, Mr. Neeraj Dahiya 2

International Journal of Computer Science and Management Studies, Vol. 11, Issue 02, Aug 2011 40 MATERIAL HANDLING IN FLEXIBLE MANUFACTURING SYSTEM Mr. Neeraj Nirmal 1, Mr. Neeraj Dahiya 2 1 M.Tech. Scholar,