Movement minimization for unit distances in conveyor flow shop processing

Mathematical Methods of Operations Research

Volumn 57, Issue 2, 2003, Pages 173-203

  Espelage, W ^a   Wanke, E ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVEYORS; SCHEDULING; THEOREM PROVING;

APPROXIMATION ALGORITHM; CONVEYOR FLOW SHOP; FLOW SHOP PROCESSING; MOVEMENT MINIMIZATION PROBLEMS;

OPERATIONS RESEARCH;

EID: 4344658295     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860200249     Document Type: Article

References (6)

1. Błażeẃicz J, Ecker KH, Pesch E, Schmidt G, Wȩglarz J (1996) Scheduling computer and manufacturing processes. Springer, Berlin, Heidelberg, New York
2. de Koster R (1994) Performance approximation of pick-to-belt orderpicking systems. European Journal of Operational Research 92:558-573
3. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco
4. Gonzalez T (1982) Unit execution time shop problems. Mathematics of Operations Research 7:57-66
5. Monma CL, Rinnooy Kan AHG (1983) A concise survey of efficiently solvable special cases of the permutation flow-shop problem. RAIRO Rech. Opér 17:105-119
6. Rethmann J, Wanke E (1997) Storage controlled pile-up systems. European Journal of Operational Research 103(3):515-530