A shortest route formulation of simple U-type assembly line balancing problem
|
|
- Sybil Warner
- 5 years ago
- Views:
Transcription
1 Applied Mathematical Modelling 29 (2005) A shortest route formulation of simple U-type assembly line balancing problem Hadi Gökçen a, *,Kürsßat Ağpak b, Cevriye Gencer a, Emel Kizilkaya c a Faculty of Engineering and Architecture, Department of Industrial Engineering, Gazi University, Maltepe, Ankara, Turkey b Faculty of Engineering, Department of Industrial Engineering, Gaziantep University, Gaziantep, Turkey c Faculty of Engineering, Department of Industrial Engineering, Erciyes University, Kayseri, Turkey Received 1 May 2003; received in revised form 1 October 2004; accepted 14 October 2004 Available online 13 December 2004 Abstract In this paper, a shortest route formulation of simple U-type assembly line balancing (SULB) problem is presented and illustrated on a numerical example. This model is based on the shortest route model developed in [Manage. Sci. 11 (2) (1964) 308.] for the traditional single model assembly line balancing problem. Ó 2004 Elsevier Inc. All rights reserved. Keywords: Assembly line balancing; U-type lines; Network programming 1. Introduction Traditional line balancing is the process of allocating work (task) to the workstations in such a manner that all workstations have approximately the same amount of task assigned to them. In task assignments to the workstations, precedence relations among these tasks should not be violated. The assembly line balancing (ALB) problem has been studied extensively since Since * Corresponding author. Tel.: ; fax: address: hgokcen@gazi.edu.tr (H. Gökçen) X/$ - see front matter Ó 2004 Elsevier Inc. All rights reserved. doi: /j.apm
2 374 H. Gökçen et al. / Applied Mathematical Modelling 29 (2005) that time, several techniques have been proposed for the solution of ALB problem. (See the review paper of Baybars [2]; Ghosh and Gagnon [3]; Erel and Sarin [4]). Recently, U-type layouts have been utilized in many production lines in place of the traditional straight-line configuration due to the use of just-in-time production principles. In 1994, Miltenburg and Wijngaard [5] presented a new problem derived from the traditional ALB problem where production lines are arranged as U-type lines instead of straight lines. The U-type assembly line is an attractive alternative for assembly production systems since operators become multiskilled by performing tasks located on different parts of assembly line. Moreover, since the U-type line disposition allows for more possibilities on how to assign tasks to workstations, the number of workstations needed for a U-type line layout is nevermore than the number of workstations needed for the traditional straight line. The reason for this is that in the traditional ALB problem, for a given cycle time (maximum amount of time units that can be spent at each workstation, or the time interval between two successive outputs), the set of possible assignable tasks is conformed by those tasks whose predecessors have already been assigned to workstations, whereas in the U-type line balancing problem, the set of assignable tasks is determined by all those tasks whose predecessors and successors have already been assigned [6]. Precedence diagram, traditional and U-type line balancing results are given in Fig. 1. The problem has 7 nodes (tasks). The numbers within the nodes represent tasks and the arrow (or arcs) connecting the nodes specifies the precedence relations. The numbers next to the nodes represent (a) (b) Enter Exit (c) Fig. 1. Precedence diagram (a), traditional (b) and U-type (c) line balancing results.
3 H. Gökçen et al. / Applied Mathematical Modelling 29 (2005) task performance times. When the problem was solved with a cycle time of 10, it can be seen that all tasks are performed at 5 workstations in traditional assembly line, whereas all tasks are performed at 4 workstations in U-type assembly line. As seen in Fig. 1, U-line design, workstations can include tasks located on different parts of the production line. For example the first workstation consists of tasks 1 and 7, where 1 is located at the beginning of the line while 7 is located at the end of the line. There is a small and growing literature on SULB problem. SULB problem was first modeled by Miltenburg and Wijngaard [5]. Urban [7] proposed an integer programming formulation for determining the optimal balance. Scholl and Klein [8] proposed the branch and bound procedure ULINO (U Line Optimizer) for the problem. In addition, some other studies on U-type line balancing problem can be found in Miltenburg and Sparling [9], Ohno and Nakade [10], Nakade and Ohno [11], Ohno et al. [12], Miltenburg [13], Sparling and Miltenburg [14], Ajenblit and Wainwright [6], Nakade and Ohno [15], Miltenburg [16], Miltenburg [17], Guerriero and Miltenburg [18]. Like the traditional line balancing problem, U-line balancing problem is also NP hard nature (Miltenburg and Sparling [9]). 2. Shortest route formulation First shortest route formulation of the traditional single model assembly line balancing problem is presented by Klein [19]. The network had directed arcs representing possible assignments of tasks to workstations, and each path from source to sink represented a possible line design. Then, Gutjahr and Nemhauser [1] developed an algorithm to solve this problem based on finding the shortest route in a directed network. The model was considerably superior to the model of Klein [19] in the sense that only a portion of the feasible orderings was generated [20]. The model proposed for U-type line balancing problems in this paper is based on the Gutjahr and NemhauserÕs [1] algorithm developed for the traditional ALB problems. In this proposed model, we assumed that the task performance times are known constant, precedence relations of tasks are known, parallel workstations are not allowed and no work-in process inventory buffer is allowed between the workstations. The SULB problem defined by Miltenburg and Wijngaard [5] is given as follows: Miltenburg and WijngaardÕs [5] definition follows from that given by Gutjahr and Nemhauser [1] for the traditional line balancing problem. Given set of tasks H ={ij i = 1,2,3,...,N}, a set of precedence constraints P ={(x,y)j task x must be completed before task y}, a set of task times T ={t i j i = 1,2,3,...,N}, cycle time C and a number of workstation K, find a collection of subsets of H, (S 1,S 2,...,S N ) where S k ={ij task i is done at workstation k}, that satisfy the following conditions: [ K k¼1 S k ¼ H; \ S k S j ¼ [; k6¼j ð1þ ð2þ
4 376 H. Gökçen et al. / Applied Mathematical Modelling 29 (2005) X t i 6 C; i2s k k ¼ 1; 2;...; N: ð3þ For each task y, if ðx; yþ 2P; x 2 S k ; y 2 S j ; then k 6 j; for all x; or if ðy; zþ 2P; y 2 S j ; z 2 S i ; then i 6 j; for all z: ð4þ " # KC XK X k¼1 i2s k t i is minimized: Condition 1 ensures that all tasks are assigned to a workstation. As a result of condition 2, each task is assigned only once. Condition 3 ensures that the work content of any workstation does not exceed the cycle time. Condition 4 ensures that the precedence constraints are not violated on the U-line. As a result of the objective function, the number of workstations will be minimized [5]. ð5þ 2.1. Network model The network model consists of developing a finite directed network for which the arcs represent workstations in the assembly line and the nodes correspond to possible first workstation assignments of tasks. The arc lengths are the idle times of workstations. Thus the optimization procedure is to find the shortest path in the network or to find the minimum number of arcs. Node generation, arc construction and finding the shortest path are given below in detail Generation of nodes The node generation process used in this paper is similar to the node generation process developed by Gutjahr and Nemhauser [1] for traditional single model ALB problem. The basic difference between two processes arises from the nature of the traditional and U-type line balancing problems. In the traditional line-balancing problem, tasks from a set of assignable tasks (those tasks whose predecessors have already been assigned) are selected for a workstation. In the U-type line, the set of assignable tasks is the union of the set of tasks whose predecessors have already been assigned and the set of tasks whose successors have already been assigned. Tasks are selected from this set to for a workstation [5]. In state generation, the following properties should be satisfied. (i) No state elements can be generated as duplicate. (ii) All sets generated are states. (iii) Every state is generated [1]. The node generation process can be defined as follows: The empty set is considered as the first state generated. The tasks that are available for assignments (tasks without any predecessors according to the left side of the precedence diagram, and tasks without any successors according to the right side of the precedence diagram) are placed in stage 1 and are considered marked tasks. Then all sets of task combination related to marked tasks are generated. Each set is defined as a
5 H. Gökçen et al. / Applied Mathematical Modelling 29 (2005) state. The unmarked immediate followers, F(S), (according to left side of the diagram) and predecessors (according to right side of the diagram) of a state are augmented to the current stage to construct the states of the next stage. For any state S of stage s, the unmarked immediate followers and predecessors are placed in two lists called F(S) and P(S) respectively. For each subset R F(S) and B P(S), the R [ S and B [ S are states for stage s + 1. For each state of stage s, the unmarked immediate followers and predecessors are determined and placed as marked tasks for stage s + 1. When all the tasks are marked or F(S) and P(S) are empty for the current stage, the node generation process is completed. With this node generation process, all possible feasible states can be generated. The final node in the network consists of all tasks Constructing the arcs and finding the shortest path Each state, which is generated by previous process, corresponds to the nodes in the directed network. Let G i, i =1,...,r represent the set of tasks in node i where r is the total number of nodes. G 0 is P equal to zero and G r denotes the set of all tasks in the precedence diagram. Also let T ðg i Þ¼ j2g i t j, where T(G i ) represents the total task times in G i. The paths from node 0 to node r in the network can be constructed as follows: the goal is to find the shortest path of the network. Finding the shortest path from node 0 to node r can be achieved by finding any path from node 0 to node r with the least number of arcs. In other words, a path with the least number of arcs from node 0 to node r gives the optimal solution of the problem. In constructing the network, we begin the initial node (node 0). All arcs are connected from this node. If T(G i ) 6 C, there is an arc from node 0 to node i. These nodes are called the first nodes. If G i G j and T(G j ) T(G i ) 6 C for node i among the first nodes, an arc to node j is constructed. These nodes are also called the second nodes. Network construction is repeated until node r is reached. Each directed arc (ij) from node i to node j in the network is assigned a distance of [C T(G j )+T(G i )]. This length gives the idle time of each workstation. Note that, no arc enters node 0 and no arc leaves node r. After the network construction is completed, a shortest route (or path) from node 0 to node r is determined by considering the arc lengths (or idle time of workstation). Each arc in the network corresponds to the workstation in the assembly line. If the shortest route from node 0 to node r is (0,i,j,k,r), workstation assignments can be determined as [(G r G k ), (G k G j ), (G j G i ), (G i G 0 )]. Each set gives the workstation assignments. 3. Illustrative example Precedence diagram and processing (or task) times of example U-type line balancing problem with 7 tasks were given in Fig. 1(a). The cycle time of the line was 10. The state generation process is shown in Table 1. Initially, unmarked immediate follower and predecessor tasks are considered as marked and task 1 and task 7 are placed in stage 1. The unmarked immediate followers of task 1 are tasks 2 and 3, and the immediate predecessors of task 7 are tasks 4, 5 and 6. They are placed in list F(S) and P(S) respectively. FP(S) is union of the F(S) and P(S), that is, {2,3} [ {4,5,6} = {2,3,4,5,6}. These tasks of FP(S) are placed in stage 2 as marked tasks. Task 1 is augmented to all subsets of the list F(S) that include tasks 2 and 3, and task 7 is also augmented to all subsets of the list P(S) that include tasks 4, 5 and 6, and task 1 and 7 are augmented to all subsets
6 378 H. Gökçen et al. / Applied Mathematical Modelling 29 (2005) Table 1 State generation Stage Marked tasks State no. State elements State times Unmarked immediate Successors Predecessors , , ,5,6 3 1,7 10 2,3 4,5,6 2 2,3,4,5,6 4 1, , ,2, , , , , 4, , 4, , 5, ,4,5, , 7, , 7, , 7, , 7, , 7, ,7,2, ,7,2, ,7,2, ,7,2, ,7,3, ,7,3, ,7,3, ,7,4, ,7,4, ,7,5, ,7,2,3, ,7,2,3, ,7,2,3, ,7,3,4, ,7,3,4, ,7,4,5, ,7,2,3,4, ,7,2,3,4, ,7,3,4,5, ,7,2,3,4,5,6 37 of the list F(S) and P(S) that include tasks 2,3,4,5 and 6 to form the states of stage 2. For example, at stage 1 one of the states generated contains the task 1. Its unmarked immediate followers are 2 and 3. So, in stage 2, from the state element 1, the states generated are {1,2}, {1,3} and {1,2,3}. For each state in stage 2, F(S) and P(S) lists are determined. However for all states of
7 H. Gökçen et al. / Applied Mathematical Modelling 29 (2005) Fig. 2. Resulting network of the example problem. stage 2, F(S) and P(S) lists are empty. So, procedure is terminated in stage 2. Total number of states generated for this problem is determined as 38. The network constructed with the constraint of T(G j ) T(G i ) 6 C is shown in Fig. 2. Nodes 1,2,3,4 and 7 define the first nodes, because the constraint of T(G i ) 6 C is satisfied for these nodes. From node 1,1 new node; from node 2,8 new nodes; from node 3,5 new nodes and lastly from node 4,1 new node can be constructed with G 1 G j and T(G j ) T(G 1 ) 6 C. These new nodes are called as second nodes. All the tasks in the problem are represented by node 38. This node is first obtained with 4 arcs. As seen from the Fig. 2, optimal route (or path) is determined as There are 4 arcs in the path, that is, the optimal solution has 4 workstations in the U-type assembly line. Tasks in G 38 G 31 {4,5} constitute a workstation assignment. Similarly G 31 G 15 {2,6}, G 15 G 3 {3} and G 3 G 0 {1,7} tasks are the optimal workstation assignments. The numbers in Fig. 2 correspond to the ones given in Table 1. The numbers next to the arcs in Fig. 2 represent the station idle times. Workstation assignments of this problem were demonstrated as schematic in Fig. 1(c). 4. Concluding remarks Recently, U-type layouts have been utilized in many production lines in place of the traditional straight-line configuration due to the use of just-in-time principles. The shape of U-lines improves visibility and allows the construction of stations containing tasks on both sides of the line. This arrangement, combined with cross-trained operators, provides greater flexibility in station construction than is available on a comparable straight production line. The shortest route model developed here for U-type assembly line balancing problem is a new approach and provides a different perspective for interested U-type assembly line balancing researchers. Furthermore, model can also be used as a framework to develop effective heuristic procedures to solve the simple U-type line-balancing problem.
8 380 H. Gökçen et al. / Applied Mathematical Modelling 29 (2005) Acknowledgement This research was supported in part by the State Planning Organization (DPT) of Turkey Prime Ministry under grant no. 2002K References [1] A.L. Gutjahr, G.L. Nemhauser, An algorithm for the line balancing problem, Manage. Sci. 11 (2) (1964) [2] I. Baybars, A survey of exact algorithms for the simple assembly line balancing problem, Manage. Sci. 32 (1986) [3] S. Ghosh, J. Gagnon, A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems, Int. J. Prod. Res. 27 (4) (1989) [4] E. Erel, S.C. Sarin, A survey of the assembly line balancing procedures, Prod. Plann. Control 9 (1998) [5] J. Miltenburg, J. Wijngaard, The U-line balancing problem, Manage. Sci. 40 (10) (1994) [6] D.A. Ajenblit, R.L. Wainwright, Applying genetic algorithms to the U-shaped assembly line balancing problem, IEEE World Congr. Comput. Intell. (1998) [7] T.L. Urban, Note: optimal balancing of U-shaped assembly lines, Manage. Sci. 44 (5) (1998) [8] A. Scholl, R. Klein, ULINO: optimally balancing U-shaped JIT assembly lines, Int. J. Prod. Res. 37 (4) (1999) [9] J. Miltenburg, D. Sparling, Optimal solution algorithms for the simple U-line balancing problem, Working paper. (1994). [10] K. Ohno, K. Nakade, Analysis and optimization of U-shaped production line, J. Oper. Res. Soc. Jpn. 40 (1) (1997) [11] K. Nakade, K. Ohno, Stochastic analysis of a U-shaped production line with multiple workers, Comput. Indus. Eng. 33 (3 4) (1997) [12] K. Ohno, K. Nakade, J.G. Shantikumar, Bounds and approximations for cycle times of a U-shaped production line, Oper. Res. Lett. 21 (1997) [13] J. Miltenburg, Balancing U-lines in a multiple U-line facility, Eur. J. Oper. Res. 109 (1998) [14] D. Sparling, J. Miltenburg, The mixed-model U-line balancing problem, Int. J. Prod. Res. 36 (2) (1998) [15] K. Nakade, K. Ohno, An optimal worker allocation for a U-shaped production line, Int. J. Prod. Econom (1999) [16] J. Miltenburg, One-piece flow manufacturing on U-shaped production lines: a tutorial, IIE Trans. 33 (2001) [17] J. Miltenburg, U-shaped production lines: a review of theory and practice, Int. J. Prod. Econom. 70 (2001) [18] F. Guerriero, J. Miltenburg, The stochastic U-line balancing problem, Naval Res. Logis. 50 (2003) [19] M. Klein, On assembly line balancing, Oper. Res. 11 (1963) [20] E. Erel, H. Gokcen, Shortest-route formulation of mixed-model assembly line balancing problem, Eur. J. Oper. Res. 116 (1999)
Shortest-route formulation of mixed-model assembly line balancing problem
European Journal of Operational Research 116 (1999) 194±204 Theory and Methodology Shortest-route formulation of mixed-model assembly line balancing problem Erdal Erel a, *, Hadi Gokcen b a Faculty of
More informationFigure 1: Example of a precedence network
Journal of the Operations Research Society of Japan 2008, Vol. 1, No. 1, 1-1 HEURISTIC FOR BALANCING U-SHAPED ASSEMBLY LINES WITH PARALLEL STATIONS Sihua Chen Aristocrat Technologies, Inc. Louis Plebani
More informationA New Heuristic Approach to Solving U-shape Assembly Line Balancing Problems Type-1
A New Heuristic Approach to Solving U-shape Assembly Line Balancing Problems Type-1 M. Fathi, M. J. Alvarez, V. Rodríguez Abstract Assembly line balancing is a very important issue in mass production systems
More informationProceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Solving Assembly Line Balancing Problem in the State of Multiple- Alternative
More informationJust in Time Strategy in Balancing of Two-Sided Assembly Line Structure
Just in Time Strategy in Balancing of Two-Sided Assembly Line Structure W. Grzechca Abstract In this paper a problem of two-sided assembly line balancing problem and Just in Time strategy is considered.
More informationAssembly line balancing to minimize balancing loss and system loss
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 informationA branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs
European Journal of Operational Research 174 (2006) 492 508 Production, Manufacturing and Logistics A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing
More informationMathematical Modelling of Mixed-Model Assembly Line Balancing Problem with Resources
Home earch Collections Journals About Contact us My IOPscience Mathematical Modelling of Mixed-Model Assembly Line Balancing Problem with Resources Constraints This content has been downloaded from IOPscience.
More informationDISSERTATION METAHEURISTIC APPROACH TO SOLVING U-SHAPED ASSEMBLY LINE BALANCING PROBLEMS USING A RULE-BASE CODED GENETIC ALGORITHM.
DISSERTATION METAHEURISTIC APPROACH TO SOLVING U-SHAPED ASSEMBLY LINE BALANCING PROBLEMS USING A RULE-BASE CODED GENETIC ALGORITHM Submitted by Ulises Martinez-Contreras Department of Mechanical Engineering
More informationASALBP: the Alternative Subgraphs Assembly Line Balancing Problem. Liliana Capacho Betancourt, Rafael Pastor Moreno
ASALBP: the Alternative Subgraphs Assembly Line Balancing Problem Liliana Capacho Betancourt, Rafael Pastor Moreno IOC-DT-P-2005-5 Gener 2005 ASALBP: The Alternative Subgraphs Assembly Line Balancing Problem
More informationA Fuzzy Logic Approach to Assembly Line Balancing
Mathware & Soft Computing 12 (2005), 57-74 A Fuzzy Logic Approach to Assembly Line Balancing D.J. Fonseca 1, C.L. Guest 1, M. Elam 1, and C.L. Karr 2 1 Department of Industrial Engineering 2 Department
More informationBalancing, Sequencing and Determining the Number and Length of Workstations in a Mixed Model Assembly Line
Balancing, Sequencing and Determining the Number and Length of Workstations in a Mixed Model Assembly Line by Fatemeh Mohebalizadehgashti A Thesis presented to The University of Guelph In partial fulfilment
More informationDesign of Flexible Assembly Line to Minimize Equipment Cost
Design of Flexible Assembly Line to Minimize Equipment Cost Joseph Bukchin Department of Industrial Engineering Faculty of Engineering, Tel-Aviv University, Tel-Aviv 69978 ISRAEL Tel: 972-3-640794; Fax:
More informationNTIGen: a Software for Generating Nissan Based Instances for Time and Space Assembly Line Balancing
NTIGen: a Software for Generating Nissan Based Instances for Time and Space Assembly Line Balancing Chica M 1, Cordón O 2, Damas S 3, Bautista J 4 Abstract The time and space assembly line balancing problem
More informationBalancing U-Shaped Assembly Lines with Resource Dependent Task Times: A Simulated Annealing Approach
Balancing U-Shaped Assembly Lines with Resource Dependent Task Times: A Simulated Annealing Approach Sachin Jayaswal a,, Prashant Agarwal 1 a Indian Institute of Management, Vastrapur, Ahmedabad, Gujarat
More informationIntroduction. Masoud Rabbani 1 Mona Montazeri
J Ind Eng Int (206) 2:485 497 DOI 0.007/s40092-06-058-6 ORIGINAL RESEARCH A multi-objective genetic algorithm for a mixed-model assembly U-line balancing type-i problem considering human-related issues,
More informationPROVIDING A MATHEMATICAL METHOD OF ZERO &ONE TO SELECT THESEQUENCE OF MODELS INMULTI- MODEL PRODUCTION LINE BALANCING PROBLEM.
PROVIDING A MATHEMATICAL METHOD OF ZERO &ONE TO SELECT THESEQUENCE OF MODELS INMULTI- MODEL PRODUCTION LINE BALANCING PROBLEM. Seyedarash shariat 1, Ahmad Khodabakhshi 2, Seyedsaeidsadat Mazloumi 3, Mostafa
More informationSimulated Annealing Algorithm for U- Shaped Line Balancing Problem
International Journal of Advanced Research in Science and Technology journal homepage: www.ijarst.com ISSN 2319 1783 (Print) ISSN 2320 1126 (Online) Simulated Annealing Algorithm for U- Shaped Line Balancing
More informationA Transfer Line Balancing Problem by Heuristic Methods: Industrial Case Studies. Olga Guschinskaya Alexandre Dolgui
Decision Making in Manufacturing and Services Vol. 2 2008 No. 1 2 pp. 33 46 A Transfer Line Balancing Problem by Heuristic Methods: Industrial Case Studies Olga Guschinskaya Alexandre Dolgui Abstract.
More informationA mixed integer program for cyclic scheduling of flexible flow lines
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 62, No. 1, 2014 DOI: 10.2478/bpasts-2014-0014 A mixed integer program for cyclic scheduling of flexible flow lines T. SAWIK AGH University
More informationComparison of Single Model and Multi-Model Assembly Line Balancing Solutions
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 8 (2017), pp. 1829-1850 Research India Publications http://www.ripublication.com Comparison of Single Model
More informationModelling transfer line design problem via a set partitioning problem
Optim Lett (2012) 6:915 926 DOI 10.1007/s11590-011-0317-z ORIGINAL PAPER Modelling transfer line design problem via a set partitioning problem Pavel Borisovsky Alexandre Dolgui Sergey Kovalev Received:
More informationJob-shop scheduling with limited capacity buffers
Job-shop scheduling with limited capacity buffers Peter Brucker, Silvia Heitmann University of Osnabrück, Department of Mathematics/Informatics Albrechtstr. 28, D-49069 Osnabrück, Germany {peter,sheitman}@mathematik.uni-osnabrueck.de
More informationTwo-Stage orders sequencing system for mixedmodel
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Two-Stage orders sequencing system for mixedmodel assembly Recent citations - Damian Krenczyk et al To cite this article: M Zemczak
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationSOLVING PARALLEL MIXED-MODEL ASSEMBLY LINE BALANCING PROBLEM UNDER UNCERTAINTY CONSIDERING RESOURCE-CONSTRAINED PROJECT SCHEDULING TECHNIQUES
SOLVING PARALLEL MIXED-MODEL ASSEMBLY LINE BALANCING PROBLEM UNDER UNCERTAINTY CONSIDERING RESOURCE-CONSTRAINED PROJECT SCHEDULING TECHNIQUES 1 MASOUD RABBANI, 2 FARAHNAZ ALIPOUR, 3 MAHDI MOBINI 1,2,3
More informationAvailable online at ScienceDirect. Procedia CIRP 44 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia CIRP 44 (2016 ) 102 107 6th CIRP Conference on Assembly Technologies and Systems (CATS) Worker skills and equipment optimization in assembly
More informationOverview. H. R. Alvarez A., Ph. D.
Network Modeling Overview Networks arise in numerous settings: transportation, electrical, and communication networks, for example. Network representations also are widely used for problems in such diverse
More informationA heuristic approach to find the global optimum of function
Journal of Computational and Applied Mathematics 209 (2007) 160 166 www.elsevier.com/locate/cam A heuristic approach to find the global optimum of function M. Duran Toksarı Engineering Faculty, Industrial
More informationOptimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm
Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm N. Shahsavari Pour Department of Industrial Engineering, Science and Research Branch, Islamic Azad University,
More informationSearching for Shortest Path in A Large, Sparse Graph under Memory Limitation: A Successive Mixed Bidirectional Search Method
Searching for Shortest Path in A Large, Sparse Graph under Memory Limitation: A Successive Mixed Bidirectional Search Method Xugang Ye Department of Applied Mathematics and Statistics, The Johns Hopkins
More informationMSEC PLANT LAYOUT OPTIMIZATION CONSIDERING THE EFFECT OF MAINTENANCE
Proceedings of Proceedings of the 211 ASME International Manufacturing Science and Engineering Conference MSEC211 June 13-17, 211, Corvallis, Oregon, USA MSEC211-233 PLANT LAYOUT OPTIMIZATION CONSIDERING
More informationUNIT 2 LINEAR PROGRAMMING PROBLEMS
UNIT 2 LINEAR PROGRAMMING PROBLEMS Structure 2.1 Introduction Objectives 2.2 Linear Programming Problem (LPP) 2.3 Mathematical Formulation of LPP 2.4 Graphical Solution of Linear Programming Problems 2.5
More informationNew algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems
Journal of Scientific & Industrial Research ESWARAMURTHY: NEW ALGORITHM FOR ANALYZING PERFORMANCE OF NEIGHBORHOOD STRATEGIES 579 Vol. 67, August 2008, pp. 579-588 New algorithm for analyzing performance
More informationGenetic algorithms for job shop scheduling problems with alternative routings
Downloaded By: [Pusan National University Library] At: 07:0 8 March 008 International Journal of Production Research, Vol., No. 0, May 008, 9 70 Genetic algorithms for job shop scheduling problems with
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 160 (2012) 505 512 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam 1-planarity of complete multipartite
More informationIJSER
International Journal of Scientific & Engineering Research, Volume 4, Issue 1, October-213 1399 EFFECT OF KANBANS IN THE PERFORMANCE OF, AND E G.G Sastry 1, Dr. Mukesh Saxena 2, Dr. Rajnish Garg 3 Abstract
More informationAN AHP APPROACH FOR COMPARAING MULTI CRITERIA ASSEMBLY LINE BALANCING HEURISTICS
International Journal of Industrial Engineering & Technology (IJIET) ISSN 2277-4769 Vol.2, Issue 3 Dec 2012 15-26 TJPRC Pvt. Ltd., AN AHP APPROACH FOR COMPARAING MULTI CRITERIA ASSEMBLY LINE BALANCING
More informationSearch Algorithms. IE 496 Lecture 17
Search Algorithms IE 496 Lecture 17 Reading for This Lecture Primary Horowitz and Sahni, Chapter 8 Basic Search Algorithms Search Algorithms Search algorithms are fundamental techniques applied to solve
More informationBalancing a U-Shaped Assembly Line by applying Nested Partitions Method
Balancing a U-Shaped Assembly Line by applying Nested Partitions Method BY Nikhil V. Bhagwat A Creative Component submitted to the graduate faculty in partial fulfillment of the requirements for the degree
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationOptimal Manufacturing Scheduling for Dependent Details Processing
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY VOLUME 30 JULY 0 ISSN 1307- Optimal Manufacturing Scheduling for Dependent Details Processing Ivan C. Mustakerov, and Daniela I. Borissova
More informationSurrogate Gradient Algorithm for Lagrangian Relaxation 1,2
Surrogate Gradient Algorithm for Lagrangian Relaxation 1,2 X. Zhao 3, P. B. Luh 4, and J. Wang 5 Communicated by W.B. Gong and D. D. Yao 1 This paper is dedicated to Professor Yu-Chi Ho for his 65th birthday.
More informationEulerian disjoint paths problem in grid graphs is NP-complete
Discrete Applied Mathematics 143 (2004) 336 341 Notes Eulerian disjoint paths problem in grid graphs is NP-complete Daniel Marx www.elsevier.com/locate/dam Department of Computer Science and Information
More informationMETHODOLOGY FOR SOLVING TWO-SIDED ASSEMBLY LINE BALANCING IN SPREADSHEET
METHODOLOGY FOR SOLVING TWO-SIDED ASSEMBLY LINE BALANCING IN SPREADSHEET Salleh Ahmad Bareduan and Salem Abdulsalam Elteriki Department of Manufacturing and Industrial Engineering, University Tun Hussein
More informationII. Linear Programming
II. Linear Programming A Quick Example Suppose we own and manage a small manufacturing facility that produced television sets. - What would be our organization s immediate goal? - On what would our relative
More informationAn algorithmic method to extend TOPSIS for decision-making problems with interval data
Applied Mathematics and Computation 175 (2006) 1375 1384 www.elsevier.com/locate/amc An algorithmic method to extend TOPSIS for decision-making problems with interval data G.R. Jahanshahloo, F. Hosseinzadeh
More informationLEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK
VOL., NO., JUNE 08 ISSN 896608 00608 Asian Research Publishing Network (ARPN). All rights reserved. LEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK Y. J. Lee Department
More informationOptimization of Process Plant Layout Using a Quadratic Assignment Problem Model
Optimization of Process Plant Layout Using a Quadratic Assignment Problem Model Sérgio. Franceira, Sheila S. de Almeida, Reginaldo Guirardello 1 UICAMP, School of Chemical Engineering, 1 guira@feq.unicamp.br
More informationA COMPUTATIONAL STUDY OF THE CONSTRAINED MAXIMUM FLOW PROBLEM
COMPUTTIONL STUDY OF THE CONSTRINED MXIMUM FLOW PROBLEM Cenk Çalışkan, Woodbury School of Business, Utah Valley University, 800 W. University Pkwy, Orem, UT 84058, (801) 863-6487, cenk.caliskan@uvu.edu
More informationTHE APPLICATION OF SIMULATED ANNEALING TO THE MIXED MODEL, DETERMINISTIC ASSEMBLY LINE BALANCING PROBLEM
THE APPLICATION OF SIMULATED ANNEALING TO THE MIXED MODEL, DETERMINISTIC ASSEMBLY LINE BALANCING PROBLEM by Sherry L. Edwards Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State
More informationRearrangement of DNA fragments: a branch-and-cut algorithm Abstract. In this paper we consider a problem that arises in the process of reconstruction
Rearrangement of DNA fragments: a branch-and-cut algorithm 1 C. E. Ferreira 1 C. C. de Souza 2 Y. Wakabayashi 1 1 Instituto de Mat. e Estatstica 2 Instituto de Computac~ao Universidade de S~ao Paulo e-mail:
More informationMaterial handling and Transportation in Logistics. Paolo Detti Dipartimento di Ingegneria dell Informazione e Scienze Matematiche Università di Siena
Material handling and Transportation in Logistics Paolo Detti Dipartimento di Ingegneria dell Informazione e Scienze Matematiche Università di Siena Introduction to Graph Theory Graph Theory As Mathematical
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationColumn Generation Method for an Agent Scheduling Problem
Column Generation Method for an Agent Scheduling Problem Balázs Dezső Alpár Jüttner Péter Kovács Dept. of Algorithms and Their Applications, and Dept. of Operations Research Eötvös Loránd University, Budapest,
More informationThe Service-Time Restricted Capacitated Arc Routing Problem
The Service-Time Restricted Capacitated Arc Routing Problem Lise Lystlund Aarhus University Århus, Denmark Sanne Wøhlk CORAL - Centre of OR Applications in Logistics, Aarhus School of Business, Aarhus
More informationArc-Flow Model for the Two-Dimensional Cutting Stock Problem
Arc-Flow Model for the Two-Dimensional Cutting Stock Problem Rita Macedo Cláudio Alves J. M. Valério de Carvalho Centro de Investigação Algoritmi, Universidade do Minho Escola de Engenharia, Universidade
More informationForward-backward Improvement for Genetic Algorithm Based Optimization of Resource Constrained Scheduling Problem
2017 2nd International Conference on Advances in Management Engineering and Information Technology (AMEIT 2017) ISBN: 978-1-60595-457-8 Forward-backward Improvement for Genetic Algorithm Based Optimization
More informationScience & Technology (HUST), Wuhan, Hubei, PR China. Available online: 01 Mar 2012
This article was downloaded by: [Texas A&M University Libraries and your student fees] On: 28 March 2012, At: 20:52 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number:
More informationAn Improved Upper Bound for the Sum-free Subset Constant
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.8.3 An Improved Upper Bound for the Sum-free Subset Constant Mark Lewko Department of Mathematics University of Texas at Austin
More informationSet Cover with Almost Consecutive Ones Property
Set Cover with Almost Consecutive Ones Property 2004; Mecke, Wagner Entry author: Michael Dom INDEX TERMS: Covering Set problem, data reduction rules, enumerative algorithm. SYNONYMS: Hitting Set PROBLEM
More informationTabu search and genetic algorithms: a comparative study between pure and hybrid agents in an A-teams approach
Tabu search and genetic algorithms: a comparative study between pure and hybrid agents in an A-teams approach Carlos A. S. Passos (CenPRA) carlos.passos@cenpra.gov.br Daniel M. Aquino (UNICAMP, PIBIC/CNPq)
More informationImplementing Changes in the Balancing of Assembly Lines: a Sequencing Problem Addressed by MILP
Implementing Changes in the Balancing of Assembly Lines: a Sequencing Problem Addressed by MILP Celso Gustavo Stall Sikora Federal University of Technology - Paraná (UTFPR) Graduate Program in Electrical
More informationIntroduction to Mathematical Programming IE406. Lecture 16. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 16 Dr. Ted Ralphs IE406 Lecture 16 1 Reading for This Lecture Bertsimas 7.1-7.3 IE406 Lecture 16 2 Network Flow Problems Networks are used to model
More informationA Level-wise Priority Based Task Scheduling for Heterogeneous Systems
International Journal of Information and Education Technology, Vol., No. 5, December A Level-wise Priority Based Task Scheduling for Heterogeneous Systems R. Eswari and S. Nickolas, Member IACSIT Abstract
More informationand KEYWORDS an Assembly of production line usually occurred in problems pp Assembly Lines, is fixed and thereby it assembly
International Journal of Industrial Engineering & Production Research March 2015, Volume 26, Number 2 pp. 105-117 pissn: 2008-4889 http:/ //IJIEPR.iust.ac.ir/ A Bi-Objective Approach for Design of an Assembly
More informationMulti-objective assembly line balancing via a modified ant colony optimization technique
International Journal of Production Research, Vol. 44, No. 1, 1 January 2006, 27 42 Multi-objective assembly line balancing via a modified ant colony optimization technique P. R. MCMULLEN*y and P. TARASEWICHz
More informationA NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
TWMS J. App. Eng. Math. V.7, N.1, 2017, pp. 101-109 A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM F. NURIYEVA 1, G. KIZILATES 2, Abstract. The Multiple Traveling Salesman Problem (mtsp)
More informationHandling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization
Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization Richa Agnihotri #1, Dr. Shikha Agrawal #1, Dr. Rajeev Pandey #1 # Department of Computer Science Engineering, UIT,
More informationObstacle-Aware Longest-Path Routing with Parallel MILP Solvers
, October 20-22, 2010, San Francisco, USA Obstacle-Aware Longest-Path Routing with Parallel MILP Solvers I-Lun Tseng, Member, IAENG, Huan-Wen Chen, and Che-I Lee Abstract Longest-path routing problems,
More informationLocal Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks*
Proceedings of the 2000 IEEE International Conference on Robotics & Automation San Francisco, CA April 2000 Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between
More informationTwo models of the capacitated vehicle routing problem
Croatian Operational Research Review 463 CRORR 8(2017), 463 469 Two models of the capacitated vehicle routing problem Zuzana Borčinová 1, 1 Faculty of Management Science and Informatics, University of
More informationModeling the Component Pickup and Placement Sequencing Problem with Nozzle Assignment in a Chip Mounting Machine
Modeling the Component Pickup and Placement Sequencing Problem with Nozzle Assignment in a Chip Mounting Machine Hiroaki Konishi, Hidenori Ohta and Mario Nakamori Department of Information and Computer
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Introduction and Motivation Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Organizational Stuff Lectures: Tuesday 11:00 12:30 in room SR015 Cover
More informationAssembly system facility design
IIE Transactions (2006) 38, 53 65 Copyright C IIE ISSN: 0740-817X print / 1545-8830 online DOI: 10.1080/07408170500208370 Assembly system facility design YOSSI BUKCHIN 1, RUSSELL D. MELLER 2, and QI LIU
More informationA Multi-Objective Genetic Algorithm for Solving Assembly Line Balancing Problem
Int J Adv Manuf Technol (2000) 16:341 352 2000 Springer-Verlag London Limited A Multi-Objective Genetic Algorithm for Solving Assembly Line Balancing Problem S. G. Ponnambalam 1, P. Aravindan 2 and G.
More informationOptimization Problems Under One-sided (max, min)-linear Equality Constraints
WDS'12 Proceedings of Contributed Papers, Part I, 13 19, 2012. ISBN 978-80-7378-224-5 MATFYZPRESS Optimization Problems Under One-sided (max, min)-linear Equality Constraints M. Gad Charles University,
More informationNP-completeness of generalized multi-skolem sequences
Discrete Applied Mathematics 155 (2007) 2061 2068 www.elsevier.com/locate/dam NP-completeness of generalized multi-skolem sequences Gustav Nordh 1 Department of Computer and Information Science, Linköpings
More informationDETERMINISTIC OPERATIONS RESEARCH
DETERMINISTIC OPERATIONS RESEARCH Models and Methods in Optimization Linear DAVID J. RADER, JR. Rose-Hulman Institute of Technology Department of Mathematics Terre Haute, IN WILEY A JOHN WILEY & SONS,
More informationRobust time-varying shortest path with arbitrary waiting time at vertices
Croatian Operational Research Review 525 CRORR 8(2017), 525 56 Robust time-varying shortest path with arbitrary waiting time at vertices Gholamhassan Shirdel 1, and Hassan Rezapour 1 1 Department of Mathematics,
More informationA Memetic Algorithm for Parallel Machine Scheduling
A Memetic Algorithm for Parallel Machine Scheduling Serafettin Alpay Eskişehir Osmangazi University, Industrial Engineering Department, Eskisehir, Turkiye Abstract - This paper focuses on the problem of
More informationarxiv: v2 [cs.dm] 28 Dec 2010
Multiple-source multiple-sink maximum flow in planar graphs Yahav Nussbaum arxiv:1012.4767v2 [cs.dm] 28 Dec 2010 Abstract In this paper we show an O(n 3/2 log 2 n) time algorithm for finding a maximum
More informationInstituto Nacional de Pesquisas Espaciais - INPE/LAC Av. dos Astronautas, 1758 Jd. da Granja. CEP São José dos Campos S.P.
XXXIV THE MINIMIZATION OF TOOL SWITCHES PROBLEM AS A NETWORK FLOW PROBLEM WITH SIDE CONSTRAINTS Horacio Hideki Yanasse Instituto Nacional de Pesquisas Espaciais - INPE/LAC Av. dos Astronautas, 1758 Jd.
More informationVNS-based heuristic with an exponential neighborhood for the server load balancing problem
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 47 (2015) 53 60 www.elsevier.com/locate/endm VNS-based heuristic with an exponential neighborhood for the server load
More informationMOST attention in the literature of network codes has
3862 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 8, AUGUST 2010 Efficient Network Code Design for Cyclic Networks Elona Erez, Member, IEEE, and Meir Feder, Fellow, IEEE Abstract This paper introduces
More informationMathematics for Decision Making: An Introduction. Lecture 18
Mathematics for Decision Making: An Introduction Lecture 18 Matthias Köppe UC Davis, Mathematics March 5, 2009 18 1 Augmenting Circuit Algorithm for Min Cost Flow Augmenting Circuit Algorithm, Kantoróvich
More informationComputational Integer Programming. Lecture 12: Branch and Cut. Dr. Ted Ralphs
Computational Integer Programming Lecture 12: Branch and Cut Dr. Ted Ralphs Computational MILP Lecture 12 1 Reading for This Lecture Wolsey Section 9.6 Nemhauser and Wolsey Section II.6 Martin Computational
More informationAn Integrated Design Algorithm for Detailed Layouts Based on the Contour Distance
An Integrated Design Algorithm for Detailed Layouts Based on the Contour Distance Jae-Gon Kim and Marc Goetschalckx School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta,
More informationAN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING
International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH
More informationMASS Modified Assignment Algorithm in Facilities Layout Planning
International Journal of Tomography & Statistics (IJTS), June-July 2005, Vol. 3, No. JJ05, 19-29 ISSN 0972-9976; Copyright 2005 IJTS, ISDER MASS Modified Assignment Algorithm in Facilities Layout Planning
More informationMethods and Models for Combinatorial Optimization Exact methods for the Traveling Salesman Problem
Methods and Models for Combinatorial Optimization Exact methods for the Traveling Salesman Problem L. De Giovanni M. Di Summa The Traveling Salesman Problem (TSP) is an optimization problem on a directed
More informationUSING COMPUTER SIMULATION METHOD TO IMPROVE THROUGHPUT OF PRODUCTION SYSTEMS BY BUFFERS AND WORKERS ALLOCATION
Volume6 Number4 December2015 pp.60 69 DOI: 10.1515/mper-2015-0037 USING COMPUTER SIMULATION METHOD TO IMPROVE THROUGHPUT OF PRODUCTION SYSTEMS BY BUFFERS AND WORKERS ALLOCATION SławomirKłos 1,PeterTrebuna
More informationA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
Journal of Optimization in Industrial Engineering 20 (2016) 9-18 A Multi-Objective article Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers arviz Fattahi a, *,
More informationA Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology
A Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology Carlos A. S. OLIVEIRA CAO Lab, Dept. of ISE, University of Florida Gainesville, FL 32611, USA David PAOLINI
More informationOn the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem
On the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem George Geranis, Konstantinos Paparrizos, Angelo Sifaleras Department of Applied
More informationAn objective function to address production sequencing with minimal tooling replacements
International Journal of Production Research, Vol. 44, No. 12, 15 June 2006, 2465 2478 An objective function to address production sequencing with minimal tooling replacements P. R. MCMULLEN* Babcock Graduate
More informationA comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
DePaul University From the SelectedWorks of Nezih Altay 2008 A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand Li-Lian Gao, Hofstra University
More informationof optimization problems. In this chapter, it is explained that what network design
CHAPTER 2 Network Design Network design is one of the most important and most frequently encountered classes of optimization problems. In this chapter, it is explained that what network design is? The
More informationA Deterministic Dynamic Programming Approach for Optimization Problem with Quadratic Objective Function and Linear Constraints
A Deterministic Dynamic Programming Approach for Optimization Problem with Quadratic Objective Function and Linear Constraints S. Kavitha, Nirmala P. Ratchagar International Science Index, Mathematical
More informationA NEW SIMPLEX TYPE ALGORITHM FOR THE MINIMUM COST NETWORK FLOW PROBLEM
A NEW SIMPLEX TYPE ALGORITHM FOR THE MINIMUM COST NETWORK FLOW PROBLEM KARAGIANNIS PANAGIOTIS PAPARRIZOS KONSTANTINOS SAMARAS NIKOLAOS SIFALERAS ANGELO * Department of Applied Informatics, University of
More information