Scenario based robust line balancing: Computational complexity
- 作者：Alexandre Dolgui ; dolgui@emse.fr ; Sergey Kovalev kovalev@emse.fr
- 关键词：Line balancing ; Uncertainty ; Scenario ; Min-max approach ; Computational complexity
- 刊名：Discrete Applied Mathematics
- 出版年：2012
- 期刊代码：46_0166218x
- 类别：cp
- 出版时间：September, 2012
- 卷：160
- 期：13-14
- 页码：1955-1963
- 文件大小：252 K
摘要
This paper studies the following line balancing problem with uncertain operation execution times. Operations on the same product have to be assigned to the stations of a transfer line. The product moves along the stations in the same direction, and operations assigned to the same station are executed sequentially. Exclusion, inclusion and precedence relations are given on the set of operations. Operation execution times are uncertain in the sense that their set belongs to a given set of scenarios. The objective is to minimize the line cycle time, which is equal to the maximum total execution time of operations of the same station, for the worst scenario. An approach to reducing the scenario set is described. Several special cases of the problem are proved NP-hard and strongly NP-hard. Enumerative dynamic programming algorithms and problem-specific polynomial time algorithms are suggested for some cases.