{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:02Z","timestamp":1725603422834},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_28","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"356-372","source":"Crossref","is-referenced-by-count":5,"title":["Models and Strategies for Variants of the Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Diarmuid","family":"Grimes","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","first-page":"220","volume":"24","author":"C. Artigues","year":"2011","unstructured":"Artigues, C., Huguet, M.-J., Lopez, P.: Generalized Disjunctive Constraint Propagation for Solving the Job Shop Problem with Time Lags. EAAI\u00a024(2), 220\u2013231 (2011)","journal-title":"EAAI"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1016\/j.cor.2006.05.009","volume":"35","author":"P. Baptiste","year":"2008","unstructured":"Baptiste, P., Flamini, M., Sourd, F.: Lagrangian Bounds for Just-in-Time Job-shop Scheduling. Computers & OR\u00a035(3), 906\u2013915 (2008)","journal-title":"Computers & OR"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"J.C. Beck","year":"2007","unstructured":"Beck, J.C.: Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling. JAIR\u00a029, 49\u201377 (2007)","journal-title":"JAIR"},{"issue":"1-4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"J.C. Beck","year":"2003","unstructured":"Beck, J.C., Refalo, P.: A Hybrid Approach to Scheduling with Earliness and Tardiness Costs. Annals OR\u00a0118(1-4), 49\u201371 (2003)","journal-title":"Annals OR"},{"key":"28_CR5","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: ECAI, pp. 482\u2013486 (2004)"},{"issue":"4","key":"28_CR6","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1016\/j.cie.2008.09.023","volume":"56","author":"W. Bozejko","year":"2009","unstructured":"Bozejko, W., Makuchowski, M.: A Fast Hybrid Tabu Search Algorithm for the No-wait Job Shop Problem. Computers & Industrial Engineering\u00a056(4), 1502\u20131509 (2009)","journal-title":"Computers & Industrial Engineering"},{"issue":"7","key":"28_CR7","doi-asserted-by":"publisher","first-page":"2331","DOI":"10.1016\/j.cor.2006.11.007","volume":"35","author":"A. Caumond","year":"2008","unstructured":"Caumond, A., Lacomme, P., Tchernev, N.: A Memetic Algorithm for the Job-shop with Time-lags. Computers & OR\u00a035(7), 2331\u20132356 (2008)","journal-title":"Computers & OR"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Danna, E., Perron, L.: Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs. Technical report, ILOG (2003)","DOI":"10.1007\/978-3-540-45193-8_59"},{"key":"28_CR9","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Integrating Mixed Integer Programming and Local Search: A Case Study on Job-Shop Scheduling Problems. In: CPAIOR (2003)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T. Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy Clause Generation Reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 352\u2013366. Springer, Heidelberg (2009)"},{"key":"28_CR11","unstructured":"Grimes, D.: A Study of Adaptive Restarting Strategies for Solving Constraint Satisfaction Problems. In: AICS (2008)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-13520-0_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"D. Grimes","year":"2010","unstructured":"Grimes, D., Hebrard, E.: Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 147\u2013161. Springer, Heidelberg (2010)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-04244-7_33","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"D. Grimes","year":"2009","unstructured":"Grimes, D., Hebrard, E., Malapert, A.: Closing the Open Shop: Contradicting Conventional Wisdom. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 400\u2013408. Springer, Heidelberg (2009)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Kelbel, J., Hanz\u00e1lek, Z.: Solving production scheduling with earliness\/tardiness penalties by constraint programming. J. Intell. Manuf. (2010)","DOI":"10.1007\/s10845-009-0318-2"},{"key":"28_CR15","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood Recording from Restarts. In: IJCAI, pp. 131\u2013136 (2007)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: ISTCS, pp. 128\u2013133 (1993)","DOI":"10.1109\/ISTCS.1993.253477"},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A. Mascis","year":"2002","unstructured":"Mascis, A., Pacciarelli, D.: Job-shop Scheduling with Blocking and No-wait Constraints. EJOR\u00a0143(3), 498\u2013517 (2002)","journal-title":"EJOR"},{"key":"28_CR18","volume-title":"Heuristic Scheduling Systems","author":"T.E. Morton","year":"1993","unstructured":"Morton, T.E., Pentico, D.W.: Heuristic Scheduling Systems. John Wiley and Sons, Chichester (1993)"},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1057\/jors.1994.65","volume":"45","author":"C. Rajendran","year":"1994","unstructured":"Rajendran, C.: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan. The Journal of the Operational Research Society\u00a045(4), 472\u2013478 (1994)","journal-title":"The Journal of the Operational Research Society"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00186-005-0056-y","volume":"63","author":"C.J. Schuster","year":"2006","unstructured":"Schuster, C.J.: No-wait Job Shop Scheduling: Tabu Search and Complexity of Problems. Math. Meth. Oper. Res.\u00a063, 473\u2013491 (2006)","journal-title":"Math. Meth. Oper. Res."},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1007\/978-3-642-04244-7_58","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"A. Schutt","year":"2009","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.: Why Cumulative Decomposition Is Not as Bad as It Sounds. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 746\u2013761. Springer, Heidelberg (2009)"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/11889205_42","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"N. Tamura","year":"2006","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling Finite Linear CSP into SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 590\u2013603. Springer, Heidelberg (2006)"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"V\u00e1zquez, M., Whitley, L.D.: A comparison of genetic algorithms for the dynamic job shop scheduling problem. In: GECCO, p. 1011 (2000)","DOI":"10.1007\/3-540-45356-3_30"},{"key":"28_CR24","unstructured":"Vil\u00edm, P.: Filtering Algorithms for the Unary Resource Constraint. Archives of Control Sciences\u00a018(2) (2008)"},{"key":"28_CR25","unstructured":"Walsh, T.: Search in a Small World. In: IJCAI, pp. 1172\u20131177 (1999)"},{"key":"28_CR26","unstructured":"Watson, J.-P., Barbulescu, L., Howe, A.E., Whitley, L.D.: Algorithm performance and problem structure for flow-shop scheduling. In: AAAI, pp. 688\u2013695 (1999)"},{"issue":"3","key":"28_CR27","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1287\/opre.20.3.689","volume":"20","author":"D.A. Wismer","year":"1972","unstructured":"Wismer, D.A.: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues. Operations Research\u00a020(3), 689\u2013697 (1972)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:36:57Z","timestamp":1560530217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}