An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem

Capacho, Liliana; Pastor, Rafael; Dolgui, Alexandre; Guschinskaya, Olga

doi:10.1007/s10732-007-9063-x

Cited by 50 publications

(17 citation statements)

References 41 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The authors introduced and defined a new graph using the notion of Alternative Subgraphs. To solve this problem, an exact approach has been proposed in Scholl, Boysen, and Fliedner (2009) and heuristic approaches in Capacho, Pastor, Dolgui, and Guschinskaya (2007). It should be noted that Alternative Subgraphs graph is exclusively constituted of tasks and does not represent the possible subassemblies as does AND/OR graph used in this study.…”

Section: Assembly Line Design and Balancingmentioning

confidence: 99%

Second order conic approximation for disassembly line design with joint probabilistic constraints

Bentaha

Battaïa

Dolgui

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

a b s t r a c tA problem of profit oriented disassembly line design and balancing with possible partial disassembly and presence of hazardous parts is studied. The objective is to design a production line providing a maximal revenue with balanced workload. Task times are assumed to be random variables with known normal probability distributions. The cycle time constraints are to be jointly satisfied with at least a predetermined probability level. An AND/OR graph is used to model the precedence relationships among tasks. Several lower and upper-bounding schemes are developed using second order cone programming and convex piecewise linear approximation. To show the relevance and applicability of the proposed approach, a set of instances from the literature are solved to optimality.

show abstract

Section: Assembly Line Design and Balancingmentioning

confidence: 99%

Second order conic approximation for disassembly line design with joint probabilistic constraints

Bentaha

Battaïa

Dolgui

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…The problem outlined in the previous section is addressed in the literature as scheduling with alternative (optional) activities (tasks) or problem with alternative process plans or scheduling with alternatives (Beck and Fox 2000;Barták anď Cepek 2008;Capacho et al 2009;Čapek et al 2012b,a;Čapek 2012). To avoid any misunderstandings, let us assume that the notions activity, operation and task have the same meaning and we will prefer to use the term activity in this chapter.…”

Section: Related Workmentioning

confidence: 99%

“…The NTNA formalism is used to represent the problem structure in this chapter. Capacho et al (2009) studied an assembly line balancing problem with alternatives, where certain parts can be processed in several alternative modes and the goal is to balance the workload of the available resources. Kis (2003) presented a genetic algorithm and a tabu search for the job-shop problem with processing alternatives using a special graph to represent the problem instance.…”

Section: Related Workmentioning

confidence: 99%

Robust Optimization for the Discrete Time-Cost Tradeoff Problem with Cost Uncertainty

Hazır

Haouari

Erel

2014

Handbook on Project Management and Scheduling Vol. 2

View full text Add to dashboard Cite

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher's location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein.Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) PrefaceThis handbook is devoted to scientific approaches to the management and scheduling of projects. Due to their practical relevance, project management and scheduling have been important subjects of inquiry since the early days of Management Science and Operations Research and remain an active and vibrant field of study. The handbook is meant to provide an overview of some of the most active current areas of research. Each chapter has been written by well-recognized scholars, who have made original contributions to their topic. The handbook covers both theoretical concepts and a wide range of applications. For our general readers, we give a brief introduction to elements of project management and scheduling in the first chapter, where we also survey the contents of this book. We believe that the handbook will be a valuable and comprehensive reference to researchers and practitioners in project management and scheduling and hope that it might stimulate further research in this exciting and practically important field.Short-listing and selecting the contributions to this handbook and working with more than one hundred authors have been a challenging and rewarding experience for us. We are grateful to Günter Sch...

show abstract

“…Any other variation of the problem is included in the second group. Different works on various optimization models have recently been presented in literature to support the decision maker in designing the most efficient assembly system [8,9,11,15,[33][34][35][36][37]. U-shaped layout for ALB problems is one of the generalizations of SALB discussed in several studies in literature.…”

Section: Assembly Line Balancingmentioning

confidence: 99%

Balancing of mixed-model two-sided assembly lines with multiple U-shaped layout

Rabbani

Moghaddam

Manavizadeh

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Two-sided assembly lines are a special type of assembly lines in which tasks are assigned to workstations placed on both sides of the assembly line. This type of assembly systems are used for manufacturing systems with large-sized product such as cars, buses, and trucks. According to the principles of just-in-time production, it is deduced that there are copious benefits associated with U-shaped assembly lines in comparison with traditional straight line system. Nevertheless, implementing U-shaped layouts in two-sided assembly lines do not significantly increase the efficiency and flexibility of the workstations placed outside of the U-shaped layout. Hence, a novel multiple U-shaped layout is proposed in this study to deal with the mixed-model two-sided assembly line balancing (MTALB) problems. A mixed integer programming formulation is developed to model such manufacturing systems in which two conflicting objectives including minimizing the cycle time and minimizing the number of workstations are considered under precedence, zoning, capacity, side, and synchronism constraints. Since MTALB problems are in NP-hard class of combinatorial optimization problems, a heuristic algorithm based on genetic algorithms is developed to solve the MTALB problem. Three test-bed problems are also used to prove the usefulness and applicability of the proposed framework.

show abstract

An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem

Cited by 50 publications

References 41 publications

Second order conic approximation for disassembly line design with joint probabilistic constraints

Second order conic approximation for disassembly line design with joint probabilistic constraints

Robust Optimization for the Discrete Time-Cost Tradeoff Problem with Cost Uncertainty

Balancing of mixed-model two-sided assembly lines with multiple U-shaped layout

Contact Info

Product

Resources

About