{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:16:25Z","timestamp":1725488185492},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673507"},{"type":"electronic","value":"9783540462385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46238-4_13","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T22:05:23Z","timestamp":1185919523000},"page":"143-154","source":"Crossref","is-referenced-by-count":1,"title":["TimeNetManager \u2014 A Software Tool for Generating Random Temporal Networks"],"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":"Angelo","family":"Susi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"13_CR1","unstructured":"B. Bollob\u00e1s. Random Graphs. Academic Press, 1985."},{"key":"13_CR2","unstructured":"R. Cervoni, A. Cesta, and A. Oddi. Managing Dynamic Temporal Constraint Networks. In Artificial Intelligence Planning Systems: Proceedings of the Second International Conference (AIPS-94), 1994."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"A. Cesta and A. Oddi. Gaining Efficiency and Flexibility in the Simple Temporal Problem. In Proceedings of the Third International Workshop on Temporal Representation and Reasoning (TIME-96), 1996.","DOI":"10.1109\/TIME.1996.555676"},{"key":"13_CR4","unstructured":"A. Cesta, A. Oddi, and S.F. Smith. An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows. In Proceedings of the 16th Int. Joint Conference on Artificial Intelligence (IJCAI-99), 1999."},{"key":"13_CR5","unstructured":"A. Cesta, A. Oddi, and A. Susi. O-OSCAR: A Flexible Object-Oriented Architecture for Schedule Management in Space Applications. In Proceedings of the Fifth International Symposium on Artificial Intelligence, Robotics and Automation in Space (i-SAIRAS-99), 1999."},{"key":"13_CR6","unstructured":"C. Cheng and S.F. Smith. Generating Feasible Schedules under Complex Metric Constraints. In Proceedings 12th National Conference on AI (AAAI-94), 1994."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"B. De Reyck, E. Demeulemeester, and W. Herroelen. Algorithms for Scheduling Projects with Generalized Precedence Relations. In J. Weglarz, editor, Handbook on Recent Advances in Project Scheduling. Kluwer, 1998.","DOI":"10.1007\/978-1-4615-5533-9_4"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61\u201395, 1991.","journal-title":"Artificial Intelligence"},{"key":"13_CR9","unstructured":"I.P. Gent, A.S. Grant, E. MacIntyre, P. Prosser, P. Shaw, B. Smith, and T. Walsh. How Not To Do It. Technical Report 97.27, University of Leeds, School of Computer Studies, 1997."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"I.P. Gent, E. MacIntyre, P. Prosser, B. Smith, and T. Walsh. Random Constraint Satisfaction: Flaws and Structure. Technical Report 98.23, University of Leeds, School of Computer Studies, 1998.","DOI":"10.1007\/3-540-49481-2_24"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1287\/opre.42.2.201","volume":"42","author":"J.N. Hooker","year":"1994","unstructured":"J.N. Hooker. Needed: An Empirical Science of Algorithms. Operations Research, 42:201\u2013212, 1994.","journal-title":"Operations Research"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J.N. Hooker","year":"1996","unstructured":"J.N. Hooker. Testing Heuristics: We Have It All Wrong. Journal of Heuristics, 1:33\u201342, 1996.","journal-title":"Journal of Heuristics"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R. Kolish","year":"1995","unstructured":"R. Kolish, A. Sprecher, and A. Drexl. A Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems. Management Science, 41:1693\u20131703, 1995.","journal-title":"Management Science"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/32.601073","volume":"23","author":"B. A. Myers","year":"1997","unstructured":"B. A. Myers, R. G. McDaniel, R. C. Miller, A. Ferrency, A. Faulring, B. D. Kyle, A. Mickish, A. Klimovitski, and P. Doane. The Amulet Environment: New Models for Effective User Interface Software Development. IEEE Transactions on Software Engineering, 23:347\u2013365, 1997.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00137869","volume":"1","author":"B. Nebel","year":"1997","unstructured":"B. Nebel. Solving Hard Qualitative Temporal Reasoning Problems: Evaluating the Efficiency of Using the ORD-Horn Class. Constraints, 1(3):175\u2013190, 1997.","journal-title":"Constraints"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W.P.M. Nuijten","year":"1998","unstructured":"W.P.M. Nuijten and C. Le Pape. Constraint-Based Job Shop Scheduling with Ilog-Scheduler. Journal of Heuristics, 3:271\u2013286, 1998.","journal-title":"Journal of Heuristics"},{"key":"13_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-58950-3_371","volume-title":"Graph Drawing, DIMACS International Workshop GD\u201994, Proceedings","author":"G. Sander","year":"1995","unstructured":"G. Sander. Graph Layout through the VCG Tool. In R. Tamassia and I. G. Tollis, editors, Graph Drawing, DIMACS International Workshop GD\u201994, Proceedings, pages 194\u2013205. Lecture Notes in Computer Science 894, Springer Verlag, 1995."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"E. Taillard. Benchmarks for Basic Scheduling Problems. European Journal of Operational Research, 64:278\u2013285, 1993.","journal-title":"European Journal of Operational Research"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00123994","volume":"4","author":"P. Beek van","year":"1996","unstructured":"P. van Beek and D. W. Manchak. The Design and Experimental Analysis of Algorithms for Temporal Reasoning. Journal of Artificial Intelligence Research, 4:1\u201318, 1996.","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","AI*IA 99: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46238-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:29:39Z","timestamp":1556713779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46238-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673507","9783540462385"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46238-4_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}