Answers are grounded in this paper and cite their sources.
The general assembly line balancing problem with setups (GALBPS) was recently defined in the literature. It adds sequence-dependent setup time considerations to the classical simple assembly line balancing problem (SALBP) as follows: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time, thereby providing the task sequence inside each workstation. This paper proposes heuristic procedures, based on priority rules, for solving GALBPS, many of which are an improvement upon heuristic procedures published to date.
No takes yet. Share an insight, caveat, or question.
Martino et al. (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: