{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:27:48Z","timestamp":1743121668676,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_7","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"89-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Unary Resource with Transition Times"],"prefix":"10.1007","author":[{"given":"Cyrille","family":"Dejemeppe","sequence":"first","affiliation":[]},{"given":"Sascha","family":"Van Cauwelaert","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"7_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc, Upper Saddle River (1993)"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C., Cheng, T.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3), 985\u20131032 (2008)","journal-title":"European Journal of Operational Research"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-24664-0_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C Artigues","year":"2004","unstructured":"Artigues, C., Belmokhtar, S., Feillet, D.: A new exact solution algorithm for the job shop problem with sequence-dependent setup times. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 37\u201349. Springer, Heidelberg (2004)"},{"key":"7_CR4","unstructured":"Artigues, C., Buscaylet, F., Feillet, D.: Lower and upper bound for the job shop scheduling problem with sequence-dependent setup times. In: Proceedings of the Second Multidisciplinary International Conference on Scheduling: Theory and Applications, MISTA 2005 (2005)"},{"issue":"1","key":"7_CR5","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 of Operations Research 159(1), 135\u2013159 (2008)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"7_CR6","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. Journal of Scheduling 11(4), 253\u2013262 (2008)","journal-title":"Journal of Scheduling"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems, vol. 39. Springer Science & Business Media (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"7_CR8","unstructured":"Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: AIPS, pp. 92\u2013101 (2000)"},{"key":"7_CR9","unstructured":"Gagn\u00e9, C., Price, W.L., Gravel, M.: Scheduling a single machine with sequence dependent setup time using ant colony optimization. Facult\u00e9 des sciences de l\u2019administration de l\u2019Universit\u00e9 Laval, Direction de la recherche (2001)"},{"key":"7_CR10","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 (2008)"},{"key":"7_CR11","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. 6140, pp. 147\u2013161. Springer, Heidelberg (2010)"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society 7(1), 48\u201350 (1956)","journal-title":"Proceedings of the American Mathematical society"},{"key":"7_CR13","unstructured":"Oddi, A., Rasconi, R., Cesta, A., Smith, S.F.: Exploiting iterative flattening search to solve job shop scheduling problems with setup times. PlanSIG2010, p. 133 (2010)"},{"key":"7_CR14","unstructured":"OscaR Team: OscaR: Scala in OR (2012). https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"7_CR15","unstructured":"Tahar, D.N., Yalaoui, F., Amodeo, L., Chu, C.: An ant colony system minimizing total tardiness for hybrid job shop scheduling problem with sequence dependent setup times and release dates. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, pp. 469\u2013478 (2005)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Van Cauwelaert, S., Lombardi, M., Schaus, P.: Understanding the potential of propagators. In: Proceedings of the Twelfth International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming (2015)","DOI":"10.1007\/978-3-319-18008-3_29"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-24664-0_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Vil\u00edm","year":"2004","unstructured":"Vil\u00edm, P.: $$O\\,(nlog\\, n)$$ filtering algorithms for unary resource constraint. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 335\u2013347. Springer, Heidelberg (2004)"},{"key":"7_CR18","unstructured":"Vil\u0131m, P.: Global constraints in scheduling. Ph.D. thesis, Charles University in Prague, Faculty of Mathematics and Physics, Department of Theoretical Computer Science and Mathematical Logic, KTIML MFF, Universita Karlova, Praha (2007)"},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10601-005-2814-0","volume":"10","author":"P Vil\u00edm","year":"2005","unstructured":"Vil\u00edm, P., Bart\u00e1k, R., \u010cepek, O.: Extension of o (n log n) filtering algorithms for the unary resource constraint to optional activities. Constraints 10(4), 403\u2013425 (2005)","journal-title":"Constraints"},{"key":"7_CR20","first-page":"3205","volume":"154","author":"A Wolf","year":"2009","unstructured":"Wolf, A.: Constraint-based task scheduling with sequence dependent setup times, time windows and breaks. GI Jahrestagung 154, 3205\u20133219 (2009)","journal-title":"GI Jahrestagung"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1007\/978-3-642-40627-0_64","volume-title":"Principles and Practice of Constraint Programming","author":"S Zampelli","year":"2013","unstructured":"Zampelli, S., Vergados, Y., Van Schaeren, R., Dullaert, W., Raa, B.: The berth allocation and quay crane assignment problem using a CP approach. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 880\u2013896. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T18:05:23Z","timestamp":1675274723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}