{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:46:17Z","timestamp":1743075977246,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031229893"},{"type":"electronic","value":"9783031229909"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22990-9_6","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T01:22:43Z","timestamp":1672536163000},"page":"76-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An 11\/7 \u2014 Approximation Algorithm for\u00a0Single Machine Scheduling Problem with\u00a0Release and\u00a0Delivery Times"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6621-0911","authenticated-orcid":false,"given":"Natalia","family":"Grigoreva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawner, E.L., Rinnoy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling. A survey. Ann. Disc. Math. 5(10), 287\u2013326 (1979)","key":"6_CR1","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Disc. Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Disc. Math."},{"key":"6_CR3","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. Ann. Oper. Res. 159, 135\u2013159 (2008)","journal-title":"Ann. Oper. Res."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.omega.2013.02.005","volume":"42","author":"C Chandra","year":"2014","unstructured":"Chandra, C., Liu, Z., He, J., Ruohonen, T.: A binary branch and bound algorithm to minimize maximum scheduling cost. Omega 42, 9\u201315 (2014)","journal-title":"Omega"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10951-006-0325-5","volume":"10","author":"K Sourirajan","year":"2007","unstructured":"Sourirajan, K., Uzsoy, R.: Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication. J. Sched. 10, 41\u201365 (2007)","journal-title":"J. Sched."},{"unstructured":"Schrage, L.: Optimal solutions to resource constrained network scheduling problems ( unpublished manuscript) (1971)","key":"6_CR6"},{"issue":"6","key":"6_CR7","first-page":"445","volume":"28","author":"CN Potts","year":"1980","unstructured":"Potts, C.N.: Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper. Res. Int. Journal 28(6), 445\u2013462 (1980)","journal-title":"Oper. Res. Int. Journal"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"LA Hall","year":"1992","unstructured":"Hall, L.A., Shmoys, D.B.: Jackson\u2019s rule for single-machine scheduling: making a good heuristic better. Math. Oper. Res. 17(1), 22\u201335 (1992)","journal-title":"Math. Oper. Res."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0166-218X(92)00110-8","volume":"48","author":"E Nowicki","year":"1994","unstructured":"Nowicki, E., Smutnicki, C.: An approximation algorithm for a single-machine scheduling problem with release times and delivery times. Discrete Appl. Math. 48, 69\u201379 (1994)","journal-title":"Discrete Appl. Math."},{"key":"6_CR10","volume-title":"Introduction to Sequencing and Scheduling","author":"KR Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier, J.: The one machine sequencing problem. Eur. J. Oper. Res. 11, 42\u201347 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","volume":"26","author":"J Grabowski","year":"1986","unstructured":"Grabowski, J., Nowicki, E., Zdrzalka, S.: A block approach for single-machine scheduling with release dates and due dates. Eur. J. Oper. Res. 26, 278\u2013285 (1986)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1287\/opre.23.3.475","volume":"23","author":"GB McMahon","year":"1975","unstructured":"McMahon, G.B., Florian, N.: On scheduling with ready times and due dates to minimize maximum lateness. Oper. Res. 23(3), 475\u2013482 (1975)","journal-title":"Oper. Res."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1016\/j.ejor.2004.07.050","volume":"168","author":"Y Pan","year":"2006","unstructured":"Pan, Y., Shi, L.: Branch and bound algorithm for solving hard instances of the one-machine sequencing problem. Eur. J. Oper. Res. 168, 1030\u20131039 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1016\/j.cor.2009.11.008","volume":"37","author":"Z Liu","year":"2010","unstructured":"Liu, Z.: Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints. Comput. Oper. Res. 37, 1537\u20131543 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"J Kanet","year":"2000","unstructured":"Kanet, J., Sridharan, V.: Scheduling with inserted idle time: problem taxonomy and literature review. Oper. Res. 48(1), 99\u2013110 (2000)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Grigoreva, N.: Worst-case analysis of an approximation algorithm for single machine scheduling problem. In: Proceedings of the 16th Conference on Computer Science and Intelligence Systems, vol. 25, pp. 221-225. (Annals of Computer Science and Information System; v. 25) (2021)","key":"6_CR17","DOI":"10.15439\/2021F66"},{"key":"6_CR18","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-030-30443-0_17","volume-title":"Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology \u2013 ISAT 2019","author":"N Grigoreva","year":"2020","unstructured":"Grigoreva, N.: Single machine scheduling with precedence constrains, release and delivery times. In: Wilimowska, Z., Borzemski, L., \u015awi\u0105tek, J. (eds.) ISAT 2019. AISC, vol. 1052, pp. 188\u2013198. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-30443-0_17"}],"container-title":["Communications in Computer and Information Science","Advances in Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22990-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:21:37Z","timestamp":1672539697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22990-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229893","9783031229909"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22990-9_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"43","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":"17","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":"0","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":"40% - 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.1","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.2","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)"}}]}}