{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:12:06Z","timestamp":1725459126414},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601166"},{"type":"electronic","value":"9783540494430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0035991","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:13:56Z","timestamp":1138202036000},"page":"584-594","source":"Crossref","is-referenced-by-count":2,"title":["Effective scheduling of tasks under weak temporal interval constraints"],"prefix":"10.1007","author":[{"given":"Frank D.","family":"Anger","sequence":"first","affiliation":[]},{"given":"Rita V.","family":"Rodriguez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"issue":"11","key":"59_CR1","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J. Allen","year":"1983","unstructured":"Allen, J. Maintaining Knowledge about Temporal Intervals. Comm. of ACM 26, 11 (1983), pp. 832\u2013843.","journal-title":"Comm. of ACM"},{"issue":"1","key":"59_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0743-7315(90)90116-7","volume":"9","author":"F. Anger","year":"1990","unstructured":"Anger, F., Hwang, J., and Chow, Y. Scheduling with Sufficient Loosely Coupled Processors. Jour. of Parallel and Distributed Computing 9, 1 (May 1990), pp. 87\u201392.","journal-title":"Jour. of Parallel and Distributed Computing"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Anger, F., Rodriguez, R., and Hadlock, F. Temporal Consistency Checking of Natural Language Specifications, Applications of Artificial Intelligence III: Proceedings of SPIE 635, Orlando, FL, (Apr 1990), pp. 572\u2013580.","DOI":"10.1117\/12.21105"},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"Anger, F., Ladkin, P., and Rodriguez, R. Atomic Temporal Interval Relations in Branching Time: Calculation and Application. Applications of Artificial Intelligence IX, Proceedings of SPIE, Orlando, (Apr 1991), pp. 122\u2013136.","DOI":"10.1117\/12.45459"},{"key":"59_CR5","unstructured":"Anger, F., Allen, J., and Rodriguez, R. Determined or Under-Determined Temporal Interval Relation Constraints: A Scheduling Strategy. UWF Technical Report CSD-TR No. 93-009, Univ. of W. Florida, Pensacola, FL, Oct 93."},{"key":"59_CR6","unstructured":"Anger, F., Allen, J., and Rodriguez, R. Optimal and Heuristic Task Scheduling under Qualitative Temporal Constraints. Proceedings IEA\/AIE-94, (Jun 1994), pp. 115\u2013122."},{"key":"59_CR7","volume-title":"Introduction to Sequencing and Scheduling","author":"K. Baker","year":"1974","unstructured":"Baker, K. Introduction to Sequencing and Scheduling. Wiley & Sons, New York, 1974."},{"key":"59_CR8","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/76359.76360","volume":"36","author":"T. Dean","year":"1989","unstructured":"Dean, T. Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases. Journal of ACM 36, (1989), pp. 687\u2013718.","journal-title":"Journal of ACM"},{"key":"59_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., and Pearl, J. Temporal Constraint Networks. Artificial Intelligence Journal 49, (1991), pp. 61\u201395.","journal-title":"Artificial Intelligence Journal"},{"key":"59_CR10","unstructured":"Freuder, E. and Hubbe, P. Using Inferred Disjunctive Constraints to Decompose Constraint Satisfaction Problems. Proceedings of the 13th IJCAI, Chambery, France, Sep 1993, pp. 254\u2013260."},{"key":"59_CR11","unstructured":"Ladkin, P. Satisfying First-Order Constraints about Time Intervals. Proceedings of 7th National Conf. on Artificial Intelligence, St. Paul, MN, (Aug 1988), pp. 512\u2013517."},{"key":"59_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0004-3702(92)90106-8","volume":"57","author":"P. Ladkin","year":"1992","unstructured":"Ladkin, P. and Reinefeld, A. Effective Solution of Qualitative Interval Constraint Problems. Artificial Intelligence 57, (1992), pp. 105\u2013124.","journal-title":"Artificial Intelligence"},{"key":"59_CR13","volume-title":"Technical Report BW 138-81","author":"B. Lageweg","year":"1981","unstructured":"Lageweg, B., Lawler, E., Lenstra, L., and Rinnooy Kan, A. Computer Aided Complexity Classification of Deterministic Scheduling Problems. Technical Report BW 138-81, Sichting Mathematisch Centrum, Amsterdam, 1981."},{"key":"59_CR14","first-page":"367","volume-title":"Deterministic and Stochastic Scheduling","author":"E. Lawler","year":"1982","unstructured":"Lawler, E., Lenstra, J., and Rinnooy Kan, A. Recent Developments in Deterministic Sequencing and Scheduling: A Survey. In Deterministic and Stochastic Scheduling, M. Dempster, et al., eds., D. Reidel Publ., Dordrecht, Holland, 1982, pp. 367\u2013374."},{"key":"59_CR15","unstructured":"Ligozat, G. On Generalized Interval Calculi. Proceedings of the Ninth National Conference on Artificial Intelligence, Anaheim, CA, Jul 1991, pp. 234\u2013240."},{"key":"59_CR16","unstructured":"Rodriguez, R. and Anger, F. Intervals in Relativistic Time. Proceedings on Information Processing and Management of Uncertainty in Knowledge-Based Systems: IPMU, Mallorca, (Jul 1992), pp. 525\u2013529."},{"key":"59_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00871721","volume":"3","author":"R. Rodriguez","year":"1993","unstructured":"Rodriguez, R. A Relativistic Temporal Algebra for Efficient Design of Distributed Systems. Journal of Applied Intelligence 3, (1993), pp. 31\u201345.","journal-title":"Journal of Applied Intelligence"},{"key":"59_CR18","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J. Ullman","year":"1975","unstructured":"Ullman, J. NP-Complete Scheduling Problems. Journal of Computer and System Sciences 10, (1975), pp. 384\u2013393.","journal-title":"Journal of Computer and System Sciences"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"van Beek, P. Exact and Approximate Reasoning about Qualitative Temporal Relations. PhD Thesis, University of Alberta, 1990.","DOI":"10.1111\/j.1467-8640.1990.tb00130.x"},{"key":"59_CR20","first-page":"1","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"J. Benthem van","year":"1989","unstructured":"van Benthem, J. Time, Logic and Computation. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, G. Goos and J. Hartmanis, eds., Springer-Verlag, New York, 1989, pp. 1\u201349."},{"key":"59_CR21","unstructured":"Vilain, M., Kautz, H. Constraint Propagation Algorithms for Temporal Reasoning. Proceedings of the 5th Natl. Conf. on Artificial Intelligence, Pittsburg, PA, (Aug. 1986), pp. 377\u2013382."}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Computing \u2014 IPMU '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:34:07Z","timestamp":1555425247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601166","9783540494430"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0035991","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}