{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:55Z","timestamp":1725557995509},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_19","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"147-161","source":"Crossref","is-referenced-by-count":13,"title":["Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach"],"prefix":"10.1007","author":[{"given":"Diarmuid","family":"Grimes","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C. Artigues","year":"2008","unstructured":"Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals OR\u00a0159(1), 135\u2013159 (2008)","journal-title":"Annals OR"},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10951-008-0067-7","volume":"11","author":"E. Balas","year":"2008","unstructured":"Balas, E., Simonetti, N., Vazacopoulos, A.: Job shop scheduling with setup times, deadlines and precedence constraints. J. of Scheduling\u00a011(4), 253\u2013262 (2008)","journal-title":"J. of Scheduling"},{"unstructured":"Beck, J.C., Davenport, A.J., Sitarski, E.M., Fox, M.S.: Texture-Based Heuristics for Scheduling Revisited. In: AAAI 1997, pp. 241\u2013248 (1997)","key":"19_CR3"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"J. Christopher Beck","year":"2007","unstructured":"Christopher Beck, J.: Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling. Journal of Artificial Intelligence Research\u00a029, 49\u201377 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: ECAI 2004, pp. 482\u2013486 (2004)","key":"19_CR5"},{"issue":"4","key":"19_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"},{"key":"19_CR7","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 and bound method for the general- shop problem with sequence-dependent setup times. Operation Research Spektrum\u00a018, 145\u2013161 (1996)","journal-title":"Operation Research Spektrum"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","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 Problem. Management Science\u00a035(2), 164\u2013176 (1989)","journal-title":"Management Science"},{"issue":"7","key":"19_CR9","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":"19_CR10","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1016\/j.cor.2004.09.009","volume":"33","author":"J.M. Framinan","year":"2006","unstructured":"Framinan, J.M., Schuster, C.J.: An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. Computers & OR\u00a033, 1200\u20131213 (2006)","journal-title":"Computers & OR"},{"unstructured":"Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proc. Tenth European Conference on Artificial Intelligence, ECAI 1992, pp. 31\u201335 (1992)","key":"19_CR11"},{"unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: AAAI 1998, pp. 431\u2013437 (1998)","key":"19_CR12"},{"key":"19_CR13","first-page":"116","volume-title":"ICAPS","author":"M.A. Gonz\u00e1lez","year":"2008","unstructured":"Gonz\u00e1lez, M.A., Vela, C.R., Varela, R.: A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In: ICAPS, pp. 116\u2013123. AAAI, Menlo Park (2008)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-02264-7_28","volume-title":"Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira\u2019s Scientific Legacy","author":"M.A. Gonz\u00e1lez","year":"2009","unstructured":"Gonz\u00e1lez, M.A., Vela, C.R., Varela, R.: Genetic algorithm combined with tabu search for the job shop scheduling problem with setup times. In: Mira, J., Ferr\u00e1ndez, J.M., \u00c1lvarez, J.R., de la Paz, F., Toledo, F.J. (eds.) IWINAC 2009. LNCS, vol.\u00a05601, pp. 265\u2013274. Springer, Heidelberg (2009)"},{"key":"19_CR15","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)"},{"doi-asserted-by":"crossref","unstructured":"Grimes, D., Hebrard, E., Malapert, A.: Closing the Open Shop: Contradicting Conventional Wisdom on Disjunctive Temporal Problems. In: 14th ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2009 (2009)","key":"19_CR16","DOI":"10.1007\/978-3-642-04244-7_33"},{"issue":"10","key":"19_CR17","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1057\/jors.1985.160","volume":"36","author":"A. Hodson","year":"1985","unstructured":"Hodson, A., Muhlemann, A.P., Price, D.H.R.: A microcomputer based solution to a practical scheduling problem. The Journal of the Operational Research Society\u00a036(10), 903\u2013914 (1985)","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly\u00a01(1), 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood Recording from Restarts. In: IJCAI 2007, pp. 131\u2013136 (2007)","key":"19_CR19"},{"issue":"3","key":"19_CR20","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. European Journal of Operational Research\u00a0143(3), 498\u2013517 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E. Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: An Advanced Tabu Search Algorithm for the Job Shop Problem. Journal of Scheduling\u00a08(2), 145\u2013159 (2005)","journal-title":"Journal of Scheduling"},{"unstructured":"Nuijten, W.: Time and Resource Constraint Scheduling: A Constraint Satisfaction Approach. PhD thesis, Eindhoven University of Technology (1994)","key":"19_CR22"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0377-2217(99)00285-4","volume":"126","author":"W.H.M. Raaymakers","year":"2000","unstructured":"Raaymakers, W.H.M., Hoogeveen, J.A.: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research\u00a0126(1), 131\u2013151 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"19_CR24","doi-asserted-by":"crossref","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":"19_CR25","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":"19_CR26","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":"19_CR27","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)"},{"unstructured":"Walsh, T.: Search in a Small World. In: IJCAI 1999, pp. 1172\u20131177 (1999)","key":"19_CR28"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-68155-7_21","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.-P. Watson","year":"2008","unstructured":"Watson, J.-P., Beck, J.C.: A Hybrid Constraint Programming \/ Local Search Approach to the Job-Shop Scheduling Problem. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 263\u2013277. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:13Z","timestamp":1606185553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}