scispace - formally typeset
Journal ArticleDOI

A taxonomy of line balancing problems and their solutionapproaches

Reads0
Chats0
TLDR
The objective of this survey is to analyze recent research on balancing flow lines within many different industrial contexts in order to classify and compare the means for input data modelling, constraints and objective functions used.
About
This article is published in International Journal of Production Economics.The article was published on 2013-04-01. It has received 561 citations till now.

read more

Citations
More filters
Journal ArticleDOI

A Survey on Demand Response Programs in Smart Grids: Pricing Methods and Optimization Algorithms

TL;DR: This paper provides a comprehensive review of various DR schemes and programs, based on the motivations offered to the consumers to participate in the program, and presents various optimization models for the optimal control of the DR strategies that have been proposed so far.
Journal ArticleDOI

Value creation through design for scalability of reconfigurable manufacturing systems

TL;DR: A mathematical method that maximises the system throughput after reconfiguration is proposed, and an industrial case is presented to validate the method and offer a set of principles for system design for scalability to guide designers of modern manufacturing systems.
Posted Content

ULINO: optimally balancing U-shaped JIT assembly lines

TL;DR: For solving different versions of the U-line assembly line balancing problem, the branch and bound procedure ULINO is proposed which is applied directly and in the framework of search methods and Experimental results indicate that these procedures perform well and that theU-line configuration frequently improves the line efficiency compared to traditional lines.
Journal ArticleDOI

Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem

TL;DR: The results show that the proposed ABC algorithm performs well and is superior to the other six algorithms in terms of the objective values performance.
Journal ArticleDOI

A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem

TL;DR: A hybrid algorithm that combines a genetic algorithm with a variable neighborhood search method (VNSGA) is proposed to solve the sequence-dependent disassembly line balancing problem (SDDLBP), and the performance of VNSGA was compared with the best known metaheuristic methods reported in the literature.
References
More filters
Journal ArticleDOI

Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach

TL;DR: The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the tradeoff surface.
Journal ArticleDOI

The learning curve: historical review and comprehensive survey

TL;DR: The use of the learning curve has been receiving increasing attention in recent years as discussed by the authors, and much of this increase has been due to learning curve applications other than in the traditional learning curve areas.
Journal ArticleDOI

A survey on problems and methods in generalized assembly line balancing

TL;DR: The developments in GALBP research is surveyed in order to describe and solve more realistic generalized problems (GALBP) and to survey the developments in assembly line balancing research.
Journal ArticleDOI

Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art

TL;DR: The evolution of ECMPRO that has taken place in the last decade is discussed and the new areas that have come into focus during this time are discussed.
Journal ArticleDOI

A survey of exact algorithms for the simple assembly line balancing problem

TL;DR: The simple assembly line balancing problem (SALBP) as discussed by the authors is a deterministic optimization problem where all input parameters are assumed to be known with certainty and all the algorithms discussed are exact.
Related Papers (5)