Finding optimal line balances with OptPack
From MaRDI portal
Publication:1178719
DOI10.1016/0167-6377(91)90034-MzbMath0738.90038MaRDI QIDQ1178719
Francis J. Nourie, Enrique R. Venta
Publication date: 26 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90034-m
90B35: Deterministic scheduling theory in operations research
90B30: Production models
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations, Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure, \texttt{Absalom}: balancing assembly lines with assignment restrictions, Designing paced assembly lines with fixed number of stations, Optimally balancing assembly lines with different workstations, Balancing assembly lines effectively -- a computational comparison, An enumerative heuristic and reduction methods for the assembly line balancing problem, Branch, bound and remember algorithm for two-sided assembly line balancing problem, An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset, 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, Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements, 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
Cites Work
