Finding optimal line balances with OptPack

DOI10.1016/0167-6377(91)90034-MMaRDI QIDQ1178719zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

assembly line balancingOptPack

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)

Recommendations

• U-OPT: An analysis of exact U-shaped line balancing procedures
• Computing the line index of balance using integer programming optimisation
• scientific article; zbMATH DE number 2159452
• Reduction approaches for a generalized line balancing problem
• Balanced optimization problems
• Balancing Straight-line Programs
• Optimally balancing assembly lines with different workstations
• Assembly line balancing with buffers by multiple criteria optimization
• scientific article; zbMATH DE number 2159453
• scientific article; zbMATH DE number 978510

Cites work

• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints

Cited in

(14)

• Branch, bound and remember algorithm for two-sided assembly line balancing problem
• An linear programming based lower bound for the simple assembly line balancing problem
• \texttt{Absalom}: balancing assembly lines with assignment restrictions
• Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
• An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
• Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
• A branch, bound, and remember algorithm for the simple assembly line balancing problem
• Balancing assembly lines effectively -- a computational comparison
• An enumerative heuristic and reduction methods for the assembly line balancing problem
• Optimally balancing assembly lines with different workstations
• Designing paced assembly lines with fixed number of stations
• An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

This page was built for publication: Finding optimal line balances with OptPack

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