Abstract
This paper addresses the question of how to make available and how to get realistic insight into the behavior of hard algorithms for application fields such as scheduling. A typical situation in this context is the availability of hundreds of algorithms for special subclasses of certain problems where one of the main difficulties is to handle these algorithms simultaneously and make available knowledge about when and how to apply a particular algorithm, using statistical information on the suitability of certain algorithms under appropriate conditions. Major questions concern “accounting problems” when particular algorithmic tasks are required to apply special methods but might also be useful for other methods. In particular, the question of finding adequate software-engineering strategies and software-development environments for such work is addressed. Also, the paper reviews recent developments at the Research Institute for Applied Knowledge Processing (FAW) in Ulm and describes a method base for scheduling algorithms built within the framework of a cooperative effort between FAW and the Technical University of Berlin.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Applegate and W. Cook, A computational study of the job-shop scheduling problem, ORSA J. Comp. 3 (1991) 149–156.
C. Böhm and G. Jacopini, Flow diagrams. Turing machines and languages with only two formation rules, Commun. ACM (1966).
E. Balas, On the facial structure of scheduling polyhedra, Math. Prog. Study 24 (1985) 179–218.
M. Bartusch, R.H. Möhring and F.J. Radermacher, Scheduling project networks with resource constraints and time windows, Ann. Oper. Res. 16 (1988).
M. Bartusch, R.H. Möhring and F.J. Radermacher, Design aspects of an advanced DSS for scheduling problems in civil engineering, Dec. Support Syst. 5 (1989) 312–344.
R. Felter,Decision Support Assistant (Deutscher Universitäts Verlag, Wiesbaden, 1989).
A. Geoffrion, An introduction to structured modeling, Manag. Sci. 33 (1987).
A. Geoffrion, The SML language for structured modeling, WMSI Working Paper 378, Anderson Graduate School of Management, UCLA (1990).
A. Geoffrion, MS OR: forces, trends, opportunities to flourish, WMSI Working Paper 395, UCLA (1991).
A. Goldberg and D. Robson,Smalltalk-80: The Language and its Implementation (Addison Wesley, 1983).
M. Holocher. AMBAS. Entwicklung und Implementierung eines Systems für den problemorientierten Zugriff auf rechnergestützte Lösungsverfahren, Diplomarbeit FAW-B-92003 (1992).
M. Holocher, R. Michalski, D. Solte and F. Vicuña, MIDA: an open systems architecture for model-oriented integration of data and algorithms, Dec. Support Syst., to appear.
R. Hüber, V. D. Dittrich and P. C. Lockemann, Das KARAMBA-Methodenbanksystem,Tagungsband der 9. GI-Jahrestagung (1979) pp. 322–336.
M. Holocher and D. Solte, AMBAS, an adaptative method base shell, inEnterprise Integration Modeling, Proc. 1st Int. Conf., ed. C. Petrie (MIT Press, 1992).
C.V. Jones, An introduction to graph-based modeling systems, Part I: Overview, ORSA J. Comp. 2 (1990).
C.V. Jones, An introduction to graph-based modeling systems, Part II: Graph-grammars and their implementation, ORSA J. Comp. 3 (1991).
R. Krishnan, P. Piela and A. Westerberg, Reusing mathematical models in ASCEND,Proc. NATO ASI on Decision Support Systems (1991), to appear.
T. Kämpke, F.J. Radermacher, and P. Wolf, Supporting preference elicitation. The FAW preference elicitation tool. Dec. Support Syst. 9 (1993) 381–392.
E.L. Lawler, Squencing jobs to minimize total weighted completion time subject to precedence constraints, Ann. Discr. Math. 2 (1978) 75–90.
L.G. DeMichiel and R.P. Gabriel, The Common Lisp object system: an overview,Proc. European Conf. on Object Oriented Programming, Paris (1987).
D. Möller and R. Müller, A concept for the representation of data and algorithms, in:Computational Support for Discrete Mathematics. DIMACS Workshop. eds. N. Dean and G. Shannon (1994).
K. Mehlhorn and S. Näher. LEDA, a library of efficient data types and algorithms, in:Graph-Theoretic Concepts of Computer Science, Lecture Notes in Computer Sciences, Vol. 411 (Springer, 1990) pp. 88–106.
R.H. Möhring and F.J. Radermacher, The order theoretic approach to scheduling: the deterministic case, in:Advances in Project Scheduling, eds. R. Slowenski and J. Weglarz (Elsevier Science, Amsterdam, 1989) pp. 26–66.
R.H. Möhring and F.J. Radermacher, The order theoretic approach to scheduling: the stochastic case, in:Advances in Project Scheduling, eds. R. Slowenski and J. Weglarz (Elsevier Science, Amsterdam, 1989) pp. 497–531.
G.L. Nemhauser and M.W.P. Savelsbergh. A cutting plane algorithm for single machine scheduling problems with release times,Proc. 1st Workshop on COST, Rutgers University, DIMACS Technical Report 91-18 (1991).
P. Piela, ASCEND, an object oriented computer environment for modeling and analysis, Ph.D. dissertation, Department of Chemical Engineering, Carnegie-Mellon University (1989).
M. Queyranne and Y. Wang, Single-machine scheduling polyhedra with precedence constraints. Math. Oper. Res. 16 (1991) 1–20.
H. Schultz and W. Pulleyblank, Trends in optimization. OR MS Today (August, 1991).
D. Solte,Open Systems Ein lernendes Verwaltungssystem für die rechnerunterstützte Methodenkonstruktion im Bereich des Operations Research. VDI-Fortschrittsberichte. Reihe 16, Nr. 38. (VDI-Verlag, 1987).
J. de Wit and W. Herroelen, An evaluation of microcomputer-based software packages for project management. Eur. J. Oper. Res. 49 (1990).
Author information
Authors and Affiliations
Additional information
The first author acknowledges support from the Deutsche Forschungsgemeinschaft under grant Mo446 1–3 and Sonderforschungsbereich 373.
Rights and permissions
About this article
Cite this article
Müller, R., Solte, D. How to make OR-results available: a proposal for project scheduling. Ann Oper Res 55, 439–452 (1995). https://doi.org/10.1007/BF02032383
Issue Date:
DOI: https://doi.org/10.1007/BF02032383