๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A heuristic network procedure for the assembly line balancing problem

โœ Scribed by Peter A. Pinto; David G. Dannenbring; Basheer M. Khumawala

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
417 KB
Volume
25
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally yields better solutions than those obtained by application of the heuristics, and b) sensitivity analysis with different values of cycle time is possible without having to regenerate the network. The rationale for its effectiveness and its application to problems with paralleling are presented. Computational experience with the procedure on up to 50 task test problems is provided.

๐Ÿ“œ SIMILAR VOLUMES

A balancing problem for mixed model asse
A balancing problem for mixed model assembly lines with a paced moving conveyor
โœ Xiaobo Zhao; Katsuhisa Ohno; Hon-Shiang Lau ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB

## Abstract We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the

A dual-ascent procedure for the file all
A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network
โœ Murthy, Ishwar; Seo, Phil K. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 169 KB

In this paper, a model and a solution procedure is developed for the File Allocation and Join Site Selection Problem with 2-way Join [FAJSP-2], defined on a telecommunications network. This problem attempts to integrate the file allocation and query optimization aspects of a distributed computing sy