Minimal investment budgets for flow line configuration

IIE Transactions (Institute of Industrial Engineers)

Volumn 32, Issue 4, 2000, Pages 287-298

  Kimms, Alf ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBLEM SOLVING; PROCESS ENGINEERING; RISK MANAGEMENT; STRATEGIC PLANNING;

FLOW LINE CONFIGURATIONS; MAJORITY MERGE HEURISTICS;

PRODUCTION CONTROL;

EID: 0034466407     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007684602278     Document Type: Article

References (21)

1. Maier, D. (1978) The complexity of some problems on subsequences and supersequences.'VoMrna/ of the Association of Computing Machineries, 25, 322-336.
2. Middendorf, M. (1994) More on the complexity of common superstring and supersequence problems. Theoretical Computer Science, 125, 205-228.
3. Räihä, K.H. and Ukkonen, E. (1981) The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science, 16, 187-198.
4. Timkovsky, V.G. (1990) Complexity of common subsequence and supersequence problems and related problems. Cybernetics, 25, 565-580.
5. Branke, J., Middendorf, M. and Schneider, F. (1998) Improved heuristics and a genetic algorithm for finding short supersequences. OR Spektrum, 20, 3915.
6. Foulser, D.E., Yang, Q. and Li, M. (1992) Theory and algorithms for plan merging. Artificial Intelligence, 57, 143-181.
7. Fraser, C.B. (1995) Subsequences and supersequences of strings. Ph.D. dissertation, University of Glasgow, Glasgow, UK.
8. Fraser, C.B. and Irving, R. (1995) Approximation algorithms for the shortest common supersequence. Nordic Journal on Computing, 2, 303-325.
9. Jiang, T. and Li, M. (1995) On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal on Computing, 24, 1122-1139.
10. Askin, R.G. and Zhou, M. (1998) Formation of independent flowline cells based on operation requirements and machine capabilities. HE Transactions, 30, 319-329.
11. Gutjahr, A.L. and Nemhauser, G.L. (1964) An algorithm for the line balancing problem. Management Science, 11, 308-315.
12. Hofimann, T.R. (1992) EUREKA: a hybrid system for assembly line balancing. Management Science, 38, 39-47.
13. Johnson, R.V. (1988) Optimally balancing large assembly lines with "FABLE". Management Science, 34, 240-253.
14. Scholl, A. (1995) Balancing and sequencing of assembly lines. Physica, Heidelberg.
15. Thomopoulos, N.T. (1967) Line balancing-sequencing for mixedmodel assembly. Management Science, 14, B59-B75.
16. van Zante-de Fokkert, J.I. and de Kok, T.G. (1997) The mixed and multi model line balancing problem: a comparison. European Journal of Operational Research, 100, 399412.
17. Martin, G.E. (1994) Optimal design of production lines. International Journal of Production Research, 32, 989-1000.
18. Rosenberg, O. and Ziegler, H. (1992) A comparison of heuristic algorithms for cost-oriented assembly line balancing. Zeitschrift für Operations Research, 36, 477-495.
19. Rosenblatt, M.J. and Carlson, R.C. (1985) Designing a production line to maximize profit. HE Transactions, 17, 117-121.
20. Chandrasekaran, R., Aneja, Y.P. and Nair, K.P.K. (1984) Production planning in assembly line systems. Management Science, 30, 713-719.
21. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993) Network Flows-Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.