Minimal investment budgets for flow line configuration

References

• Maier , D. ( 1978 ) The complexity of some problems on subse-quences and supersequences. Journal of the Association of Com-puting Machineries , 25 , 322 – 336 .
   Web of Science ®Google Scholar
• Middendorf , M. ( 1994 ) More on the complexity of common su-perstring and supersequence problems. Theoretical Computer Science , 125 , 205 – 228 .
   Web of Science ®Google Scholar
• Raiha , K.H. and Ukkonen , E. ( 1981 ) The shortest common su-persequence problem over binary alphabet is NP-complete. The-oretical Computer Science , 16 , 187 – 198 .
   Web of Science ®Google Scholar
• Timkovsky , V.G. ( 1990 ) Complexity of common subsequence and supersequence problems and related problems. Cybernetics , 25 , 565 – 580 .
   Google Scholar
• Branke , J. , Middendorf , M. and Schneider , F. ( 1998 ) Improved heuristics and a genetic algorithm for finding short supersequences. OR Spektrum , 20 , 39 – 45 .
   Google Scholar
• Foulser , D.E. , Yang , Q. and Li , M. ( 1992 ) Theory and algorithms for plan merging. Artificial Intelligence , 57 , 143 – 181 .
   Web of Science ®Google Scholar
• Fraser , C.B. ( 1995 ) Subsequences and supersequences of strings. Ph.D, dissertation , University of Glasgow , Glasgow , UK .
   Google Scholar
• Fraser , C.B. and Irving , R. ( 1995 ) Approximation algorithms for the shortest common supersequence. Nordic Journal on Comput-ing , 2 , 303 – 325 .
   Google Scholar
• Jiang , T. and Li , M. ( 1995 ) On the approximation of shortest common supersequences and longest common subsequences. SI-AM Journal on Computing , 24 , 1122 – 1139 .
   Web of Science ®Google Scholar
• Askin , R.G. and Zhou , M. ( 1998 ) Formation of independent flow-line cells based on operation requirements and machine capabilities. IIE Transactions , 30 , 319 – 329 .
   Web of Science ®Google Scholar
• Gutjahr , A.L. and Nemhauser , G.L. ( 1964 ) An algorithm for the line balancing problem. Management Science , 11 , 308 – 315 .
   Web of Science ®Google Scholar
• Hoffmann , T.R. ( 1992 ) EUREKA a hybrid system for assembly line balancing. Management Science , 38 , 39 – 47 .
   Web of Science ®Google Scholar
• Johnson , R.V. ( 1988 ) Optimally balancing large assembly lines with ‘FABLE’. Management Science , 34 , 240 – 253 .
   Web of Science ®Google Scholar
• Scholl , A. ( 1995 ) Balancing and sequencing of assembly lines. Physica , Heidelberg .
   Google Scholar
• Thomopoulos , N.T. ( 1967 ) Line balancing-sequencing for mixed-model assembly. Management Science , 14 , B59–B75 .
   Google Scholar
• van Zante-de Fokkert , J.I. , de Kok , T.G. ( 1997 ) The mixed and multi model line balancing problem a comparison. European Journal of Operational Research , 100 , 399 – 412 .
   Web of Science ®Google Scholar
• Martin , G.E. ( 1994 ) Optimal design of production lines. Interna-tional Journal of Production Research , 32 , 989 – 1 000.
   Web of Science ®Google Scholar
• Rosenberg , O. and Ziegler , H. ( 1992 ) A comparison of heuristic algorithms for cost-oriented assembly line balancing. Zeitschrift fur Operations Research , 36 , 477 – 495 .
   Google Scholar
• Rosenblatt , M.J. and Carlson , R.C. ( 1985 ) Designing a produc-tion line to maximize profit. IIE Transactions , 17 , 117 – 121 .
   Web of Science ®Google Scholar
• Chandrasekaran , R. , Aneja , Y.P. and Nair , K.P.K. ( 1984 ) Pro-duction planning in assembly line systems. Management Science , 30 . 713 – 719 .
   Web of Science ®Google Scholar
• Ahuja , R.K. , Magnanti , T.L. and Orlin , J.B. ( 1993 ) Network Flows-Theory, Algorithms, and Applications. Prentice Hall , En-glewood Cliffs , NJ .
   Google Scholar