{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:40Z","timestamp":1725483880539},"publisher-location":"Berlin, Heidelberg","reference-count":63,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439592"},{"type":"electronic","value":"9783540456285"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45628-7_24","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:13:38Z","timestamp":1179206018000},"page":"655-675","source":"Crossref","is-referenced-by-count":1,"title":["Heterogeneous Scheduling and Rotation"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Sj\u00f6land","sequence":"first","affiliation":[]},{"given":"Per","family":"Kreuger","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Aronsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,17]]},"reference":[{"issue":"7","key":"24_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in Order to Solve Complex Scheduling and Placement Problems. In Mathematical Computer Modelling 17(7): pp. 57\u201373, Pergamon Press Ltd. 1993.","journal-title":"Mathematical Computer Modelling"},{"key":"24_CR2","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, 1993."},{"issue":"2","key":"24_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A Computational Study of the Job-Shop Scheduling Problem. In ORSA Journal of Computing, 3(2): 149\u2013156, 1991.","journal-title":"ORSA Journal of Computing"},{"key":"24_CR4","unstructured":"Aronsson, M., Kreuger, P., Lindblom, S., Holmberg, P.: ACOOR Rapport 1-TUFF: System\u00f6versikt och arkitektur. SICS Technical Report T2000\/06 (in Swedish)"},{"key":"24_CR5","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling Wiley & Sons, 1974."},{"key":"24_CR6","unstructured":"Baptiste, P., Pape, C.L.: A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. In the Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence Montreal, Quebec, pp. 400\u2013606, 1995."},{"key":"24_CR7","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Incorporating Efficient Operations Research Algorithms in Constraint Based Scheduling. In Proceedings of the First International Joint Workshop on Artificial Intelligence and Operations Research, Timberline Lodge, Oregon, 1995."},{"key":"24_CR8","unstructured":"Beck, J.C., Fox, M.S.: Supply Chain Co-ordination via Mediated Constraint Relaxation. In Proceedings of the First Canadian Workshop on Distributed Artificial Intelligence, May 15 1994."},{"issue":"12","key":"24_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing Global Constraints in CHIP. In Mathematical Computer Modelling 20(12): 97\u2013123, Pergamon Press Ltd. 1994.","journal-title":"Mathematical Computer Modelling"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N.: Global Constraints as Graph Properties on Structured Networks of Elementary Constraints of the Same Type. Research Report R:2000-01, SICS, 2000.","DOI":"10.1007\/3-540-45349-0_6"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Bodin, L., Golden, B.: Classification in Vehicle Routing and Scheduling. Networks, 11(97\u2013108), 1981.","DOI":"10.1002\/net.3230110204"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V","volume":"35","author":"L. Bianco","year":"1988","unstructured":"Bianco, L., Ricciardelli, S., Rinaldi, G., Sassano, A.: Scheduling Tasks with Sequence-dependent Processing Times. In Naval Research Logistics 35:177\u2013184, 1988.","journal-title":"Naval Research Logistics"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P. Brucker","year":"1996","unstructured":"Brucker, P., Thiele, O.: A Branch & Bound Method for the General-shop Problem with Sequence Dependent Setup-Times. In OR Spektrum, 18:145\u2013161, 1996.","journal-title":"OR Spektrum"},{"key":"24_CR14","first-page":"415","volume":"79","author":"M.R. Bussieck","year":"1997","unstructured":"Bussieck, M.R., Winter, T., Zimmermann, U.T.: Discrete Optimization in Public Rail Transport. In Mathematical Programming, 79:415\u2013444, 1997.","journal-title":"Mathematical Programming"},{"key":"24_CR15","volume-title":"Technical Report 95-25","author":"Y. Caseau","year":"1995","unstructured":"Caseau, Y., Laburthe, F.: Disjunctive Scheduling with Task Intervals. Technical Report 95-25, Laboratoire d\u2019Informatique de l\u2019Ecole Normale Sup\u00e9rieure LIENS, D\u00e9partement de Math\u00e9matiques ed d\u2019Informatique, 45 rue d\u2019Ulm, 75232 Paris Cedex 05, France, 1995."},{"key":"24_CR16","volume-title":"Technical Report","author":"Y. Caseau","year":"1996","unstructured":"Caseau, Y., Laburthe, F.: Improving Branch and Bound for Job-Shop Scheduling with Constraint Propagation. Technical Report, Laboratoire d\u2019Informatique de l\u2019Ecole Normale Sup\u00e9rieure LIENS, D\u00e9partement de Math\u00e9matiques ed d\u2019Informatique, 45 rue d\u2019Ulm, 75232 Paris Cedex 05, France, 1996."},{"issue":"2","key":"24_CR17","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J., Pinson, E.: An Algorithm for Solving the Job-Shop Scheduling Problem. In Management Science 35(2): 164\u2013176, 1989.","journal-title":"Management Science"},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J., Pinson, E.: A Practical Use of Jackson\u2019s Preemptive Schedule for Solving the Job-Shop Problem. In Annals of Operations Research, 26: 269\u2013287, 1990.","journal-title":"Annals of Operations Research"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Carlier, J., Pinson, E.: Adjustments of Heads and Tails for the Job-Shop Scheduling Problem. In the European Journal of Operational Research, 78:146\u2013161, 1994.","journal-title":"European Journal of Operational Research"},{"key":"24_CR20","unstructured":"Carlsson, M. et. al: SICStus Programming Manual at http:\/\/www.sics.se\/sicstus.html"},{"key":"24_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-61551-2_68","volume-title":"Second International Conference on Principles and Practice of Constraint Programming CP\u201996","author":"A.B.M.W. Cheng","year":"1996","unstructured":"Cheng, A.B.M.W., Lee, J.H.M., Wu, J.C.K.: Speeding up Constraint Propagation by Redundant Modeling. In Second International Conference on Principles and Practice of Constraint Programming CP\u201996, volume 1118 of LNCS, pp. 91\u2013103, Cambridge, Massachusetts, USA, Aug 1996. Springer-Verlag. Available in http:\/\/www.cse.cuhk.edu.hk\/~isl\/dPub2.html#Li ."},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., Toth, P., Vigo, D.: A Survey of Optimization Models for Train Routing and Scheduling. In Transportation Science, Nov 1998.","DOI":"10.1287\/trsc.32.4.380"},{"key":"24_CR23","unstructured":"Dalfiume, A., Lamma, E., Mello, P., Milano, M.: A Constraint Logic Programming Application to a Distributed Train Scheduling Problem. In Proceedings of the conference on the practical applications of prolog, pp. 163\u2013182, 1995."},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J. Desrosiers","year":"1984","unstructured":"Desrosiers, J., Soumis, F., Desrochers, M.: Routing With Time Windows by Column Generation. Networks, 14:545\u2013565, 1984.","journal-title":"Networks"},{"key":"24_CR25","volume-title":"Technical Report","author":"J. Drott","year":"1997","unstructured":"Drott, J., Hasselberg, E., Kohl, N., Kremer, M.: A Planning System for Locomotive Scheduling. Technical Report, Swedish State Railways, Stab T\u00e5gplanering, Stockholm, Sweden and Carmen Systems AB, Jul 1997."},{"key":"24_CR26","unstructured":"Fox, M.S., Sadeh, N.: Why Is Scheduling Difficult? In Proceedings of the European Conference on Artificial Intelligence, pp. 754\u2013765, 1990."},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Golden, B.L., Assad, A.A.: Vehicle Routing with Time-Window Constraints: Algorithmic Solutions. American Journal of Mathematical and Management Sciences, 6, 1986.","DOI":"10.1080\/01966324.1986.10737196"},{"key":"24_CR28","unstructured":"Gosselin, V.: Train Scheduling Using Constraint Programming Techniques. In 13th Conference on AI, Expert Systems and Natural Language, Avignon, 1993."},{"key":"24_CR29","first-page":"223","volume-title":"New Generation Computing","author":"S. Haridi","year":"1998","unstructured":"Haridi, S., Van Roy, P., Brand, P., Schulte, C.: Programming Languages for Distributed Applications. Invited paper in New Generation Computing, Vol. 16, No. 3, pp. 223\u2013261, 1998. Ohmsa Ltd. and Springer-Verlag., Tokyo."},{"key":"24_CR30","unstructured":"Haridi, S., Van Roy, P., Brand, P., Schulte, C., et.al.: http:\/\/www.mozart-oz.org\/ ."},{"key":"24_CR31","series-title":"Programming Logic Series","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryck Van","year":"1989","unstructured":"Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. Programming Logic Series. The MIT Press, Cambridge, MA, 1989."},{"key":"24_CR32","series-title":"M. Sc. Thesis","volume-title":"The Use of Abstractions to Solve Large Scheduling Problems","author":"P. Holmberg","year":"2000","unstructured":"Holmberg, P.: The Use of Abstractions to Solve Large Scheduling Problems. M. Sc. Thesis. KTH, The Royal Institute of Technology, Stockholm, Sweden, 2000."},{"key":"24_CR33","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(95)00111-5","volume":"85","author":"R.C. Holte","year":"1996","unstructured":"Holte, R.C., Mkadmi, T., Zimmer, R.M., MacDonald, A.J.: Speeding Up Problem Solving by Abstraction: A Graph Oriented Approach. Artificial Intelligence, 85:321\u2013361, 1996.","journal-title":"Artificial Intelligence"},{"key":"24_CR34","unstructured":"Holte, R.C., Perez, M.B., Zimmer, A.J., MacDonald, R.M.: Hierarchical a*: Searching Abstraction Hierarchies Efficiently. 1995."},{"key":"24_CR35","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1287\/ijoc.7.2.160","volume":"7","author":"C. Jordan","year":"1995","unstructured":"Jordan, C., Drex, A.L.: A Comparison of Constraint and Mixed-integer Programming Solvers for Batch Sequencing with Sequence-dependent Setups. In ORSA Journal on Computing 7: 160\u2013165, 1995.","journal-title":"ORSA Journal on Computing"},{"key":"24_CR36","unstructured":"Kreuger, P., Aronsson, M., Holmberg, P., Lindblom, S.: ACOOR Rapport 2-Oversikt av tekniker och metoder. SICS Technical Report T2000\/07 (in Swedish)"},{"key":"24_CR37","unstructured":"Kreuger, P., Aronsson, M., Lindblom, S.: Task Structure Abstraction. SICS Technical Report T2001:05"},{"key":"24_CR38","unstructured":"Kreuger, P., Carlsson, M., Sj\u00f6land, T., \u00c5str\u00f6m, E.: Sequence dependent task extensions for trip scheduling. SICS Technical report T2001:14."},{"key":"24_CR39","unstructured":"Kreuger, P., Carlsson, M., Olsson, J., Sj\u00f6land, T., \u00c5str\u00f6m, E.: The TUFF Train Scheduler-Trip Scheduling on Single Track Networks. In The Proceedings of the Workshop on Industrial Constraint-Directed Scheduling, at the Third International Conference on Principles and Practice of Constraint Programming, Schlo\u00df Hagenberg, Linz, Austria, 1997. Davenport, A. (ed.)."},{"key":"24_CR40","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1287\/opre.20.4.895","volume":"20","author":"A.G. Lockett","year":"1972","unstructured":"Lockett, A.G., Muhlemann, A.P.: A Scheduling Problem Involving Sequence Dependent Changeover Times. In Operations Research 20: 895\u2013902, 1972.","journal-title":"Operations Research"},{"key":"24_CR41","unstructured":"L\u00f6bel, A.: Optimal Vehicle Scheduling in Public Transit. Ph. D. thesis, TU Berlin, 1998. Shaker-Verlag, Aachen."},{"key":"24_CR42","unstructured":"Martin, C.: Logistics and Supply Chain Management Financial Times Pitman Publishing, 1992"},{"key":"24_CR43","volume-title":"Constraint Programming in Oz","author":"M. M\u00fcller","year":"1995","unstructured":"M\u00fcller, M., Popov, K., Schulte, C, W\u00fcrtz, J.: Constraint Programming in Oz. DFKI, Saarbr\u00fccken, Germany, 1995"},{"key":"24_CR44","volume-title":"Finite Domain Programming in Oz","author":"M. M\u00fcller","year":"1995","unstructured":"M\u00fcller, M., W\u00fcrtz, J.: Finite Domain Programming in Oz. DFKI, Saarbr\u00fccken, Germany, 1995."},{"key":"24_CR45","volume-title":"A Job-Shop Scheduling Model for the Single-Track Railway Scheduling Problem","author":"E. Oliveira","year":"2000","unstructured":"Oliveira, E., Smith, B.M.: A Job-Shop Scheduling Model for the Single-Track Railway Scheduling Problem University of Leeds, UK, 2000."},{"key":"24_CR46","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J.-Y. Potvin","year":"1993","unstructured":"Potvin, J.-Y., Rousseau, J.-M.: A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows. European Journal of Operational Research, 66:331\u2013340, 1993.","journal-title":"European Journal of Operational Research"},{"key":"24_CR47","unstructured":"Reeves, C., (ed.). Modern Heuristic Techniques for Combinatorial Optimization. McGraw-Hill International (UK) Ltd., 1995."},{"issue":"1","key":"24_CR48","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/opre.42.1.41","volume":"42","author":"C.C. Ribeiro","year":"1994","unstructured":"Ribeiro, C.C., Soumis, F.: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem. Operations Research, 42(1):41\u201352, 1994.","journal-title":"Operations Research"},{"key":"24_CR49","unstructured":"Rossi, F., et.al.: Constraint Logic Programming (a survey). In J. Siekmann, (ed.) Proc. of the ERCIM Working Group on Constraints \/Compulog Net Area on Constraint Programming Workshop, Cyprus. LNAI, oct 1999. Springer-Verlag."},{"key":"24_CR50","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A.: Concurrent Constraint Programming Languages. Ph.D. Thesis 1989, MIT Press, 1993.","DOI":"10.1145\/96709.96733"},{"key":"24_CR51","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M.W.P. Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.P.: Local Search in Routing Problems with Time Windows. Annals of Operations Research, 4:285\u2013305, 1985.","journal-title":"Annals of Operations Research"},{"key":"24_CR52","unstructured":"Scholtz, V.: Knowledge-Based Locomotive Planning for the Swedish Railway. Master\u2019s Thesis, Institut f\u00fcr Informatik, Universit\u00e4t Stuttgart and Swedish Institute of Computer Science (SICS), Nov 1998. ISRN: SICS-T-2000\/05-SE."},{"key":"24_CR53","unstructured":"Simonis, H.: A Problem Classification Scheme for Finite Domain Constraint Solving. In CP\u201996 Applications Workshop, COSYTEC SA, Orsay, France."},{"key":"24_CR54","unstructured":"Simonis, H.: Calculating Lower Bounds on a Resource Scheduling Problem. In Proceedings of the Workshop on Applications at the International Conference of Constraint Programming CP\u201996, 1996."},{"key":"24_CR55","unstructured":"Simonis, H.: Modeling Machine Set-up Time in CHIP. In Proceedings of the Workshop on Applications at the International Conference of Constraint Programming CP\u201996, 1996."},{"key":"24_CR56","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1287\/mnsc.36.4.467","volume":"36","author":"K.T. So","year":"1990","unstructured":"So, K.T.: Some Heuristics for Scheduling Jobs on Parallel Machines with Setups In Management Science 36: 467\u2013475, 1990.","journal-title":"Management Science"},{"key":"24_CR57","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/net.3230160205","volume":"16","author":"M.M. Solomon","year":"1986","unstructured":"Solomon, M.M.: On the Worst-case Performance of Some Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Networks, 16:161\u2013174, 1986.","journal-title":"Networks"},{"issue":"2","key":"24_CR58","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35(2):254\u2013265, March\u2013April 1987.","journal-title":"Operations Research"},{"issue":"1","key":"24_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"M.M. Solomon","year":"1988","unstructured":"Solomon, M.M., Desrosiers, J.: Time Window Constrained Routing and Scheduling Problems. Transportation Science, 22(1):1\u201313, 1988.","journal-title":"Transportation Science"},{"issue":"5","key":"24_CR60","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P.M. Thompson","year":"1993","unstructured":"Thompson, P.M., Psaraftis, H.N.: Cyclic Transfer Algorithms for Multi-Vehicle Routing and Scheduling Problems. Operations Research, 41(5):935\u2013946, 1993.","journal-title":"Operations Research"},{"key":"24_CR61","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, 1993."},{"key":"24_CR62","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1080\/00207547708943117","volume":"15","author":"C.H. White","year":"1977","unstructured":"White, C.H., Wilson, R.C.: Sequence Dependent Set-up Times and Job Sequencing. International Journal of Production Research 15, pp. 191\u2013202, 1977.","journal-title":"International Journal of Production Research"},{"key":"24_CR63","isbn-type":"print","volume-title":"Intelligent Planning-A Decomposition and Abstraction Based Approach","author":"Q. Yang","year":"1997","unstructured":"Yang, Q.: Intelligent Planning-A Decomposition and Abstraction Based Approach. ISBN 3-540-61901-1. Springer-Verlag, Berlin, 1997.","ISBN":"http:\/\/id.crossref.org\/isbn\/3540619011"}],"container-title":["Lecture Notes in Computer Science","Computational Logic: Logic Programming and Beyond"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45628-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T00:55:22Z","timestamp":1587516922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45628-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439592","9783540456285"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/3-540-45628-7_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}