{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:43:23Z","timestamp":1726062203566},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030375836"},{"type":"electronic","value":"9783030375843"}],"license":[{"start":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T00:00:00Z","timestamp":1576022400000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-37584-3_2","type":"book-chapter","created":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T01:02:43Z","timestamp":1575939763000},"page":"23-46","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-overlapping Sequence-Dependent Setup Scheduling with Dedicated Tasks"],"prefix":"10.1007","author":[{"given":"Marek","family":"Vlk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonin","family":"Novak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zdenek","family":"Hanzalek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Malapert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,11]]},"reference":[{"key":"2_CR1","unstructured":"Google\u2019s or-tools. \nhttps:\/\/developers.google.com\/optimization\/\n\n. Accessed 22 May 2019"},{"issue":"3","key":"2_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. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2), 149\u2013156 (1991)","journal-title":"ORSA J. Comput."},{"key":"2_CR4","unstructured":"Balas, E.: Project scheduling with resource constraints. Technical report, Carnegie-Mellon University, Pittsburgh, Pa, Management Sciences Research Group (1968)"},{"issue":"10","key":"2_CR5","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1080\/07408170309342349","volume":"35","author":"D Chen","year":"2003","unstructured":"Chen, D., Luh, P.B., Thakur, L.S., Moreno Jr., J.: Optimization-based manufacturing scheduling with multiple resources, setup requirements, and transfer lots. IIE Trans. 35(10), 973\u2013985 (2003)","journal-title":"IIE Trans."},{"key":"2_CR6","unstructured":"Gurobi: Constraints. \nhttp:\/\/www.gurobi.com\/documentation\/8.1\/refman\/constraints.html\n\n (2019). Accessed 12 June 2019"},{"key":"2_CR7","volume-title":"Constraint-Based Local Search","author":"PV Hentenryck","year":"2009","unstructured":"Hentenryck, P.V., Michel, L.: Constraint-Based Local Search. The MIT Press, Cambridge (2009)"},{"key":"2_CR8","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vilim, P.: Reasoning with conditional time-intervals. Part II: an algebraical model for resources. In: FLAIRS Conference, pp. 201\u2013206 (2009)"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vilim, P.: IBM ILOG CP optimizer for scheduling. Constraints 23(2), 210\u2013250 (2018)","journal-title":"Constraints"},{"key":"2_CR10","unstructured":"Lasserre, J.B., Queyranne, M.: Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling. In: Proceedings of the 2nd IPCO (Integer Programming and Combinatorial Optimization) Conference, pp. 136\u2013149 (1992)"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/S0377-2217(95)00376-2","volume":"100","author":"YH Lee","year":"1997","unstructured":"Lee, Y.H., Pinedo, M.: Scheduling jobs on parallel machines with sequence-dependent setup times. Eur. J. Oper. Res. 100(3), 464\u2013474 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR12","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 399\u2013419. Springer, Boston (2010). \nhttps:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13"},{"issue":"5\u20138","key":"2_CR13","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s00170-011-3318-2","volume":"57","author":"R Ruiz","year":"2011","unstructured":"Ruiz, R., Andres-Romano, C.: Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. Int. J. Adv. Manuf. Technol. 57(5\u20138), 777\u2013794 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ijpe.2007.10.001","volume":"113","author":"H Tempelmeier","year":"2008","unstructured":"Tempelmeier, H., Buschkuhl, L.: Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource. Int. J. Prod. Econ. 113(1), 401\u2013412 (2008)","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.ejor.2011.01.011","volume":"211","author":"E Vallada","year":"2011","unstructured":"Vallada, E., Ruiz, R.: A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 211(3), 612\u2013622 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10601-005-2814-0","volume":"10","author":"P Vilim","year":"2005","unstructured":"Vilim, P., Bartak, R., Cepek, O.: Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities. Constraints 10(4), 403\u2013425 (2005). \nhttps:\/\/doi.org\/10.1007\/s10601-005-2814-0","journal-title":"Constraints"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Vlk., M., Novak., A., Hanzalek., Z.: Makespan minimization with sequence-dependent non-overlapping setups. In: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, pp. 91\u2013101. INSTICC, SciTePress (2019). \nhttps:\/\/doi.org\/10.5220\/0007362700910101","DOI":"10.5220\/0007362700910101"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6377(94)90064-7","volume":"16","author":"ED Wikum","year":"1994","unstructured":"Wikum, E.D., Llewellyn, D.C., Nemhauser, G.L.: One-machine generalized precedence constrained scheduling problems. Oper. Res. Lett. 16(2), 87\u201399 (1994). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0167637794900647","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1023\/A:1022646725208","volume":"100","author":"X Zhao","year":"1999","unstructured":"Zhao, X., Luh, P.B., Wang, J.: Surrogate gradient algorithm for lagrangian relaxation. J. Optim. Theory Appl. 100(3), 699\u2013712 (1999)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37584-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T01:03:26Z","timestamp":1575939806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37584-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,11]]},"ISBN":["9783030375836","9783030375843"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37584-3_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019,12,11]]},"assertion":[{"value":"11 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICORES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research and Enterprise Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icores2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Extended and revised versions of 9 contributions were published in the Springer CCIS series","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}