An Optimal Balancing Of Multiple Assembly Line For A Batch Production Unit
|
|
- Leo Waters
- 7 years ago
- Views:
Transcription
1 An Optimal Balancing Of Multiple Assembly Line For A Batch Production Unit M. Mohan Prasad Assistant Professor, Department of Mechanical Engineering, P. A. College of Engineering and Technology, Pollachi , Coimbatore - Dt, Tamil Nadu, India. profmmohanprasad@gmail.com K. Ganesan Associate Professor, Department of Mechanical Engineering, PSG College of Technology, Peelamedu, Coimbatore , Tamil Nadu, India. A B S T R A C T Higher Productivity in organizations leads to national prosperity and better standard of living for the whole community. This has motivated several workers on productivity improvement at different levels of XXXX India Pvt Ltd, Chennai. The main objective of this project is to increase the production by changing the layout of the assembly line in making of Transmit Mixer. At present 12 machines are being manufactured in a total of 2 shifts per day. Time study is carried out to identify and avoid the idle time to increase the production rate to 24 machines per day. The organization facing the problems like production time, online inventory, delay and idle time. Here our objective is to reduce the idle time, identifying the cycle time and optimal method of production. The COMSOAL (Computer Method for Sequencing Operations for Assembly Lines) and RPW (Ranked Positional Weight) algorithms have been used to get the optimal solution. This algorithm provides the better solution, thereby reducing unnecessary movements of the worker within the station. The overall cycle time got reduced when compared with the existing cycle time in order to meet the customer demand. Thus we are proposing this scientific approach to get the optimal solution for increased rate of production of the company without affecting the quality and cost. R.K.Suresh, Principal, Department of Mechanical Engineering, Ahalia School of Engineering and Technology, K E Y W O R D S Assembly line balancing; COMSOAL; RPW A R T I C L E I N F O Received May 2013 Accepted July 2013 Available online December INTRODUCTION Assembly line balancing (ALB) relates to a finite set of work elements or tasks, each having an operation processing time and a set of precedence relations, which specify the permissible orderings of the tasks. One of the problems in organizing mass production is how to group work tasks to be performed on workstations so as to achieve the desired level of performance. Line balancing is an attempt to allocate equal amounts of work to the various workstations along the line. The fundamental line balancing problem is how to assign a set of tasks to an ordered set * Corresponding Author 22
2 of workstations, such that the precedence relations are satisfied and some measure of performance is optimized. 1.1 PROBLEM STATEMENT The main objective of this project is to increase the production by changing the layout of the assembly line in making of Transmit Mixer. At present 12 machines are being manufactured in a total of 2 shifts per day. Time study is carried out to identify and avoid the idle time to increase the production rate to 24 machines per day. The organization facing the problems like production time, online inventory, delay and idle time. Here our objective is to reduce the idle time, identifying the cycle time and optimal method of production. 2. LINE BALANCING Although the product layout produce a large volume of goods in a relatively short time once the line is established there are numerous problems that arise in connection with this type of layout that do not become important in the process layout. One of the complex problems is the problem of line balancing, which may be considered the problem of balancing operations or stations in terms of equal times and times required to meet the desired rate of production. In practical cases perfect balance is achieved in straight line layouts. The problem in line balancing is minimizing the idle time on the line for all combinations of workstations subject to certain restrictions. An important restriction is the production volume that is to be produced. If the demands of the product change, then there should be a change in line balancing. Usually an assembly line is used for a variety of products, it becomes necessary to consider a fixed a fixed number of workstations. In general, there are two types of line-balancing situations, each of which involves different considerations. It is sometimes difficult in practical cases to distinguish between the two categories, but it is useful to consider the line balancing problem as Assembly-line balancing and Fabrication-line balancing: The distinction refers to the type of operations taking place on the line to be balance. The tern assembly line has gained a certain popular interpretation as it used with the reference to the automotive industry. The term fabrication line, on the other hand implies a production line made up of operations that form or change the physical or chemical characteristics of the product involved. Machining operation would fit into this classification, as would heat - treating operation. 2.1 HEURISTIC METHODS OF LINE BALANCING In this section, we described several methods for solving line balancing problems. These methods are heuristic approaches, meaning that they are based on logic and common sense rather than on a mathematical proof. None of the methods guarantees an optimal solution, but they are likely to result in good solutions which approach the true optimum. To get optimal solution we consider two different algorithms namely COMSOAL (Computer Method of Sequencing Operation for Assembly Lines) RPW(Ranked Positional Weight) 2.2 COMSOAL: This acronym stands for computer method of sequencing operation for assembly lines. The basic methodology of COMSOAL was developed by A.L Arcus, which is based on the biased 23
3 sampling. A large number of feasible solution can be generated the essential idea behind COMSOAL is the random generated of a feasible sequence. Such a sequence may be constructed by assigning a positive probability of selection to each task that will fit in the current time and then selecting one of the tasks at random. The procedure is repeated until all the tasks have been assigned. Generate a random solution satisfying all constraints, storing the number of stations it needs. Repeat this random generation process, keeping the best solution, and discarding poor ones. The second stage can be aborted if a partial solution is already worse than a previous (better) solution ALGORITHM The COMSOAL program proceeds in 6 steps as follows: STEP 1: For each task identify those tasks which immediately follow it in precedence orders. STEP 2: Place in LIST A for each task in the assembly, the total number of tasks which immediately precede it in the precedence diagram. STEP 3: From LIST A, create LIST B composed of the tasks which have zero predecessors. If no tasks remain unassigned to stations, then stop STEP 4: From LIST B, create LIST C composed of the tasks whose performance times are no greater than the available time at the station. If LIST C is empty, open a new station with the full cycle time available and go through STEP 4 again. STEP 5: Randomly select from LIST C a task for assignment to the station. STEP 6: Update the time available at the station and LIST B to reflect the time consumed and the completed predecessors at this stage. If LIST B is empty update LIST A and return to STEP 3 otherwise return to STEP RPW: It combines the strategies of largest candidate rule and Kilbridge and Wester s method. It is a rapid approximate method which has been shown to provide acceptable good solution more quickly than many alternative methods. It is capable of dealing with both precedence and zoning constraints. This is another popular heuristic approach to solving line balancing problems for assembly lines. The basic idea is to allot tasks to stations based on their priority. The priority is determined by the total time needed by the task and its successors. The logic is simple: If we have a large number of tasks from which we can choose to assign to a station, we are more likely to find a (combination) that will minimize the idle time. From the above, it follows that if we minimize idle time at each station, we should end up with the minimum number of stations ALGORITHM: The RPW program proceeds in 7 steps as follows: STEP 1: For each task identify those tasks which immediately follow it in precedence orders. 24
4 STEP 2: Place in P (j) for position of tasks. STEP 3: Create all predecessors composed of the tasks which have zero predecessors. STEP 4: From all predecessors, Create S (j) all the successors of the tasks. STEP 5: From successors, Create PW (j) by adding all the times in the Successor tasks. STEP 6: From PW (j), Create the rank list by giving the rank in descending order. STEP 7: From the rank, the stations are assigned in the ascending order of the rank. In each station specified time will be given. If the work goes beyond the specified time then the new station will be introduced for the further work and repeat STEP 7 again. 3. SCOPE OF THE PROJECT Due to implementation of batch production method, productivity depreciation and other certain problems will arise. So in order to improve our productivity we are going to implement and analysis continuous production technique by using Line Balancing method. 3.1 INPUT VARIABLES In order to determine a proper line balancing, assembly or fabrication, the following information is needed. Production Volume List of operations and their sequence Time required completing each operation as well as the elemental time value The production volume should be determined by sales or marketing group. Of course the production line output must satisfy the demand. A fixed production rate is determined with the production volume and the time period involved. The list of operations and their sequence should be established prior to considering the line-balancing problem. The time for various operations, constitute probably the most important piece of information of all in the linebalancing problem. 3.2 REQUIREMENTS Material shortage should not occur. Availability of the worker should be 100 %. The employee should work to his full potential. All the required accessories should be within the worker s reach 3.3 CONSTRAINTS USED IN ALBP Task Grouping and Task splitting Resource Dependent Task Times Incompatible Task Assignments Temporary tasks with unknown durations Work Zone (line side) related constraints Operator related constraints Ergonomic constraints Reduction of work overload Reduction of task dispersion Throughput improvement and scrap reduction Dynamic line balancing (DLB) 3.4 CYCLE TIME CALCULATION 25
5 12 Machines per shift.2 Shift per day (8 Hours per shift). Efficiency of the worker is taken as 70%. Production time = hours per shift * efficiency of worker = 8*70% = 5.6 Hours. = 336 Minutes. Production volume = number of machine per shift. Cycle time = production time / production volume = 336 /12 = 28 Minutes. 4. TIME STUDY FOR CHASSIS ASSEMBLY UNIT In this section, they are assembling the basic supporting materials of the mixer such as, fixing of Base chasses on the fixture, front and rear pedestal fixing, Engine frame fixing, welding work (tag welding). Time study table includes various activities required for finishing the particular Chassis assembly unit and time required for implementing each activity is given as follows. Table 1: Time study for Chassis assembly unit 4.1 FLOW DIAGRAM The flow diagram of above specified time study table and it represents flow of activities to be done for Chassis assembly unit. 26
6 Fig. 1: Flow diagram for Chassis assembly unit 4.2 COMSOAL APPROACH As a solution method, COMSOAL quickly generates multiple feasible solutions and uses the best solution as its final reported result. To appear on this list, activities must have met all precedence requirements and there must be enough resources available to assign to the activity. The next activity to be scheduled is randomly chosen from this availability list and a new availability list is generated. They found the COMSOAL approach to give better results for large sample sizes than other, more traditional, resource allocation heuristics. Whitehouse discusses the application of COMSOAL to resource allocation and finds the COMSOAL results at each iteration to be fairly stable even though only random sampling.is used to choose the next activity to be scheduled. As mentioned previously, since fast, inexpensive computers have become readily available, COMSOAL should be reexamined as a possible solution methodology for the constrained resource allocation problem. 27
7 Table 2: COMSOAL Algorithm used in Chasses Assembly Unit PROPOSSED LAYOUT The proposed layout of activities which are carried out in each and every station is given below. Fig. 2: Proposed Layout diagram 28
8 4.2.2 IDLE TIME CALCULATION: Number of Stations: 4 Idle Time: Station 1 : 05 Minutes Station 2 : 04 Minutes Station 3 : 01 Minutes Station 4 : 12 Minutes Total : 22 Minutes % Idle TIME = 22 Min / 4 Station * 28 Minutes = 19.6 % The best solution must have (K) number of stations, Where, K = Total time of all tasks / cycle time = 90/28 = 3.21 = 3 Therefore 3 is the Minimum Number of Station 4.3 RPW APPROACH It combines the strategies of largest candidate rule and Kilbridge and Wester s method. This is another popular heuristic approach to solving line balancing problems for assembly lines. The basic idea is to allot tasks to stations based on their priority. The priority is determined by the total time needed by the task and its successors. It combines the strategies of largest candidate rule and Kilbridge and Wester s method. From the above, it follows that if we minimize idle time at each station, we should end up with the minimum number of stations. Table 3: RPW Algorithm used in Chassis Assembly Unit 29
9 The following table shows station assigning by RPW method. Table 4: Station assigning table PROPOSED LAYOUT: The proposed layout of activities which are carried out in each and every station is given below. Fig. 3: Proposed Layout diagram IDLE TIME CALCULATION Total Idle time per cycle equals sum of station idle time Idle time For the 4 stations = = 22 min % Idle time = 22min / (4 stations)(28 min/station) = 19.64% The theoretical lower bound is sum of process times divided by the required cycle time (Tc) = 80/28 = 2.85 = 3 station Therefore 3 is the minimum number of station 5. CONCULSION AND FUTURE WORK: 30
10 Company was assembling 6 machines per shift. Now it has been increased to 12 machines per shift, this is done by high utilization of the idle time. In future number of machines getting assembled can be extended to company need. Currently products are getting assembled by manually; In future it can be achieved by using automatic robots. Thus the production is increased by changing the assemble line system which is proposed to be a continuous production system. The time study and cycle time calculations are carried out such that the production rate is increased to 24 machines per day. In order to overcome the problems of depreciation in productivity, idle time, improper working schedule and lagging of material handling equipments due to implementation of batch production system, the continuous production is proposed to be implemented. The continuous production system is implemented by using the optimal line balancing method. Algorithm provides the better solution, thereby reducing idle time, reducing unnecessary movements of worker within the station, and also the productivity improvement. REFERENCES: Journals: Arcus, A.L., COMSOAL: A Computer Method of Sequencing Operations for Assembly Lines, International Journal of Production Research, Vol. 4, No. 4, 1966 Amen, M. Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time. Int. Journal of Production Economics, vol. 69, , Anderson, E. J. and Ferris, M. C., 1993, Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem, University of Cambridge, Cambridge, England. Dr. Robert Graves, A Review of Line Balancing for Flow Lines, Perspectives on Material Handling Practice, 1992 Books: Martand Telsang, Industrial Engineering and Production Management, S. Chand and Company,
11 Samson Eilon, Elements of production planning and control, Universal Book Corpn.1984 K.C.Jain&L.N.Aggarwal, Production Planning Control and Industrial Management, Khanna Publishers, S.K. Hajra Choudhury, and A.K. Hajra Choudhury, Production Management, Media Promoters and Publishers Pvt. Ltd., N.G. Nair, Production and Operations Management, Tata McGraw Hill, S.N.Chary, Theory and Problems in Production & Operations Management, Tata McGraw Hill, Roberta S. and Bernard W. Taylor III, Operations Management, New Jersey: Prentice Hall,
Assembly Line Balancing in a Clothing Company
S. H.Eryuruk, F. Kalaoglu, *M. Baskak Textile Engineering Department, *Industrial Engineering Department, Istanbul Technical University Instanbul, Turkiye Assembly Line Balancing in a Clothing Company
More informationAssembly line balancing to minimize balancing loss and system loss. D. Roy 1 ; D. Khan 2
J. Ind. Eng. Int., 6 (11), 1-, Spring 2010 ISSN: 173-702 IAU, South Tehran Branch Assembly line balancing to minimize balancing loss and system loss D. Roy 1 ; D. han 2 1 Professor, Dep. of Business Administration,
More informationRe-balancing of Generalized Assembly Lines Searching Optimal Solutions for SALBP
Proceedings of the 2010 International Conference on Industrial Engineering and Operations Management Dhaka, Bangladesh, January 9 10, 2010 Re-balancing of Generalized Assembly Lines Searching Optimal Solutions
More informationHeuristic Approach for Assembly Line Balancing Problems 1. INTRODUCTION
International Journal of Advanced Manufacturing Systems Volume 2 G Number 1 G January-June 2011 G pp. 67-71 International Science Press I J A M S Heuristic Approach for Assembly Line Balancing Problems
More informationA Hybrid Tabu Search Method for Assembly Line Balancing
Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization, Beijing, China, September 15-17, 2007 443 A Hybrid Tabu Search Method for Assembly Line Balancing SUPAPORN
More informationA hybrid genetic algorithm approach to mixed-model assembly line balancing
Int J Adv Manuf Technol (2006) 28: 337 341 DOI 10.1007/s00170-004-2373-3 O R I G I N A L A R T I C L E A. Noorul Haq J. Jayaprakash K. Rengarajan A hybrid genetic algorithm approach to mixed-model assembly
More informationDevelopment of Resource-Driven Scheduling Model for Mass Housing Construction Projects
Development of Resource-Driven Scheduling Model for Mass Housing Construction Projects Ar. A. Cindrela Devi and K. Ananthanarayanan Abstract Resource continuity is a key issue for Mass housing construction
More informationInternational Journal of Industrial Engineering Computations
International Journal of Industrial Engineering Computations 2 (2011) 329 336 Contents lists available at GrowingScience International Journal of Industrial Engineering Computations homepage: www.growingscience.com/ijiec
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 informationAssembly Line Balancing A Review
Assembly Line Balancing A Review Vrittika Pachghare 1, R. S. Dalu 2 1 M.Tech. Student, Production Engineering, Govt. College of Engineering, Amravati, Maharashtra, India 2 Associate Professor, Mechanical
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 informationCONSTRUCTION PROJECT BUFFER MANAGEMENT IN SCHEDULING PLANNING AND CONTROL
CONSTRUCTION PROJECT BUFFER MANAGEMENT IN SCHEDULING PLANNING AND CONTROL Jan, Shu-Hui Ph.D. Student Construction Engineering & Management Program Department of Civil Engineering National Taiwan University
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 informationSupply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level
Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level Faicel Hnaien, Xavier Delorme 2, and Alexandre Dolgui 2 LIMOS,
More informationComputer Integrated Manufacturing CIM A T I L I M U N I V E R S I T Y
MFGE 404 Computer Integrated Manufacturing CIM A T I L I M U N I V E R S I T Y Manufacturing Engineering Department Lecture 1 - Introduction Dr. Saleh AMAITIK Fall 2005/2006 Production Systems Production
More informationAUTOMATIC CREATION OF SIMULATION MODELS FOR FLOW ASSEMBLY LINES
AUTOMATIC CREATION OF SIMULATION MODELS FOR FLOW ASSEMBLY LINES João Weinholtz, Rui Loureiro, Carlos Cardeira, João M. Sousa Instituto Superior Técnico, Technical University of Lisbon Dept. of Mechanical
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 informationBackward Scheduling An effective way of scheduling Warehouse activities
Backward Scheduling An effective way of scheduling Warehouse activities Traditionally, scheduling algorithms were used in capital intensive production processes where there was a need to optimize the production
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 informationProcess Cutting Heating Assembly Hrs per unit 2 3 4 Total hours available 100,000 120,000 220,000
RELEVANT TO ACCA QUALIFICATION PAPER F5 AND PERFORMANCE OBJECTIVES 12, 13 AND 14 Throughput accounting and the theory of constraints In the previous article, I told you all about The Goal, the book in
More informationSelection of Balancing Method for Manual Assembly Line of Two Stages Gearbox
Selection of Balancing Method for Manual Assembly Line of Two Stages Gearbox Riyadh Mohammed Ali Hamza *, Jassim Yousif Al-Manaa Mechanical Engineering Department, Gulf University, Bahrain dr.riyadh@gulfuniversity.net;
More informationDegree Institution University Specialization. Name and address of the Employer Period Designation
K.ANAND, M.E., (Ph.D) Assistant Professor Senior Grade, PSG College of Technology, Coimbatore 641 004. Tamil Nadu, India Mobile: 9791333205 E-mail: mechanand@gmail.com kan@pro.psgtech.ac.in 1. Academic
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 informationAdaptation of some Assembly Line Balancing Heuristics to a Mixed-Model Case
Adaptation of some Assembly Line Balancing Heuristics to a Mixed-Model Case Department of Industrial Management Ghent University MASTER THESIS 2011 / 2012 Alberto Fernández Pérez Adaptation of some Assembly
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 informationCHAPTER 1. Introduction to CAD/CAM/CAE Systems
CHAPTER 1 1.1 OVERVIEW Introduction to CAD/CAM/CAE Systems Today s industries cannot survive worldwide competition unless they introduce new products with better quality (quality, Q), at lower cost (cost,
More informationM. Sugumaran / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (3), 2011, 1001-1006
A Design of Centralized Meeting Scheduler with Distance Metrics M. Sugumaran Department of Computer Science and Engineering,Pondicherry Engineering College, Puducherry, India. Abstract Meeting scheduling
More informationFactors 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 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 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 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 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 informationPredictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization
182 IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.3, March 2010 Predictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization P.Radhakrishnan
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 informationProcess Layout Chapter 8
Process Layout Chapter 8 L L M M D D L L M M D D L L M M G G L L A A G G A A G G How Process Layout fits the Operations Management Philosophy Operations As a Competitive Weapon Operations Strategy Project
More informationQuality and Quality Control
1 Quality and Quality Control INSPECTION Inspection is the most common method of attaining standardisation, uniformity and quality of workmanship. It is the cost art of controlling the product quality
More informationMaterial Requirements Planning MRP
Material Requirements Planning MRP ENM308 Planning and Control I Spring 2013 Haluk Yapıcıoğlu, PhD Hierarchy of Decisions Forecast of Demand Aggregate Planning Master Schedule Inventory Control Operations
More informationtechnical tips and tricks
technical tips and tricks Performing critical path analysis Document author: Produced by: Andy Jessop Project Learning International Limited The tips and tricks below are taken from Project Mentor, the
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationOPTIMIZATION MODEL OF EXTERNAL RESOURCE ALLOCATION FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS
OPTIMIZATION MODEL OF EXTERNAL RESOURCE ALLOCATION FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS Kuo-Chuan Shih Shu-Shun Liu Ph.D. Student, Graduate School of Engineering Science Assistant Professor,
More informationUniversidad del Turabo MANA 705 DL Workshop Eight W8_8_3 Aggregate Planning, Material Requirement Planning, and Capacity Planning
Aggregate, Material Requirement, and Capacity Topic: Aggregate, Material Requirement, and Capacity Slide 1 Welcome to Workshop Eight presentation: Aggregate planning, material requirement planning, and
More informationA Review And Evaluations Of Shortest Path Algorithms
A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing
More informationIncreased Productivity of Tyre Manufacturing Process using Lean Methodology
INSTITUTE OF TECHNOLOGY, NIRMA UNIVERSITY, AHMEDABAD 382 481, 08-10 DECEMBER, 2011 1 Increased Productivity of Tyre Manufacturing Process using Lean Methodology Ajit Chavda, Prof. M.Y.Patil Abstract--The
More informationA Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster
, pp.11-20 http://dx.doi.org/10.14257/ ijgdc.2014.7.2.02 A Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster Kehe Wu 1, Long Chen 2, Shichao Ye 2 and Yi Li 2 1 Beijing
More informationSMART BUFFERING IN UNRELIABLE PRODUCTION LINE PERFORMANCE
SMRT BUFFERING IN UNRELIBLE PRODUCTION LINE PERFORMNCE TOM MCNMR SBRY SHBN 2 SRH HUDSON Department of Finance and Operations Rennes School of Business, France Email: tom.mcnamara@esc-rennes.fr Email: sarah.hudson@esc-rennes.fr
More informationFormulation of simple workforce skill constraints in assembly line balancing models
Ŕ periodica polytechnica Social and Management Sciences 19/1 (2011) 43 50 doi: 10.3311/pp.so.2011-1.06 web: http:// www.pp.bme.hu/ so c Periodica Polytechnica 2011 Formulation of simple workforce skill
More information108-C-215 CRITICAL PATH METHOD SCHEDULE. (Revised 03-24-10)
CRITICAL PATH METHOD SCHEDULE (Revised 03-24-10) The Standard Specifications are revised as follows: SECTION 108, BEGIN LINE 177, INSERT AS FOLLOWS: 108.04.1 Critical Path Method Schedule (a) General Requirements
More informationBEYOND THE BASICS OF MRP: IS YOUR SYSTEM DRIVING EXCESSIVE ORDER QUANTITITES? Michael D. Ford, CFPIM, CSCP, CQA, CRE Principal, TQM Works Consulting
BEYOND THE BASICS OF MRP: IS YOUR SYSTEM DRIVING EXCESSIVE ORDER QUANTITITES? Michael D. Ford, CFPIM, CSCP, CQA, CRE Principal, TQM Works Consulting INTRODUCTION MRP (Material Requirements Planning) has
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 informationA Computer Application for Scheduling in MS Project
Comput. Sci. Appl. Volume 1, Number 5, 2014, pp. 309-318 Received: July 18, 2014; Published: November 25, 2014 Computer Science and Applications www.ethanpublishing.com Anabela Tereso, André Guedes and
More informationRegular Expressions and Automata using Haskell
Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressions
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 informationProject Time Management
Project Time Management Plan Schedule Management is the process of establishing the policies, procedures, and documentation for planning, developing, managing, executing, and controlling the project schedule.
More informationAN INDUSTRIAL APPLICATION OF THE SMED METHODOLOGY AND OTHER LEAN PRODUCTION TOOLS
Integrity, Reliability and Failure of Mechanical Systems Paper Ref: 3927 AN INDUSTRIAL APPLICATION OF THE SMED METHODOLOGY AND OTHER LEAN PRODUCTION TOOLS Eric Costa 1(*), Rui Sousa 1, Sara Bragança 1,
More informationDesign and Analysis of Automobiles Manufacturing System Based on Simulation Model
Design and Analysis of Automobiles Manufacturing System Based on Simulation Model Razman Bin Mat Tahar & Ali Asghar J.Adham Faculty of Technology Management, University Malaysia Pahang, Kuantan 26300,
More informationIMPACT OF PROCESS VARIABILITY ON LEAN MANUFACTURING SYSTEMS
IMPACT OF PROCESS VARIABILITY ON LEAN MANUFACTURING SYSTEMS Mel Adams and Bernard J. Schroer Center for Automation & Robotics University of Alabama in Huntsville Huntsville, AL 35899 adamsm@email.uah.edu
More informationSUB: PLMH YEAR: IV, BRANCH: MECHANICAL ENGINEERING
SUB: PLMH YEAR: IV, BRANCH: MECHANICAL ENGINEERING Sl. UNIT-5 1 Explain the importance of material handling 2 Explain the relationship of material handling to plant layout 3 Explain importance of plant
More informationEnhancing the Scalability of Virtual Machines in Cloud
Enhancing the Scalability of Virtual Machines in Cloud Chippy.A #1, Ashok Kumar.P #2, Deepak.S #3, Ananthi.S #4 # Department of Computer Science and Engineering, SNS College of Technology Coimbatore, Tamil
More informationIntegrating Assembly Lines based on Lean Line Design Concept Ms. Surekha. S 1, Dr. R. V Praveena Gowda 2, Mr. Manoj Kulkarni 3
Integrating Assembly Lines based on Lean Line Design Concept Ms. Surekha. S 1, Dr. R. V Praveena Gowda 2, Mr. Manoj Kulkarni 3 Abstract In today s competitive business scenario manufacturing industries
More informationAPPLICATION OF KANBAN SYSTEM FOR IMPLEMENTING LEAN MANUFACTURING (A CASE STUDY)
ALICATION OF KANBAN SYSTEM FOR IMLEMENTING LEAN MANUFACTURING (A CASE STUDY) 1 B.Vijaya Ramnath, 2 C. Elanchezhian and 3 R. Kesavan Research Article Address for Correspondence 1,2 Research Scholar, 3 Asst.
More informationChapter 9 Computer Scheduling Projects should be scheduled one byte at a time
Chapter 9 Computer Scheduling Projects should be scheduled one byte at a time Computer Scheduling Critical path method (CPM) requires numerous computations to determine activity start and finish dates,
More informationGREY RELATIONAL ANALYSIS TO OPTIMIZE WELDING PARAMETERS FOR DISSIMILAR SHEETS OF MATERIAL IN RESISTANCE SPOT WELDING
International Journal of Mechanical Engineering and Technology (IJMET) Volume 6, Issue 11, Nov 2015, pp. 23-32, Article ID: IJMET_06_11_003 Available online at http://www.iaeme.com/ijmet/issues.asp?jtype=ijmet&vtype=6&itype=11
More informationChapter 11. MRP and JIT
Chapter 11 MRP and JIT (Material Resources Planning and Just In Time) 11.1. MRP Even if MRP can be applied among several production environments, it has been chosen here as a preferential tool for the
More informationProblems, Methods and Tools of Advanced Constrained Scheduling
Problems, Methods and Tools of Advanced Constrained Scheduling Victoria Shavyrina, Spider Project Team Shane Archibald, Archibald Associates Vladimir Liberzon, Spider Project Team 1. Introduction In this
More informationResearch on Clustering Analysis of Big Data Yuan Yuanming 1, 2, a, Wu Chanle 1, 2
Advanced Engineering Forum Vols. 6-7 (2012) pp 82-87 Online: 2012-09-26 (2012) Trans Tech Publications, Switzerland doi:10.4028/www.scientific.net/aef.6-7.82 Research on Clustering Analysis of Big Data
More information6. CASE EXAMPLES WITH SIMMEK. 6.1 Raufoss AS. 6.1.1 The plant and how it is operated. 6.1.2 The goals of the simulation - 1 -
- 1-6. CASE EXAMPLES WITH SIMMEK The SIMMEK tool has up to this date been used at a number of different industrial companies. It has also been applied to very different areas like modelling the transportation
More informationAPPLYING A STOCHASTIC LINEAR SCHEDULING METHOD TO PIPELINE CONSTRUCTION
APPLYING A STOCHASTIC LINEAR SCHEDULING METHOD TO PIPELINE CONSTRUCTION Fitria H. Rachmat 1, Lingguang Song 2, and Sang-Hoon Lee 2 1 Project Control Engineer, Bechtel Corporation, Houston, Texas, USA 2
More informationResearch on Task Planning Based on Activity Period in Manufacturing Grid
Research on Task Planning Based on Activity Period in Manufacturing Grid He Yu an, Yu Tao, Hu Da chao Abstract In manufacturing grid (MG), activities of the manufacturing task need to be planed after the
More informationDECISION SUPPORT SYSTEM IS A TOOL FOR MAKING BETTER DECISIONS IN THE ORGANIZATION
DECISION SUPPORT SYSTEM IS A TOOL FOR MAKING BETTER DECISIONS IN THE ORGANIZATION Abstract K P TRIPATHI Assistant Professor (MCA Programme) Bharati Vidyapeeth University Institute of Management, Kolhapur
More informationGoals of the Unit. spm - 2014 adolfo villafiorita - introduction to software project management
Project Scheduling Goals of the Unit Making the WBS into a schedule Understanding dependencies between activities Learning the Critical Path technique Learning how to level resources!2 Initiate Plan Execute
More informationInternational Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 11, November 2015 ISSN: 2321 7782 (Online) International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online
More informationOptimization of Preventive Maintenance Scheduling in Processing Plants
18 th European Symposium on Computer Aided Process Engineering ESCAPE 18 Bertrand Braunschweig and Xavier Joulia (Editors) 2008 Elsevier B.V./Ltd. All rights reserved. Optimization of Preventive Maintenance
More informationARTICLE IN PRESS. LeanThinking. journalhomepage:www.thinkinglean.com/ijlt. Redesinging an Automotive Assembly Line Through Lean Strategy
InternationalJournalofLeanThinkingVolume2,Isue2(December2011) LeanThinking journalhomepage:www.thinkinglean.com/ijlt Redesinging an Automotive Assembly Line Through Lean Strategy K. P. Paranitharan * Department
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 informationPreparing cash budgets
3 Preparing cash budgets this chapter covers... In this chapter we will examine in detail how a cash budget is prepared. This is an important part of your studies, and you will need to be able to prepare
More information4.2 Description of the Event operation Network (EON)
Integrated support system for planning and scheduling... 2003/4/24 page 39 #65 Chapter 4 The EON model 4. Overview The present thesis is focused in the development of a generic scheduling framework applicable
More informationA Simulation Model of Horseshoe Layouts
A Simulation Model of Horseshoe Layouts Rakesh Sharma Department of Management System University of Waikato New Zealand Rs8@mngt.waikato.ac.nz Prof. L R Foulds Department of Management System University
More informationHow To Develop Software
Software Engineering Prof. N.L. Sarda Computer Science & Engineering Indian Institute of Technology, Bombay Lecture-4 Overview of Phases (Part - II) We studied the problem definition phase, with which
More informationProject Time Management
Project Time Management Study Notes PMI, PMP, CAPM, PMBOK, PM Network and the PMI Registered Education Provider logo are registered marks of the Project Management Institute, Inc. Points to Note Please
More informationResource Allocation and Scheduling
90 This section is about the general overview of scheduling and allocating resources. Assigning people and machines to accomplish work (work on tasks). Resource Allocation: Time-Constrained. Assigning
More informationAdvanced Planning and Scheduling
Taylor Scheduler Welcome! Taylor Scheduler is our advanced planning and production scheduling software. Its many features allow Taylor Scheduler to be able to handle just about any manufacturing scheduling
More informationLONG INTERNATIONAL. Andrew Avalon, P.E., PSP and Curtis W. Foster
Andrew Avalon, P.E., PSP and Curtis W. Foster LONG INTERNATIONAL Long International, Inc. 5265 Skytrail Drive Littleton, Colorado 80123-1566 USA Telephone: (303) 972-2443 Fax: (303) 200-7180 www.long-intl.com
More informationA genetic algorithm for resource allocation in construction projects
Creative Construction Conference 2015 A genetic algorithm for resource allocation in construction projects Sofia Kaiafa, Athanasios P. Chassiakos* Sofia Kaiafa, Dept. of Civil Engineering, University of
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 informationEvaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware
Evaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware Mahyar Shahsavari, Zaid Al-Ars, Koen Bertels,1, Computer Engineering Group, Software & Computer Technology
More informationModule Information Production Planning and Control
Module Title Module Code Module Information Production Planning and Control EMM2517 1. MODULE SUMMARY Aims and Summary The intent of this module is to teach students the importance of manufacturing execution
More informationLinear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.
1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that
More informationOptimal Drawing Strategy for Deuces Wild Video Poker Stephen Jensen
Optimal Drawing Strategy for Deuces Wild Video Poker Stephen Jensen Abstract Video poker, an extremely popular computerized version of the traditional game of poker, offers many opportunities for mathematical
More informationEgypt Scholars Presented by Mohamed Khalifa Hassan Jan 2014
Project Management Six Session Egypt Scholars Presented by Mohamed Khalifa Hassan Jan 2014 Mohamed Khalifa, 2014 All Rights 1 7. Scheduling 2 7. Scheduling 7.1 Scheduling techniques 7.3 Critical path method
More informationCRITICAL PATH METHOD (CEE 320 VDC SEMINAR)
CRITICAL PATH METHOD (CEE 320 VDC SEMINAR) 4 February 2009 Jesse Santiago & Desirae Magallon Overview Background & History CPM Defined The CPM approach Definitions Class Exercise Background & History Developed
More informationS. Muthusundari. Research Scholar, Dept of CSE, Sathyabama University Chennai, India e-mail: nellailath@yahoo.co.in. Dr. R. M.
A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST S. Muthusundari Research Scholar,
More informationInternational Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationJose Valdez Doctoral Candidate Geomatics Program Department of Forest Sciences Colorado State University
A N E F F I C I E N T A L G O R I T H M F O R R E C O N S T R U C T I N G A N I S O T R O P I C S P R E A D C O S T S U R F A C E S A F T E R M I N I M A L C H A N G E T O U N I T C O S T S T R U C T U
More informationMECHANICAL ENGINEERING PLANT LAYOUT AND MATERIAL HANDLING UNIT I
MECHANICAL ENGINEERING PLANT LAYOUT AND MATERIAL HANDLING UNIT I 1. Which of the following is a strategic decision? [ B ] A. Facilitates location B. Plant location C. Plant layout D. Resources location
More informationA QoS-Aware Web Service Selection Based on Clustering
International Journal of Scientific and Research Publications, Volume 4, Issue 2, February 2014 1 A QoS-Aware Web Service Selection Based on Clustering R.Karthiban PG scholar, Computer Science and Engineering,
More informationA Robust Method for Solving Transcendental Equations
www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
More informationAn Overview of Knowledge Discovery Database and Data mining Techniques
An Overview of Knowledge Discovery Database and Data mining Techniques Priyadharsini.C 1, Dr. Antony Selvadoss Thanamani 2 M.Phil, Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu,
More informationTraceability System for Manufacturer Accountability
Traceability System for Manufacturer Accountability 250 Traceability System for Manufacturer Accountability Shinichi Kojima Hiroshi Nakanishi Kazuo Yoda Hiroshi Sora OVERVIEW: In recent years, regulations
More informationComputer based Scheduling Tool for Multi-product Scheduling Problems
Computer based Scheduling Tool for Multi-product Scheduling Problems Computer based Scheduling Tool for Multi-product Scheduling Problems Adirake Chainual, Tawatchai Lutuksin and Pupong Pongcharoen Department
More information