{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:02:54Z","timestamp":1743040974335,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_3","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"37-49","source":"Crossref","is-referenced-by-count":17,"title":["A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times"],"prefix":"10.1007","author":[{"given":"Christian","family":"Artigues","sequence":"first","affiliation":[]},{"given":"Sana","family":"Belmokhtar","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Feillet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job-Shop Scheduling. Manag. Sci.\u00a034, 391\u2013401 (1988)","journal-title":"Manag. Sci."},{"key":"3_CR2","unstructured":"Artigues, C., Lopez, P., Ayache, P.D.: Schedule generation schemes and priority rules for the job-shop problem with sequence dependent setup times: Dominance properties and computational analysis. To appear in Annals of Operations Research (2003)"},{"key":"3_CR3","unstructured":"Artigues, C., Buscaylet, F.: A fast tabu search method for the job-shop problem with sequence-dependent setup times. In: Proceedings of the Metaheuristic International Conference MIC 2003, Kyoto (2003)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constrained-Based scheduling. In: Applying constraint programming to Scheduling Problems. Kluwer\u2019s International Series, pp. 19\u201337 (2001)","DOI":"10.1007\/978-1-4615-1479-4_2"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research\u00a093(1), 1\u201333 (1996)","journal-title":"European Journal of Operational Research"},{"key":"3_CR6","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. Operations Research Spektrum\u00a018, 145\u2013161 (1996)","journal-title":"Operations Research Spektrum"},{"key":"3_CR7","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, 164\u2013176 (1989)","journal-title":"Management Science"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0360-8352(02)00002-5","volume":"42","author":"I.-N. Choi","year":"2002","unstructured":"Choi, I.-N., Choi, D.-S.: A local search algorithm for jobshop scheduling problems with alternative operations ans sequence-dependent setups. Computers and Industrial Engineering\u00a042, 43\u201358 (2002)","journal-title":"Computers and Industrial Engineering"},{"key":"3_CR9","unstructured":"Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: Fifth International Conference on Artificial Intelligence Planning and Scheduling, Breckenbridge, Colorado, pp. 92\u2013101 (2000)"},{"key":"3_CR10","unstructured":"Focacci, F., Lodi, A.: Solving TSP with Time Windows with Constraints. In: International Conference on Logic Programming, pp. 515\u2013529 (1999)"},{"key":"3_CR11","unstructured":"ILOG SOLVER 5.2 User\u2019s Manuel, ILOG (2000)"},{"key":"3_CR12","unstructured":"ILOG SCHEDULER 5.2 User\u2019s Manuel, ILOG (2000)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science\u00a042, 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(98)00248-3","volume":"117","author":"G. Pesant","year":"1999","unstructured":"Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, J.-M.: An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows. European Journal of Operational Research\u00a0117, 253\u2013263 (1999)","journal-title":"European Journal of Operational Research"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","volume":"8","author":"R.J.M. Vaessens","year":"1996","unstructured":"Vaessens, R.J.M., Aarts, E.H.L., Lenstra, J.K.: Job Shop Scheduling by Local Search. INFORMS Journal on Computing\u00a08, 302\u2013317 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"3_CR16","first-page":"312","volume-title":"Proceedings of The Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002)","author":"P. Vil\u00edm","year":"2002","unstructured":"Vil\u00edm, P., Bart\u00e1k, R.: Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. In: Ghallab, Hertzberg, Traverso (eds.) Proceedings of The Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 312\u2013320. AAAI Press, Toulouse (2002)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:24:08Z","timestamp":1676075048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}