{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:37:37Z","timestamp":1725489457413},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423447"},{"type":"electronic","value":"9783540445838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44583-8_22","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:22:18Z","timestamp":1187252538000},"page":"304-318","source":"Crossref","is-referenced-by-count":1,"title":["A Term-Based Approach to Project Scheduling"],"prefix":"10.1007","author":[{"given":"Pok -Son","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,12]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1613\/jair.516","volume":"9","author":"A. Artale","year":"1998","unstructured":"A. Artale and Franconi E. A temporal description logic for reasoning about actions and plans. J. Artificial Intelligence Research, 9:463\u2013506, 1998.","journal-title":"J. Artificial Intelligence Research"},{"key":"22_CR2","unstructured":"A. Artale and Franconi E. Temporal description logics. In Handbook of Time and Reasoning in Artificial Intelligence. MIT Press, 2000. forthcoming."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/1520-6750(199106)38:3<315::AID-NAV3220380304>3.0.CO;2-7","volume":"38","author":"C. E. Bell","year":"1991","unstructured":"C. E. Bell and J. Han. A New Heuristic Solution Method in Resource-Constrained Project Scheduling. Naval Research Logistics, 38:315\u2013331, 1991.","journal-title":"Naval Research Logistics"},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/1520-6750(199002)37:1<61::AID-NAV3220370104>3.0.CO;2-S","volume":"37","author":"C. E. Bell","year":"1990","unstructured":"C. E. Bell and K. Park. Solving Resource-Constrained Project Scheduling Problems by A\n                           * Search. Naval Research Logistics Quarterly, 37(1):61\u201384, 1990.","journal-title":"Naval Research Logistics Quarterly"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(90)90116-S","volume":"49","author":"F. F. Boctor","year":"1990","unstructured":"Fayez F. Boctor. Some efficient multi-heuristic procedures for resource-constrained project scheduling. European Journal of Operational Research, 49:3\u201313, 1990.","journal-title":"European Journal of Operational Research"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"P. Brucker","year":"1998","unstructured":"P. Brucker, S. Knust, and O. Schoo, A. Thiele. A Branch and Bound Algorithm for the Resource-constrained Project Scheduling Problem. European Journal of Operational Research, 107:272\u2013288, 1998.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"22_CR7","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E. Demeulemeester","year":"1992","unstructured":"E. Demeulemeester and W. Herroelen. A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Management Science, 38(12):1803\u20131818, 1992.","journal-title":"Management Science"},{"issue":"11","key":"22_CR8","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","volume":"43","author":"E. Demeulemeester","year":"1997","unstructured":"E. Demeulemeester and W. Herroelen. New Benchmark Results for the Resource-constrained Project Scheduling Problem. Management Science, 43(11):1485\u20131492, 1997.","journal-title":"Management Science"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2625","volume":"134","author":"F. M. Donini","year":"1997","unstructured":"Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Werner Nutt:. The complexity of concept languages. Information and Computation, 134(1):1\u201358, 1997.","journal-title":"Information and Computation"},{"key":"22_CR10","volume-title":"Activity Networks: Project Planning and Control by Network Models","author":"S. E. Elmaghraby","year":"1977","unstructured":"S. E. Elmaghraby. Activity Networks: Project Planning and Control by Network Models. Wiley, New York, 1977."},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/00207548608919730","volume":"24","author":"E. A. Elsayed","year":"1986","unstructured":"E. A. Elsayed and N. Z. Nasr. Heuristics for Resource Constrained Scheduling. International Journal of Production Research, 24(2):299\u2013310, 1986.","journal-title":"International Journal of Production Research"},{"issue":"9","key":"22_CR12","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/mnsc.25.9.862","volume":"25","author":"C. A. Holloway","year":"1979","unstructured":"C. A. Holloway, R. T. Nelson, and V. Suraphongschai. Comparison of a Multi-Pass Heuristic Decomposition Procedure with other Resource-Constrained Project Scheduling Procedures. Management Science, 25(9):862\u2013872, 1979.","journal-title":"Management Science"},{"key":"22_CR13","volume-title":"The Critical Path Method: Resource Planning and Scheduling, Ch 21 in Industrial Scheduling","author":"J. E. Kelly Jr.","year":"1963","unstructured":"J. E. Jr. Kelly. The Critical Path Method: Resource Planning and Scheduling, Ch 21 in Industrial Scheduling, Muth, J. F. AND Thompson, G. L. (eds.). Prentice Hall, Englewood Cliffs, NJ, 1963."},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1080\/00207549108930056","volume":"29","author":"M. M. Khattab","year":"1991","unstructured":"M. M. Khattab and F. Choobineh. A New Approach for Project Scheduling with a Limited Resource. International Journal of Production Research, 29(1):185\u2013198, 1991.","journal-title":"International Journal of Production Research"},{"key":"22_CR15","unstructured":"Pok-Son Kim. Terminologische Sprachen zur Repr\u00e4sentation und L\u00f6sung von ressourcenbeschr\u00e4nkten Ablaufplanungsproblemen mit Proze\u00dfvarianten. PhD thesis, Fachbereich Wirtschaftswissenschaften, Universit\u00e4t Frankfurt, 2001."},{"key":"22_CR16","unstructured":"W. K\u00f6nig, O. Wendt, and P. Rittgen. Das Wirtschaftsinformatik-Schwerpunktprogramm \u201cverteilte DV-Systeme in der Betriebswirtschaft\u201d der Deutschen Forschungsgemeinschaft-Frankfurt am Main, 1993-21 Bl. Technical Report 13, Institut f\u00fcr Wirtschaftsinformatik, 1993."},{"issue":"2","key":"22_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/mnsc.28.2.161","volume":"28","author":"I. Kurtulus","year":"1982","unstructured":"I. Kurtulus and E. W. Davis. Multi-Project Scheduling: Categorization of Heuristic Rules Performance. Management Science, 28(2):161\u2013172, 1982.","journal-title":"Management Science"},{"issue":"5","key":"22_CR18","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"A. Mingozzi, V. Maniezzo, and L. Ricciardelli, S. Bianco. An exact Algorithm for Project Scheduling with Resource Constraints based on a New Mathematical Formulation. Management Science, 44(5):714\u2013729, 1998.","journal-title":"Management Science"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/0377-2217(94)90319-0","volume":"72","author":"O. Oguz","year":"1994","unstructured":"O. Oguz and H. Bala. A Comparative Study of Computational Procedures for the Resource Constrained Project Scheduling Problem. European Journal of Operational Research, 72:406\u2013416, 1994.","journal-title":"European Journal of Operational Research"},{"key":"22_CR20","volume-title":"Algorithmen und Datenstrukturen","author":"T. Ottmann","year":"1990","unstructured":"T. Ottmann and P. Widmayer. Algorithmen und Datenstrukturen. Wissenschaftsverlag, Mannheim\/Wien\/Z\u00fcrich, 1990."},{"issue":"1","key":"22_CR21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"A. B. Pritsker","year":"1969","unstructured":"A. B. Pritsker, L. J. Watters, and P. M. Wolfe. Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16(1):93\u2013108, September, 1969.","journal-title":"Management Science"},{"key":"22_CR22","volume-title":"Technical Report SEKI Report SR-88-21","author":"M. Schmidt-Schau\u00df","year":"1988","unstructured":"M. Schmidt-Schau\u00df and G. Smolka. Attributive Concept Descriptions with Unions and Complements. Technical Report SEKI Report SR-88-21, FB Informatik, Universit\u00e4t Kaiserslautern, D-6750, Germany, 1988."},{"key":"22_CR23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/opre.18.2.263","volume":"10","author":"L. Schrage","year":"1970","unstructured":"L. Schrage. Solving Resource-Constrained Network Problems by Implicit Enumeration-Nonpreemptive Case. Operations Research, 10:263\u2013278, 1970.","journal-title":"Operations Research"},{"issue":"3","key":"22_CR24","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1080\/05695557808975212","volume":"10","author":"J. P. Stinson","year":"1978","unstructured":"J. P. Stinson, E. W. Davis, and B. M. Khumawala. Multiple Resource-Constrained Scheduling Using Branch and Bound. AIIE Transactions, 10(3):252\u2013259, 1978.","journal-title":"AIIE Transactions"},{"issue":"10","key":"22_CR25","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"F. B. Talbot","year":"1982","unstructured":"F. B. Talbot. Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case. Management Science, 28(10):1197\u20131210, 1982.","journal-title":"Management Science"},{"issue":"11","key":"22_CR26","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1287\/mnsc.24.11.1163","volume":"24","author":"F. B. Talbot","year":"1978","unstructured":"F. B. Talbot and J. H. Patterson. An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems. Management Science, 24(11):1163\u20131174, 1978.","journal-title":"Management Science"},{"key":"22_CR27","unstructured":"J. D. Wiest. The Scheduling of Large Projects with Limited Resources. PhD thesis, Carnegie Institute of Technology, 1963."},{"key":"22_CR28","unstructured":"D. Wood. An Isothetic View of Computational Geometry. Technical Report CS-84-01, Department of Computer Science, University of Waterloo, Jan. 1984."}],"container-title":["Lecture Notes in Computer Science","Conceptual Structures: Broadening the Base"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44583-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T03:00:13Z","timestamp":1550804413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44583-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423447","9783540445838"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-44583-8_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}