6,975 research outputs found

    A bibliographic review of production line design and balancing under uncertainty

    Get PDF
    This bibliography reviews the solution methods developed for the design and balancing problems of production lines such as assembly and disassembly lines. The line design problem aims in determining the number of workstations along with the corresponding assignment of tasks to each workstation, while the line balancing problem seeks an assignment of tasks, to the existing workstations of the line, which ensures that the workloads are as equal as possible among the workstations. These two optimisation problems can be also integrated and treated as a multi-objective optimisation problem. This review considers both deterministic and stochastic formulations for disassembly lines and is limited to assembly line design and balancing under uncertainty. This bibliography covers more than 90 publications since 1976 for assembly and 1999 for disassembly

    An ESPC algorithm based approach to solve inventory deployment problem

    Get PDF
    Global competitiveness has enforced the hefty industries to become more customized. To compete in the market they are targeting the customers who want exotic products, and faster and reliable deliveries. Industries are exploring the option of satisfying a portion of their demand by converting strategically placed products, this helps in increasing the variability of product produced by them in short lead time. In this paper, authors have proposed a new hybrid evolutionary algorithm named Endosymbiotic-Psychoclonal (ESPC) algorithm to determine the amount and type of product to stock as a semi product in inventory. In the proposed work the ability of previously proposed Psychoclonal algorithm to exploit the search space has been increased by making antibodies and antigen more cooperative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results obtained, are compared with other evolutionary algorithms such as Genetic Algorithm (GA) and Simulated Annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained, and convergence time required to reach the optimal /near optimal value of the solution

    Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach

    Get PDF
    Integrated steel manufacturers (ISMs) have no specific product, they just produce finished product from the ore. This enhances the uncertainty prevailing in the ISM regarding the nature of the finished product and significant demand by customers. At present low cost mini-mills are giving firm competition to ISMs in terms of cost, and this has compelled the ISM industry to target customers who want exotic products and faster reliable deliveries. To meet this objective, ISMs are exploring the option of satisfying part of their demand by converting strategically placed products, this helps in increasing the variability of product produced by the ISM in a short lead time. In this paper the authors have proposed a new hybrid evolutionary algorithm named endosymbiotic-psychoclonal (ESPC) to decide what and how much to stock as a semi-product in inventory. In the proposed theory, the ability of previously proposed psychoclonal algorithms to exploit the search space has been increased by making antibodies and antigen more co-operative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results compared with other evolutionary algorithms such as genetic algorithms (GA) and simulated annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained and convergence time required to reach the optimal/near optimal value of the solution

    Design of Heat Integrated Low Temperature Distillation Systems

    Get PDF

    Research Trends and Outlooks in Assembly Line Balancing Problems

    Get PDF
    This paper presents the findings from the survey of articles published on the assembly line balancing problems (ALBPs) during 2014-2018. Before proceeding a comprehensive literature review, the ineffectiveness of the previous ALBP classification structures is discussed and a new classification scheme based on the layout configurations of assembly lines is subsequently proposed. The research trend in each layout of assembly lines is highlighted through the graphical presentations. The challenges in the ALBPs are also pinpointed as a technical guideline for future research works

    Scheduling commercial advertisements for television

    Get PDF
    The problem of scheduling the commercial advertisements in the television industry is investigated. Each advertiser client demands that the multiple airings of the same brand advertisement should be as spaced as possible over a given time period. Moreover, audience rating requests have to be taken into account in the scheduling. This is the first time this hard decision problem is dealt with in the literature. We design two mixed integer linear programming (MILP) models. Two constructive heuristics, local search procedures and simulated annealing (SA) approaches are also proposed. Extensive computational experiments, using several instances of various sizes, are performed. The results show that the proposed MILP model which represents the problem as a network flow obtains a larger number of optimal solutions and the best non-exact procedure is the one that uses SA

    A robust solving strategy for the vehicle routing problem with multiple depots and multiple objectives

    Get PDF
    This document presents the development of a robust solving strategy for the Vehicle Routing Problem with Multiple Depots and Multiple Objectives (MO-MDVRP). The problem tackeled in this work is the problem to minimize the total cost and the load imbalance in vehicle routing plan for distribution of goods. This thesis presents a MILP mathematical model and a solution strategy based on a Hybrid Multi- Objective Scatter Search Algorithm. Several experiments using simulated instances were run proving that the proposed method is quite robust, this is shown in execution times (less than 4 minutes for an instance with 8 depots and 300 customers); also, the proposed method showed good results compared to the results found with the MILP model for small instances (up to 20 clients and 2 depots).MaestrĂ­aMagister en IngenierĂ­a Industria

    A Survey on Cost and Profit Oriented Assembly Line Balancing

    Get PDF
    http://www.nt.ntnu.no/users/skoge/prost/proceedings/ifac2014/media/files/0866.pdfInternational audienceProblems, approaches and analytical models on assembly line balancing that deal explicitly with cost and profit oriented objectives are analysed. This survey paper serves to identify and work on open problems that have wide practical applications. The conclusions derived might give insights in developing decision support systems (DSS) in planning profitable or cost efficient assembly lines

    Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

    Get PDF
    Copyright © 2014 Taylor & Francis. This is an Accepted Manuscript of an article published by Taylor & Francis in International Journal of Production Research on 31 January 2014, available online: http://www.tandfonline.com/10.1080/00207543.2013.879618Growing interests from customers in customised products and increasing competitions among peers necessitate companies to configure their manufacturing systems more effectively than ever before. We propose a new assembly line system configuration for companies that need intelligent solutions to satisfy customised demands on time with existing resources. A mixed-model parallel two-sided assembly line system is introduced based on the parallel two-sided assembly line system previously proposed by Ozcan et al. (Balancing parallel two-sided assembly lines, International Journal of Production Research, 48 (16), 4767-4784, 2010). The mixed-model parallel two-sided assembly line balancing problem is illustrated with examples from the perspective of simultaneous balancing and sequencing. An agent based ant colony optimisation algorithm is proposed to solve the problem. This algorithm is the first attempt in the literature to solve an assembly line balancing problem with an agent based ant colony optimisation approach. The algorithm is illustrated with an example and its operational procedures and principles explained and discussed
    • 

    corecore