Movement optimization in flow shop processing with buffers

Mathematical Methods of Operations Research

Volumn 51, Issue 3, 2000, Pages 495-513

  Espelage, Wolfgang ^a   Wanke, Egon ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Discrete algorithms; Flow shop processing; Movement optimization; Problem complexity

Indexed keywords

EID: 0346479362     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860000044     Document Type: Article

References (10)

1. Błaz̀eẃicz J, Ecker KH, Pesch E, Schmidt G, Wȩglarz J (1996) Scheduling computer and manufacturing processes. Springer, Berlin, Heidelberg, New York
2. Koster R de (1994) Performance approximation of pick-to-belt orderpicking systems. European Journal of Operational Research 92:558-573
3. Espelage W, Wanke E (1998) 0/1 permutation flow shop scheduling. Technical report, Heinrich-Heine-Universität
4. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco
5. Gonzalez T (1982) Unit execution time shop problems. Mathematics of Operations Research 7:57-66
6. Harary F (1969) Graph theory. Addison-Wesley Publishing Company, Massachusetts
7. Monma CL, Rinnooy Kan AHG (1983) A concise survey of efficiently solvable special eases of the permutation flow-shop problem. RAIRO Rech. Opr, 17:105-119
8. Nemhauser GL, Wolsey LA (1989) Integer and combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York
9. Rethmann J, Wanke E (1997) Storage controlled pile-up systems, theoretical foundations. European Journal of Operational Research 103(3):515-530
10. Schrijver A (1986) Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York