<p>Literature</p><p>Part I</p><p>Petri-Netze, EPK/ Petri Nets, Event-driven Process Chains</p><p>Hansen, H. R.; Neumann, G.: Wirtschaftsinformatik I, 9. Auflage. Stuttgart: Lucius & Lucius 2005.</p><p>Keller, G.; Nüttgens, M.; Scheer, A.-W.: Semantische Prozessmodellierung auf der Grundlage „Ereignisgesteuerter Prozessketten“. Institut für Wirtschaftsinformatik, Universität des Saarlandes. 1992.</p><p>Mendling, J.; Neumann, G.; Nüttgens, M.: Yet Another Event-Driven Process Chain. BPM 2005, LNCS 3649, pp. 428-433. Berlin et al.: Springer 2005.</p><p>Mendling, J.: Empirical Studies in Process Model Verification. In: Transactions on Petri Nets and Other Models of Concurrency II: Special Issue on Concurrency in Process-Aware Information Systems, pp.208-224. Springer 2009.</p><p>Mendling, J.; Reijers, H.A.; W.M.P. van der Aalst: Seven Process Modeling Guidelines (7PMG). In: Information and Software Technology, Vol. 52, Issue 2, pp.127-136. Butterworth-Heinemann, Newton, MA, USA, 2010.</p><p>Mertens, P. et al.: Grundzüge der Wirtschaftsinformatik, 8. Auflage. Berlin et al.: Springer 2003.</p><p>Owen, M.; Raj, J.: BPMN and Business Process Management: Introduction to the New Business Process Modeling Standard. Popkin Software, 2003.</p><p>Rittgen, P.: Quo vadis EPK in ARIS? – Ansätze zu syntaktischen Erweiterungen und einer formalin Semantik. In: Wirtschafsinformatik 42-1, S. 27-35, 2001.</p><p>Stahlknecht, P.; Hasenkamp, U.: Einführung in die Wirtschaftsinformatik, 11. Auflage. Berlin et al.: Springer 2005. </p><p>W.M.P. van der Aalst: Formalization and Verification of Event-driven Process Chains. 1999.</p><p>Projektmanagement/Project Management</p><p>Corsten, H.; Corsten, H.; Ralf, G.: Projektmanagement. Einführung. 2.Auflage. Oldenbourg, 2008.</p><p>Gray, C.F.: Project Management (Student Edition). 4th edition. McGraw-Hill, 2008. Neumann, K.; Schwindt, C.; Zimmermann, J.: Project Scheduling with Time Windows and Scare Resources: Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Function. 2.Edition. Berlin: Springer, 2003</p><p>Reschke, H.; Schelle, H.: Dimensions of Project Management. Fundamentals, Techniques, Organization, Applications. Berlin: Springer, 1990. </p><p>Zimmermann, J.; Stark, C.; Rieck, J.: Projektplanung: Methoden, Management. Berlin: Sringer, 2006</p><p>Part II</p><p>Baeten, J.C.M.; Weijland W.P.: Process Algebra, Cambridge (Cambridge University Press) 1990.</p><p>Wendt, O.; König, W.: Efficient Production Processes Algebra, In: Universität Frankfurt. Reference No. 1997-18</p><p>Part III</p><p>Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchettispaccamela, A., Protasi, M.: Complexity and Approximation. Springer, (1999). </p><p>Baptiste, P., Peridy, L., Pinson, E.: A Branch and Bound to Minimize the Number of Late Jobs on a Single Machine with Release Time Constraints. Universite de l‘Ouest, (2001).</p><p>Busch, A.: Collaborative Supply Chain Management (CSCM) – Fraunhofer ALB analysiert und vergleicht 19 Systeme zur synchronisierten Planung und Steuerung der Supply Chain. http://www.competence-site.de/pps.nsf/21C69E5AA2C23883C1256BB 9002A61A9/$File/cscm_fraunhofer_alb.pdf, (2002).</p><p>Carlier, J.: Problèmes d’ordonnancements à contraintes de ressources: Algorithmes et complexité. Thèse d’État, University of Paris VI, (1984).</p><p>Conen, W.: Kombinatorische Ressourcenallokation mit ökonomischen Koordinations- mechanismen. Dissertation, Universität GH Essen, (2003).</p><p>Fricke, M.: Information Logistics in Supply Chain Networks. Dissertation, Johann Wolfgang Goethe-Universität, Frankfurt am Main, (2003). </p><p>Garey, M.R., Johnson, D.S.: Two-processor scheduling with start-times and deadlines. SIAM J. Comput., 6, S. 416–426, (1977). Kise, H., Ibaraki, T., Mine, H.: A solvable case of one machine scheduling problem with ready and due dates. Operations Research, 26, S. 121–126, (1978).</p><p>Knolmayer, G., Mertens, P., Zeier, A.: Supply Chain Management auf Basis von SAP-Systemen – Perspektiven der Auftragsabwicklung für Industriebetriebe. Berlin, Heidelberg, New York, (2000).</p><p>KPMG Consulting: Collaborative Planning - Gemeinsame Planung mit Supply Chain Partnern. http://www.kpmgconsulting.at/sources/3_solutions/3_SCM/4_media/4_vortraege/KPMG_Colla borative_Planning.pdf, (2001). </p><p>Langemann, T.: Collaborative Supply Chain Management (CSCM), in: Busch, A., Dangelmaier, W. (Hrsg.): Integriertes Supply Chain Management – Theorie und Praxis effektiver unternehmens- übergreifender Geschäftsprozesse. Wiesbaden, S. 421-438, (2002).</p><p>Lawler, E.L.: Knapsack-like scheduling problems, the moore-hodgson algorithm and the "tower of sets" property. Math. Comput. Modelling, 20(2), S. 91–106, (1994).</p><p>Lenstra, J.K., Rinnooy Kann, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics, (1), S. 343–362, (1977).</p><p>Mas-Colell, A., Whinston, M., Green, J.R.: Microeconomic Theory. Oxford University Press, (1995).</p><p>McAfee, P., McMillan, J.: Auctions and Bidding. Journal of Economic Literature Vol. XXV (June 1987), San Diego, (1987).</p><p>Milgrom, P.: Putting auction theory to work: The simultaneous ascending auction. Journal of Political Economy, 108, (2000).</p><p>Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1), S. 102–109, (1968).</p><p>Nisan, N., Segal, I.: The communication complexity of efficient allocation problems. Working Paper, (2002). </p><p>Rothkopf, M.H., Pekeč, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science, 44 (8), S. 1131–1147, (1998).</p><p>Sandholm, T., Suri, S.: Improved algorithms for optimal winner determination in combinatorial auctions and generalizations, in: Proc. AAAI-00, Austin, TX, S. 90–97, (2000).</p><p>Sandholm, T.: Algorithm for Optimal Winner Determination in Combinatorial Auctions. Artificial Intelligence, (2002).</p><p>Sandholm, T.: Negotiation among Self-Interested Computationally Limited Agents. PhD-Thesis, University of Massachusetts, Amherst, (1996). Stockheim T., Wendt O., Schwind M.: A Trust-based Negotiation Mechanism for Decentralized Economic Scheduling, in Proceedings of the 38th Hawaii International Conference on System Sciences (2005)</p><p>Sucky, E.: Koordination in Supply Chains: Spieltheoretische Ansätze zur Ermittlung integrierter Bestell- und Produktionspolitiken. Dissertation, Johann Wolfgang Goethe-Universität, Frankfurt am Main, (2003).</p><p>Wellman, M.P.; P.R. Wurman: AkBA: A Progressive, Anonymous-Price Combinatorial Auction, in: Second ACM Conference on Electronic Commerce, Minneapolis, (2000).</p><p>Wendt, O.: Solving Combinatorial Interval Auctions by Cooperative Simulated Annealing. Working Paper, Institut für Wirtschaftsinformatik, Johann Wolfgang Goethe-Universität, Frankfurt am Main, (2003).</p><p>Part IV</p><p>Yield Management</p><p>Bertsch, L.; Wendt, O.: Yield-Management. In: Weber, J.; Baumgarten, H.: Handbuch Logistik; Stuttgart (Schaeffer-Poeschel).Reference No. 1997-47</p><p>Wendt, O.: Optimal Pricing of Airfreight Capacity. In: Behrendt, R.; Bertsch, L.: ASTAIR 91 - Proceedings of the First Conference on Advanced Software Technologies in Air Transport; Hallbergmoos (AIT-Verlag); S. 161-178</p><p>Wendt, O.; Schwind, M.: Reinforcement Learning zur Lösung multidimensionaler Yield- Management-Probleme. In: Arbeitsbericht IWI; Frankfurt. Reference No. 2002-7</p><p>Reinforcement Learning</p><p>Hu, J.; Wellman, M.P.: Multiagent Reinforcement Learning: Theoretical Framework and an Algorithm, Madison 1998</p><p>Kephart, J.O.; Tesauro, G.J.: Pseudo-convergent Q-Learning by Competitive Pricebots, Hawthorne 1999</p><p>Sutton, R.S.: Reinforcement-Learning: An Introduction, Cambridge 1998</p><p>Kephart, J.O.; Tesauro, G.: Pricing in agent economies using multi-agent Q-Learning, Hawthorne 1999</p>