{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:25:28Z","timestamp":1747578328082},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642859854"},{"type":"electronic","value":"9783642859830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/978-3-642-85983-0_7","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T02:56:12Z","timestamp":1383879372000},"page":"153-171","source":"Crossref","is-referenced-by-count":18,"title":["Applying Constraints for Scheduling"],"prefix":"10.1007","author":[{"given":"Mark","family":"Wallace","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Aggoun, A. and N. Beldiceanu (1992). Extending CHIP in order to solve complex scheduling problems. In Proc. JFPL,Lille."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"JF Allen","year":"1983","unstructured":"Allen, J. F. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM\n                           26, 832\u2013843.","journal-title":"Communications of the ACM"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0004-3702(84)90008-0","volume":"23","author":"JF Allen","year":"1984","unstructured":"Allen, J. F. (1984). Towards a general theory of action and time. Artificial Intelligence\n                           23, 123\u2013154.","journal-title":"Artificial Intelligence"},{"key":"7_CR4","volume-title":"Masters thesis","author":"G Baues","year":"1989","unstructured":"Baues, G. (1989) Einsatz der Constraint-Logic-Programming-Sprache CHIP bei der L\u00f6sung eines Job-Shop-Scheduling-Problems. Master\u2019s thesis, Technische Universit\u00e4t M\u00fcnchen, Germany."},{"key":"7_CR5","unstructured":"Beldiceanu, N. (1990). An example of introduction of global constraints in CHIP: Application to block theory problems. Technical Report TR-LP-49, ECRC."},{"key":"7_CR6","volume-title":"Software Practice and Experience 22(9)","author":"B Blake","year":"1992","unstructured":"Blake, B. (1992). Assignment of independent tasks to minimize completion time. Software Practice and Experience 22(9)."},{"key":"7_CR7","first-page":"2","volume-title":"Applying CHIP to a complex scheduling problem. Technical Report D3.1","author":"A Chamard","year":"1993","unstructured":"Chamard, A. and A. Fischler (1993). Applying CHIP to a complex scheduling problem. Technical Report D3.1. 2, Dassault Aviation. CHIC report."},{"key":"7_CR8","volume-title":"Technical report","author":"T-L Chew","year":"1992","unstructured":"Chew, T.-L., J.-M. David, L. Nguyen, and Y. Tourbier (1992). Le car sequencing problem revisit\u00e9: analyse d\u2019une utilisation du recuit simul\u00e9. Technical report, RENAULT, Service Syst\u00e8mes Experts."},{"key":"7_CR9","first-page":"2","volume-title":"Constraint handling in vehicle-fleet scheduling: Modelization and formulation using CHIP. Technical Report doc1","author":"N Christodoulou","year":"1992","unstructured":"Christodoulou, N. and V. Assimakopoulos (1992). Constraint handling in vehicle-fleet scheduling: Modelization and formulation using CHIP. Technical Report doc1. 2, CMSU. CHIC report."},{"key":"7_CR10","unstructured":"de Kleer, J. (1986). An assumption-based TMS. Artificial Intelligence 28,127\u2013162. Dean, T. and M. Boddy (1987). An analysis of time-dependent planning. In Proc. IJCAI."},{"key":"7_CR11","volume-title":"Fifth International Conference on Logic Programming (ICLP88)","author":"M Dincbas","year":"1988","unstructured":"Dincbas, M., H. Simonis, and P. Van Hentenryck (1988, August). Solving a cutting-stock problem in constraint programming In M. Press (Ed.), Fifth International Conference on Logic Programming (ICLP\u201988), Seattle, USA."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Dincbas, M., H. Simonis, and P. Van Hentenryck (1990). Solving large combinatorial problems in logic programming. Journal of Logic Programming\n                           8.","DOI":"10.1016\/0743-1066(90)90052-7"},{"key":"7_CR13","first-page":"693","volume-title":"The constraint logic programming language chip. hi Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS88)","author":"M Dincbas","year":"1988","unstructured":"Dincbas, M., P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier (1988, December). The constraint logic programming language chip. hi Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS\u201988), Tokyo, Japan, pp. 693\u2013702."},{"key":"7_CR14","unstructured":"Fox, M., N. Sadeh, and C. Baycan (1989). Constrained heuristic search. In Proc. IJCAI, pp. 309\u2013316."},{"key":"7_CR15","unstructured":"Friihwirth, T. (1992). Constraint simplification rules. Technical Report ECRC-9218, ECRC."},{"key":"7_CR16","unstructured":"Fr\u00fchwirth, T. and P. Hanschke (1993). Terminological reasoning with constraint handling rules. In First Workshop on the Principles and Practice of Constraint Programming, Newport, RI, USA."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Ignall, E. and L. Schrage (1965). Application of the branch and bound technique to some flow-shop scheduling problems. Operations Research Quarterly 13 (3).","DOI":"10.1287\/opre.13.3.400"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Jaffar, J. and J.-L. Lassez (1987). Constraint logic programming. In Proceedings of the Fourteenth ACM Symposium on Principles of Programming Languages (POPL\u201987), Munich, Germany.","DOI":"10.1145\/41625.41635"},{"key":"7_CR19","volume-title":"Novel search and constraints - an integration","author":"V Kiichenhoff","year":"1992","unstructured":"Kiichenhoff, V. (1992). Novel search and constraints - an integration. Technical report, ECRC. CHIC deliverable."},{"key":"7_CR20","unstructured":"Le Provost, T. (1993). Approximation in the framework of generalised propagation. Technical report, ECRC. Presented at the CLP workshop, FGCS\u201992, Tokyo, Japan."},{"key":"7_CR21","unstructured":"Le Provost, T. and M. G. Wallace (1993). Generalised constraint propagation over the CLP scheme. Journal of Logic Programming 16."},{"key":"7_CR22","volume-title":"Technical report","author":"C Lepape","year":"1991","unstructured":"Lepape, C. (1991, Jan). Constraint propagation in planning and scheduling. Technical report, Robotics Lab., Stanford Univ."},{"key":"7_CR23","unstructured":"Lepape, C. and S. F. Smith (1987). Management of temporal constraints for factory scheduling. In IFIP Working Conf. on Temporal Aspects in Information Systems."},{"key":"7_CR24","unstructured":"Maruyama, F., Y. Minoda, S. S., and Y. Takizawa (1992). Constraint satisfaction and optimisation using nogood justifications. In Proc. 2nd Pacific Rim Conf. on AI."},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Minton, S., M. D. Johnston, A. B. Philips, and P. Laird (1992) Minimizing con- flicts: a heuristic repair method for constraint satisfaction and scheduling problems.","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"7_CR26","unstructured":"Montanari, A., E. Maim, E. Ciapessoni, and E. Ratto (1992). Dealing with time granularity in the event calculus. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS \u201882), Tokyo, Japan."},{"key":"7_CR27","volume-title":"on Optimization","author":"H Miihlenbein","year":"1992","unstructured":"Miihlenbein, H. (1992). Parallel genetic algorithms and combinatorial optimization. SIAM J. on Optimization."},{"key":"7_CR28","first-page":"V","volume-title":"Le Probleme de Job Shop. Ph. D. thesis","author":"E Pinson","year":"1988","unstructured":"Pinson, E. (1988). Le Probleme de Job Shop. Ph. D. thesis, Univ. Paris V I."},{"key":"7_CR29","volume-title":"Technical Report CMU-RI-TR-89-2","author":"N Sadeh","year":"1989","unstructured":"Sadeh, N. and M. S. Fox (1989). Preference propagation in temporal\/capacity constraint graphs. Technical Report CMU-RI-TR-89\u20132, Robotics Institute, Carnegie Mellon Univ."},{"key":"7_CR30","volume-title":"IEEE Expert","author":"KP Sycara","year":"1991","unstructured":"Sycara, K. P., S. Roth, N. Sadeh, and M. Fox (1991). Resource allocation in distributed factory scheduling. IEEE Expert."},{"key":"7_CR31","unstructured":"Van Hentenryck, P., Y. Deville, and C.-M. Teng (1992). A generic arc-consistency algorithm and its specialisations. Artificial Intelligence 57."},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., H. Simonis, and M. Dincbas (1992). Constraint satisfaction using constraint logic programming. Artificial Intelligence 58.","DOI":"10.1016\/0004-3702(92)90006-J"},{"key":"7_CR33","unstructured":"Vilain, M. and H. Kautz (1986). Constraint propagation algorithms for temporal reasoning. In Proc. AAAI-86, pp. 377\u2013382."}],"container-title":["NATO ASI Series","Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-85983-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T03:39:07Z","timestamp":1558669147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-85983-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783642859854","9783642859830"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-85983-0_7","relation":{},"ISSN":["0258-1248"],"issn-type":[{"type":"print","value":"0258-1248"}],"subject":[],"published":{"date-parts":[[1994]]}}}