Optimization of production planning problems - A case study for assembly lines

International Journal of Modern Physics C

Volumn 11, Issue 5, 2000, Pages 949-972

  Schneider, Johannes ^a,b   Britze, Jürgen ^c   Ebersbach, Anja ^a   Morgenstern, Ingo ^a   Puchta, Markus ^a  

^a UNIVERSITY OF REGENSBURG   (Germany)

^b UNIVERSITY OF ZURICH   (Switzerland)

^c BMW AG   (Germany)

Author keywords

Advanced Planning and Scheduling; Assembly Line; Enterprise Resource Planning; Monte Carlo; Optimization; Production planning; Scheduling; Supply Chain Management

Indexed keywords

EID: 0034357509     PISSN: 01291831     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012918310000081X     Document Type: Article

References (8)

1. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, "Optimization by Simulated Annealing," Science 220, 671 (1983).
2. G. Dueck and T. Scheuer, "Threshold Accepting: A general purpose optimization algorithm appearing superior to Simulated Annealing," J. Comp. Phys. 90, 161 (1990).
3. K. Binder and D. W. Heermann, Monte Carlo Simulation in Statistical Physics (Springer, Berlin, 1992).
4. J. Schneider, "Effiziente parallelisierbare physikalische Optimierungsverfahren," PhD Thesis, University of Regensburg, 1999.
5. G. Reinelt, The Traveling Salesman, Lecture Notes in Computer Science 840 (Springer, Berlin, 1994).
6. P. F. Stadler and W. Schnabl, "The landscape of the Traveling Salesman Problem," Phys. D 48, 65 (1991).
7. J. Schneider, Ch. Froschhammer, I. Morgenstern, Th. Husslein, and J. M. Singer, "Searching for backbones - An efficient parallel algorithm for the Traveling Salesman Problem," Comp. Phys. Comm. 96, 173 (1996).
8. J. Schneider, M. Schmid, I. Morgenstern, and J. M. Singer, "Ensemble Based Search Space Smoothing," preprint, University of Regensburg, 1998, submitted to COAP.