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

A two-process implicit enumeration algorithm for the simple assembly line balancing problem

โœ Scribed by Matthew J. Saltzman; Ilker Baybars

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
893 KB
Volume
32
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Firing sequences backward algorithm for
Firing sequences backward algorithm for simple assembly line balancing problem of type 1
โœ Ozcan Kilincci ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 417 KB

## a b s t r a c t The objective of simple assembly line balancing problem type-1 (SALBP-1) is to minimize the number of workstations on an assembly line for a given cycle time. Since SALBP-1 is NP-hard, many iterative backtracking heuristics based on branch and bound procedure, tabu search, and g

A heuristic network procedure for the as
A heuristic network procedure for the assembly line balancing problem
โœ Peter A. Pinto; David G. Dannenbring; Basheer M. Khumawala ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 417 KB

## 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 y

A single-run optimization algorithm for
A single-run optimization algorithm for stochastic assembly line balancing problems
โœ JrJung Lyu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Society of Manufacturing Engineers ๐ŸŒ English โš– 658 KB

This paper presents a new algorithm for solving stochastic line balancing problems, The proposed algorithm is based on the single-run optimization approach, which is applied to find the optimal parameters of a simulation model, A comparison with other developed algorithms in the literature shows tha