Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview,computational tests and improvements |
| |
| Authors: | Tom Pape |
| |
| Affiliation: | Clinical Operational Research Unit, University College London, 4 Taviton Street, WC1H 0BT London, UK |
| |
| Abstract: | Assigning tasks to work stations is an essential problem which needs to be addressed in an assembly line design. The most basic model is called simple assembly line balancing problem type 1 (SALBP-1). We provide a survey on 12 heuristics and 9 lower bounds for this model and test them on a traditional and a lately-published benchmark dataset. The present paper focuses on algorithms published before 2011. |
| |
| Keywords: | Heuristic Lower bound Assembly line balancing Reduction technique Partitioning problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
