{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:21:05Z","timestamp":1743002465528,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_40","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"512-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5403-6576","authenticated-orcid":false,"given":"Yuan","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1694-7712","authenticated-orcid":false,"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6999-4144","authenticated-orcid":false,"given":"Xinbo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3311-1105","authenticated-orcid":false,"given":"Yan","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"issue":"2","key":"40_CR1","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.ejor.2018.04.019","volume":"271","author":"G Mosheiov","year":"2018","unstructured":"Mosheiov, G., Sarig, A., Strusevich, V.A., Mosheiff, J.: Two-machine flow shop and open shop scheduling problems with a single maintenance window. Eur. J. Oper. Res. 271(2), 388\u2013400 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"3\u20134","key":"40_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C Lee","year":"1996","unstructured":"Lee, C.: Machine scheduling with an availability constraint. J. Global Optim. 9(3\u20134), 395\u2013416 (1996)","journal-title":"J. Global Optim."},{"issue":"2","key":"40_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/S0377-2217(97)00452-9","volume":"114","author":"C Lee","year":"1999","unstructured":"Lee, C.: Two-machine flowshop scheduling with availability constraints. Eur. J. Oper. Res. 114(2), 420\u2013429 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"40_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-6377(01)00079-7","volume":"29","author":"J Breit","year":"2001","unstructured":"Breit, J., Schmidt, G., Strusevich, V.A.: Two-machine open shop scheduling with an availability constraint. Oper. Res. Lett. 29(2), 65\u201377 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"40_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.cor.2007.10.013","volume":"36","author":"M Kubzin","year":"2009","unstructured":"Kubzin, M., Potts, C., Strusevich, V.A.: Approximation results for flow shop scheduling problems with machine availability constraints. Comput. Oper. Res. 36(2), 379\u2013390 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001860200267","volume":"57","author":"J Breit","year":"2003","unstructured":"Breit, J., Schmidt, G., Strusevich, V.A.: Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Methods Oper. Res. 57(2), 217\u2013234 (2003)","journal-title":"Math. Methods Oper. Res."},{"key":"40_CR7","doi-asserted-by":"publisher","unstructured":"Yuan, Y., Lan, Y., Ding, N., Han, X.: A PTAS for non-resumable open shop scheduling with an availability constraint. J. Comb. Optim., 1\u201313 (2021). https:\/\/doi.org\/10.1007\/s10878-021-00773-7","DOI":"10.1007\/s10878-021-00773-7"},{"issue":"1","key":"40_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1002\/nav.20122","volume":"53","author":"M Kubzin","year":"2006","unstructured":"Kubzin, M., Strusevich, V., Breit, J., Schmidt, G.: Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints. Nav. Res. Logist. 53(1), 16\u201323 (2006)","journal-title":"Nav. Res. Logist."},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"E Lawler","year":"1993","unstructured":"Lawler, E., Lenstra, J., Kan, A., Shmoys, D.: Sequencing and scheduling: algorithms and complexity. Handbooks Oper. Res. Management Sci. 4, 445\u2013522 (1993)","journal-title":"Handbooks Oper. Res. Management Sci."},{"issue":"4","key":"40_CR10","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzalez","year":"1976","unstructured":"Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23(4), 665\u2013679 (1976)","journal-title":"J. ACM"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1018964131329","volume":"83","author":"VA Strusevich","year":"1998","unstructured":"Strusevich, V.A.: A greedy open shop heuristic with job priorities. Ann. Oper. Res. 83, 253\u2013270 (1998)","journal-title":"Ann. Oper. Res."},{"issue":"1\u20132","key":"40_CR12","first-page":"191","volume":"82","author":"S Sevastianov","year":"1998","unstructured":"Sevastianov, S., Woeginger, G.: Makespan minimization in open shops: a polynomial time approximation scheme. Math. Program. 82(1\u20132), 191\u2013198 (1998)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:08:02Z","timestamp":1639354082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}