 SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancingRico Walter, Philipp Schulze and Armin Scholl European Journal of Operational Research, 2021, vol. 295, issue 3, 857-873 Abstract: We consider a version of the well-known simple assembly line balancing problem (called SALBP-SX) where, given the cycle time and the number of stations, the workloads of the stations are to be leveled according to an adequately defined smoothness index SX. Our index SX involves for each station the quadratic deviation of its workload from the average (or ideal) workload and is therefore closely related to the variance, which is a common measure of dispersion in statistics. Contrary to the existing literature on workload smoothing in ALB, which often treats the optimization of a prespecified smoothness index as a secondary objective, we consider our SX-objective as the single one in order to account for the practical relevance of fair workload distributions and avoiding overloaded bottleneck stations. Keywords: Scheduling; Assembly line balancing; Workload smoothing; Branch-and-bound (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:295:y:2021:i:3:p:857-873 DOI: 10.1016/j.ejor.2021.03.021 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.