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