Problems, Models and Complexity. Part I: Theory

Journal of Mathematical Modelling and Algorithms

Volumn 2, Issue 2, 2003, Pages 121-151

  Bruggemann W ^a   Fischer, K ^b   Jahnke, H ^c  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b ASTON UNIVERSITY   (United Kingdom)

^c BIELEFELD UNIVERSITY   (Germany)

Author keywords

philosophy of modelling; problem complexity; terminology

Indexed keywords

EID: 84888630423     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/A:1024998617280     Document Type: Article

References (55)

1. Ahuja, R. K., Magnanti, T. L. and Orlin, J. B. (1993) Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs.
2. Berman, L. and Hartmanis, J. (1977) On isomorphisms and density of N P and other complete sets, SIAM J. Comput. 6(2), 305-322.
3. Bitran, G. R. and Yanasse, H. H. (1982) Computational complexity of the capacitated lot size problem, Management Sci. 28(10), 1174-1186.
4. Bowman, E. H. (1959) The schedule-sequencing problem, Oper. Res. 7, 621-624.
5. Brüggemann, W. (1995) Ausgewählte Probleme der Produktionsplanung - Modellierung, Komplexität und neuere Lösungsmöglichkeiten, Physica-Verlag, Heidelberg.
6. Brüggemann, W. and Jahnke, H. (1997) Remarks on: 'some extensions of the discrete lotsizing and scheduling problem', Management Sci. 43(1), 122.
7. Brüggemann, W. and Jahnke, H. (2000) The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, Europ. J. Oper. Res. 124(3), 511-528.
8. Brüggemann, W., Fischer, K. and Jahnke, H. (2001) Problems - models - complexity. Also available online at http://www. math. bham. ac. uk/wob/pmc. pdf. Preprint 2001/44, School of Mathematics and Statistics, The University of Birmingham, Edgbaston, Birmingham, U. K.
9. Brüggemann, W., Fischer, K. and Jahnke, H. (2003a) Problems, models and complexity. Online appendix: Two different variants of the DLSP. Available online at http://www. math. bham. ac. uk/wob/pmc-Appendix. pdf.
10. Brüggemann, W., Fischer, K. and Jahnke, H. (2003b) Problems, models and complexity. Part II: Application to the DLSP, J. Math. Modelling Algorithms2 (2003), 153-169 (this issue).
11. Chen, W.-H. and Thizy, J.-M. (1990) Analysis of Relaxations for the Multi-Item Capacitated Lot-Sizing Problem, In: Queyranne and Bazzola, 1990, pp. 29-72.
12. Cook, S. A. (1971) The complexity of theorem-proving procedures, In: Conference Record of the 3rd Annual ACU Symposium on the Theory of Computing, pp. 151-158.
13. Coullard, C., Fourer, R. and Owen, J. H. (eds) (2001) Modeling Languages and Systems, Annals of Operations Research 104, Kluwer Academic Publishers, Dordrecht. Editor in Chief: Peter L. Hammer.
14. Dantzig, G. B. (1959/60) A machine-job scheduling model, Management Sci. 6, 191-196.
15. David, A. (2001) Models implementation: A state of the art, Europ. J. Oper. Res. 134, 459-480.
16. Domschke, W., Scholl, A. and Voß, S. (1997) Produktionsplanung- Ablauforganisatorische Aspekte, 2nd edn, Springer-Verlag, Berlin.
17. Garey, M. R. and Johnson, D. S. (1978) 'strong' NP-completeness results: Motivation, examples, and implications, J. Assoc. Comput. Mach. 25, 499-508.
18. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York.
19. Garey, M. R., Johnson, D. S. and Sethi, R. (1976) The complexity of flowshop and jobshop scheduling, Math. Oper. Res. 1(2), 117-129.
20. Gouveia, L. and Voß, S. (1995) A classification of formulations for the (time-dependent) traveling salesman problem, Europ. J. Oper. Res. 83, 69-82.
21. Grötschel, M., Lovász, L. and Schrijver, A. (1981) The ellipsoid method and its consequences in combinatorial optimization, Combinatorica1(2), 169-197.
22. Johnson, D. S. (1990) A catalog of complexity classes, In: van Leeuwen, 1990, Chapter 2, pp. 69-77, 82- 101, 152- 161.
23. Jordan, C. (1996) Batching and Scheduling - Models and Methods for Several Problem Classes, Springer, Berlin.
24. Karp, R. M. (1972) Reducibility among combinatorial problems, In: Miller and Thatcher, 1972, pp. 85-103.
25. Karp, R. M. (1975) On the computational complexity of combinatorial problems, Networks5, 45-68.
26. Kubiak, W. (1989) A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem, Europ. J. Oper. Res. 43, 267-270.
27. Latz, T. (1997) Entscheidungsmodelle der Ablaufplanung - Mathematische Programme für Shop-Scheduling-Probleme, Deutscher Universitäts-Verlag, Wiesbaden.
28. Liao, C.-J. and You, C.-T. (1992) An improved formulation for the job-shop scheduling problem, J. Oper. Res. Soc. 43(11), 1047-1054.
29. Manne, A. S. (1960) On the job-shop scheduling problem, Oper. Res. 8(2), 219-223.
30. Meer, K. and Weber, G. W. (2002) Some aspects of studying an optimization or decision problem in different computational models, Europ. J. Oper. Res. 143, 406-418.
31. Meyr, H. (1999) Simultane Losgröß en-und Reihenfolgeplanung für kontinuierliche Produktionslinien: Modelle und Methoden im Rahmen des Supply Chain Management, Deutscher Universitäts-Verlag, Wiesbaden.
32. Miller, R. E. and Thatcher, J. W. (eds) (1972) Complexity of Computer Computations, Plenum Press, New York.
33. Müller-Merbach, H. (1986) Letters from the IFORS president, Europ. J. Oper. Res. 25, 423-447.
34. Müller-Merbach, H. (1988) The concepts of problem solving, Europ. J. Oper. Res. 35, 129. Letter from the IFORS President.
35. Müller-Merbach, H. (1989) Modellierungsstrategien, In: Szyperski, 1989, pp. Columns 1162-1180.
36. Müller-Merbach, H. (2001) The rô le of modeling, Manuscript 19. 6. 2001.
37. Papadimitriou, C. H. (1994) Computational Complexity, Addison-Wesley, Reading, MA.
38. Papadimitriou, C. H. and Steiglitz, K. (1998) Combinatorial Optimization - Algorithms and Complexity, Dover Publications, Inc., Mineola, New York. Unabridged, corrected republication of the book published by Prentice-Hall, Inc., Englewood Cliffs, NJ, 1982.
39. Powell, W. B., Shapiro, J. A. and Simao, H. P. (2001) A Representational Paradigm for Dynamic Resource Transformation Problems, In: Coullard et al., 2001, pp. 231-279.
40. Queyranne, M. and Bazzola, J. (eds) (1990) Production Planning and Scheduling, Annals of Operations Research 26, Baltzer. Editor in Chief: Peter L. Hammer.
41. Rinnooy Kan, A. H. G. (1976) Machine Scheduling Problems, Martinus Nijhoff, The Hague.
42. Salomon, M. (1991) Deterministic Lotsizing Models for Production Planning, Springer-Verlag, Berlin.
43. Salomon, M., Kroon, L. G., Kuik, R. and van Wassenhove, L. N. (1991) Some extensions of the discrete lotsizing and scheduling problem, Management Sci. 37, 801-812.
44. Seelbach, H. (1975) Ablaufplanung, Physica-Verlag, Würzburg.
45. Sriskandarajah, C. and Ladet, P. (1986) Some no-wait shops scheduling problems: Complexity aspect, Europ. J. Oper. Res. 24, 424-438.
46. Stadtler, H. (1996) Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing, Europ. J. Oper. Res. 94, 561-581.
47. Stadtler, H. (1997) Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing, OR Spektrum19, 87-96.
48. Szyperski, N. (ed.) (1989) Handwörterbuch der Planung, Enzyklopädie der Betriebswirtschaftslehre (EdBWL) IX, Schaeffer-Poeschel, Stuttgart.
49. Traub, J. F. and Werschulz, A. G. (1998) Complexity and Information, Cambridge University Press, Cambridge.
50. van den Akker, J. M., Hurkens, C. A. J. and Savelsbergh, M. W. P. (2000) Time-indexed formulations for machine scheduling problems: Column generation, INFORMS J. Comput. 12(2), 111-124.
51. van Leeuwen, J. (ed.) (1990) Algorithms and Complexity, Handbook of Theoretical Computer Science A, Elsevier, Amsterdam.
52. Webster, S. (1996) The 'black-box' approach in the computational-complexity analysis of OR problems, Personal communication.
53. Webster, S. (1998) Note on 'Parallel machine scheduling with batch setup times', Oper. Res. 46, 423.
54. Webster, S. (1999) Remarks on 'some extensions of the discrete lotsizing and scheduling problem', Management Sci. 45, 768-769.
55. Zschocke, D. (1995) Modellbildung in der Ökonomie: Modell - Information - Sprache, Vahlens Handbücher der Wirtschafts-und Sozialwissenschaften, Verlag Franz Vahlen, München.