Results 241 to 250 of about 5,113,304 (295)
Some of the next articles are maybe not open access.
The U-line Line Balancing Problem
Management Science, 1994The traditional line balancing (LB) problem considers a production line in which stations are arranged consecutively in a line. A balance is determined by grouping tasks into stations while moving forward (or backward) through a precedence network. Recently many production lines are being arranged in a “U-line,” as a consequence of the use of just-in ...
G. J. Miltenburg, J. Wijngaard
openaire +1 more source
A Production Line that Balances Itself
Operations Research, 1996In “bucket brigade” manufacturing, such as recently introduced to the apparel industry, a production line has n workers moving among m stations, where each worker independently follows a simple rule that determines what to do next. Our analysis suggests and experiments confirm that if the workers are sequenced from slowest to fastest then ...
John J. Bartholdi III +1 more
openaire +2 more sources
A Balancing Method and Genetic Algorithm for Disassembly Line Balancing
European Journal of Operational Research, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Surendra M Gupta, Seamus M McGovern
exaly +4 more sources
On Assembly-Line Balancing Problems
Operations Research, 1969This paper considers three kinds of assembly-line disciplines: assembly lines without parallel subassemblies, lines with parallel subassemblies, and single-product assembly lines. To each such discipline there corresponds a line balancing problem. For the second and third disciplines, feasible (but not necessarily optimal) balances are characterized ...
openaire +1 more source
Balancing matrices with line shifts
Combinatorica, 1983The authors give a deterministic proof [not a probabilistic one as in the original paper written by \textit{J. Komlós} and \textit{M. Suliok}, Comb. Theory Appl., Colloquia Math. Soc. János Bolyai 4, 721-728 (1970; Zbl 0216.020)] of the following theorem: If \(A=(a_{ij})\), with \(a_{ij}=\pm 1\) is a \(n\times n\) matrix, then it is possible to ...
József Beck, Joel Spencer
openaire +2 more sources
An Algorithm for the Line Balancing Problem
Management Science, 1964An algorithm, based on finding a shortest route in a finite directed network, is given for the assembly line balancing problem. Arc lengths are such that it is sufficient to find any path from the origin to destination node containing a minimal number of arcs.
Allan L. Gutjahr, George L. Nemhauser
openaire +2 more sources
Improved Bounds for On-Line Load Balancing
Algorithmica, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Andrews +2 more
openaire +2 more sources
On-Line Load Balancing for Related Machines
Journal of Algorithms, 1997Summary: We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of \(3+ \sqrt 8\approx 5.828\) for the deterministic version, and \(3.31/\ln 2.155\approx 4.311\) for its randomized variant, improving the previous competitive ratios of 8 and \(2e ...
Piotr Berman +2 more
openaire +2 more sources
Production-Line Balances for Mixed-Model Lines
Management Science, 1972This paper considers the problem of mixed-model assembly-line balancing. First, the balance problem is formulated, and some of the difficulties of achieving effective balances in practice are noted. Next, balance procedures designed to obtain expeditious computer solutions of large-scale mixed-model balances are presented, and results obtained for a ...
openaire +1 more source
Balancing assembly lines with tabu search
European Journal of Operational Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sophie D. Lapierre +2 more
openaire +3 more sources