{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:47:42Z","timestamp":1725475662996},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678663"},{"type":"electronic","value":"9783540446576"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720246_17","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T16:15:39Z","timestamp":1167408939000},"page":"213-225","source":"Crossref","is-referenced-by-count":0,"title":["Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Amedeo","family":"Cesta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Oddi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.P.M.: Satifiability Tests and Time-Bound Adjustments for Cumulative Scheduling Problems. Technical report, Univerity of Compi\u00e9gnie, in Annals of Operations Research (1997) (to appear)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling Project Networks with Resource Constraints and Time Windows. Annals of Operations Research\u00a016, 201\u2013240 (1988)","journal-title":"Annals of Operations Research"},{"key":"17_CR3","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Profile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. In: Proceedings of the Fourth Int. Conf. on Artificial Intelligence Planning Systems, AIPS 1998 (1998)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Scheduling Multi-Capacitated Resources under Complex Temporal Constraints. Technical Report CMU-RI-TR-98-17, Robotics Institute, Carnegie Mellon University (1998)","DOI":"10.1007\/3-540-49481-2_36"},{"key":"17_CR5","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows. In: Proceedings of the 16th Int. Joint Conference on Artificial Intelligence, IJCAI 1999 (1999)"},{"key":"17_CR6","unstructured":"Cheng, C., Smith, S.F.: Generating Feasible Schedules under Complex Metric Constraints. In: Proceedings 12th National Conference on AI, AAAI 1994 (1994)"},{"key":"17_CR7","unstructured":"Laborie, P., Ghallab, M.: Planning with Sharable Resource Constraints. In: Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 1995 (1995)"},{"key":"17_CR8","unstructured":"Nuijten, W.P.M.: Time and Resource Constrained Scheduling - A Constraint Satisfaction Approach. PhD thesis, Eindhoven University of Technology, The Netherlands (1994)"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","volume":"90","author":"W.P.M. Nuijten","year":"1996","unstructured":"Nuijten, W.P.M., Aarts, E.H.L.: A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling. European Journal of Operational Research\u00a090(2), 269\u2013284 (1996)","journal-title":"European Journal of Operational Research"},{"key":"17_CR10","unstructured":"Oddi, A., Smith, S.F.: Stochastic Procedures for Generating Feasible Schedules. In: Proceedings 14th National Conference on AI, AAAI 1997 (1997)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for Basic Scheduling Problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in AI Planning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720246_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:38:09Z","timestamp":1556019489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720246_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678663","9783540446576"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/10720246_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}