{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:44:59Z","timestamp":1742942699508,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961507"},{"type":"electronic","value":"9783319961514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-96151-4_20","type":"book-chapter","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T12:21:49Z","timestamp":1531830109000},"page":"228-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem"],"prefix":"10.1007","author":[{"given":"Idir","family":"Hamaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Houssin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Cafieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/moor.17.4.842","volume":"17","author":"R Roundy","year":"1992","unstructured":"Roundy, R.: Cyclic schedules for job shops with identical jobs. Math. Oper. Res. 17(4), 842\u2013865 (1992)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0377-2217(94)90332-8","volume":"72","author":"C Hanen","year":"1994","unstructured":"Hanen, C.: Study of a np-hard cyclic scheduling problem: the recurrent job-shop. Eur. J. Oper. Res. 72(1), 82\u2013101 (1994)","journal-title":"Eur. J. Oper. Res."},{"issue":"13","key":"20_CR3","doi-asserted-by":"publisher","first-page":"2561","DOI":"10.1016\/j.dam.2008.03.029","volume":"156","author":"P Brucker","year":"2008","unstructured":"Brucker, P., Kampmeyer, T.: A general model for cyclic machine scheduling problems. Discrete Appl. Math. 156(13), 2561\u20132572 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.ejor.2014.06.047","volume":"240","author":"A Che","year":"2015","unstructured":"Che, A., Feng, J., Chen, H., Chu, C.: Robust optimization for the cyclic hoist scheduling problem. Eur. J. Oper. Res. 240(3), 627\u2013636 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2), 351\u2013376 (2004)","journal-title":"Math. Program."},{"key":"20_CR6","unstructured":"Thiele, A., Terry, T., Epelman, M.: Robust linear optimization with recourse. Rapport Technique, 4\u201337 (2009)"},{"issue":"5","key":"20_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng, B., Zhao, L.: Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5), 457\u2013461 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10287-016-0249-2","volume":"13","author":"J Ayoub","year":"2016","unstructured":"Ayoub, J., Poss, M.: Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Manage. Sci. 13(2), 219\u2013239 (2016)","journal-title":"Comput. Manage. Sci."},{"key":"20_CR9","volume-title":"Graphs and Algorithms","author":"M Gondran","year":"1984","unstructured":"Gondran, M., Minoux, M., Vajda, S.: Graphs and Algorithms. Wiley, New York (1984)"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/1027084.1027085","volume":"9","author":"A Dasdan","year":"2004","unstructured":"Dasdan, A.: Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 9(4), 385\u2013418 (2004)","journal-title":"ACM Trans. Des. Autom. Electron. Syst. (TODAES)"},{"issue":"6","key":"20_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.3182\/20120523-3-RO-2023.00172","volume":"45","author":"M Fink","year":"2012","unstructured":"Fink, M., Rahhou, T.B., Houssin, L.: A new procedure for the cyclic job shop problem. IFAC Proc. Vol. 45(6), 69\u201374 (2012)","journal-title":"IFAC Proc. Vol."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Hamaz, I., Houssin, L., Cafieri, S.: Robust basic cyclic scheduling problem. Technical report (2017)","DOI":"10.1007\/s13675-018-0100-3"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96151-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T19:05:20Z","timestamp":1571598320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96151-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961507","9783319961514"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96151-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/isco2018.lip6.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}