A practical view of the complexity in developing master production schedules: Fundamentals, examples, and implementation

International Series in Operations Research and Management Science

Volumn 89, Issue , 2006, Pages 149-176

  Vieira, Guilherme Emani ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF PARANÁ   (Brazil)

Author keywords

And implementation; Complexity; Information systems; Master production planning; Optimization

Indexed keywords

EID: 84955297613     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (23)

1. Bonomi, E.; & Lutton, J. "The N-City Traveling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm." SI AM Review, 26, 551-568, 1984.
2. Brochonski, P. C. "Um Sistema para Programação da Produção de Maquinas de Composição SMT", Curitiba. 1999.
3. Cavalcanti, E. M. B.; & Moraes de, W. F. A.. Programa-mestre de produpao: concepção teórica X aplicação pratica na indústria de cervejas e refrigerantes. Anais do ANPAD. Foz doIguaçu-PR, 1998.
4. Connolly, D. T., "An Improved Annealing Scheme for the Quadratic Assignment Problem.” European Journal of Operation Research, 46, 93-100, 1990.
5. Cox III J. F.; & Blackstone Jr J. H. “APICS Dictionary”-Ninth Edition. 1998.
6. th Automatic Brazilian Congress, Florianópolis, Brazil, 2000.
7. th Edition. SouthWestern Educational Publishing. 1999.
8. Garey, M.; & Johnson, D. “Computers, Complexity and Intractability. A Guide to Theory of NP-Completeness.” Freeman, San Francisco, USA, 1979.
9. Higgins, P.; & Browne, J. “Master production scheduling: a concurrent planning approach.” Production Planning & Control. Vol.3, No.1, 2-18. 1992.
10. Kirkpatrick, S., Gelatt, C. D. Jr.; & Vecchi, M. P. "Optimization by Simulated Annealing." Science, Vol.220, No.4598, 671-680, 1983.
11. McClelland, M. K., “Order Promising and the Master Production Schedule.” Decision Science, 19,4. Fall 1988.
12. McLaughlin, M. P. "Simulated Annealing” Dr. Dobb’s Journal, 26-37, 1989.
13. Metropolis, N.; Rosenbluth, A.; Rosenbluth, M.; Teller, A.; & Teller, E. "Equations of State Calculations by Fast Computing Machines." J.Chemical Physics, vol. 21, 1087-1091, 1953.
14. rd Annual Symposium of the Brazilian Operational Research Society, Campos do Jordäo, Brazil, 2001.
15. a. Edição, Editora DG. 1999.
16. Radhakrishnan, S. & Ventura, J. A. “Simulated Annealing for Parallel Machine Scheduling with Earliness-Tardiness penalties and Sequence- Dependent Setup Times. " International Journal of Production Research”, vol.38, n° 10, 2233-2252, 2000.
17. Slack, N.; Chambers, S.; & Johnston, R. Operations Management. Prentice Hall-3rd Edition -2001.
18. Tanomaro, J. “Fundamentos e Aplicagöes de Algoritmos Genéticos.” Segundo Congresso Brasileiro de Redes Neurais.
19. Tsang, E. P. K. “Scheduling Techiques-A Comparative Study.” BT Technol J Vol-13 N. 1 Jan 1995.
20. Vieira, G. E.; Soares, M. M.; & Gaspar Jr O. "Otimização do planejamento mestre da produção através de algoritmos genético. In: XXII Encontro Nacional de Engenharia de Produção, 2002, Curitiba. Anais de Resumos ENEGEP 2002. São Paulo: ABEPRO, 2002.
21. Vollmann, T. E., Berry, W. L., & Whybark, D. C. Manufacturing Planning and Control Systems. Irwin-Third Edition. 1992.
22. Wall, M. B. “A Genetic Algorithm for Resource-Constrained Scheduling.” Department of Mechanical Engineering-Massachusetts Institute of Technology. 1996.
23. Zolfaghari, S.; & Liang, M. “Comparative Study of Simulated Annealing, Genetic Algorithms and Tabu Search of Solving Binary and Comprehensive Machine-Grouping Problems.” International Journal of Production Research, vol.40, n° 9, 2141-2158, 2002.