A survey of exact algorithms for the simple assembly line balancing problem
Management Science
Topological sorting of large networks
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
Discrete Applied Mathematics
Communication: Robust network optimization under polyhedral demand uncertainty is NP-hard
Discrete Applied Mathematics
Minimizing the number of late jobs on a single machine under due date uncertainty
Journal of Scheduling
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
Discrete Optimization
| Hi-index | 0.04 |
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.