Eureka: A Hybrid System for Assembly Line Balancing

DOI10.1287/MNSC.38.1.39MaRDI QIDQ4005791zbMATH OpenOpenAlexFDO

Authors Thomas R. Hoffmann

Publication date 27 September 1992

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.38.1.39

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)

Cited in

(25)

• Models for concurrent product and process design
• Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
• Designing paced assembly lines with fixed number of stations
• Balancing U-lines in a multiple U-line facility
• Optimally balancing assembly lines with different workstations
• Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management.
• Balancing assembly lines effectively -- a computational comparison
• An enumerative heuristic and reduction methods for the assembly line balancing problem
• U-shaped assembly line layouts and their impact on labor productivity: an experimental study
• Assembly line balancing: what happened in the last fifteen years?
• Branch, bound and remember algorithm for two-sided assembly line balancing problem
• An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
• An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
• A versatile algorithm for assembly line balancing
• A station-oriented enumerative algorithm for two-sided assembly line balancing
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• An linear programming based lower bound for the simple assembly line balancing problem
• An optimal piecewise-linear program for the U-line balancing problem with stochastic task times
• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
• A branch, bound, and remember algorithm for the simple assembly line balancing problem
• An improved mathematical program to solve the simple assembly line balancing problem
• Flight test scheduling: a generic model, lower bounds, and iterated local search
• Ant algorithms for a time and space constrained assembly line balancing problem
• The sequence-dependent assembly line balancing problem

This page was built for publication: Eureka: A Hybrid System for Assembly Line Balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4005791)