Optimally balancing assembly lines with different workstations

Authors:
Gaia Nicosia;Dario Pacciarelli;Andrea Pacifici
Affiliations:
Dipartimento di Informatica e Automazione, Università di "Roma Tre", via della Vasca Navale 79, 00146 Rome, Italy;Dipartimento di Informatica e Automazione, Università di "Roma Tre", via della Vasca Navale 79, 00146 Rome, Italy;Dipartimento di Informatica Sistemi e Produzione, Università di Roma "Tor Vergata", via di Tor Vergata 110, 00133 Rome, Italy
Venue:
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Year:
2002

Citing 8
Cited 4

A comparative evaluation of heuristic line balancing techniques

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

Management Science
Optimally balancing large assembly lines with `FABLE'

Management Science
Characteristics of optimal workload allocation for closed queueing networks

Performance Evaluation
Eureka: a hybrid system for assembly line balancing

Management Science
Throughput for production lines with serial work stations and parallel services facilities

Performance Evaluation
Assembly System Design: a Branch and Cut Approach

Management Science
Assembly planning research at CSIRO Australia

ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning

Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled

Discrete Applied Mathematics
An efficient approach for type II robotic assembly line balancing problems

Computers and Industrial Engineering
Simulation-based scheduling of assembly operations

International Journal of Computer Integrated Manufacturing - THE CHALLENGES OF MANUFACTURING IN THE GLOBALLY INTEGRATED ECONOMY. GUEST EDITOR: ROBIN G. QIU
On solving the assembly line worker assignment and balancing problem via beam search

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the problem of assigning operations to an ordered sequence of non-identical workstations, observing precedence relationships and cycle time restrictions. The objective is to minimize the cost of the workstations. We first present a dynamic programming algorithm, and introduce several fathoming rules in order to reduce the number of states in the dynamic program. A characterization of a wide class of polynomially solvable instances is given, and computational results are reported.