{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T20:51:12Z","timestamp":1726174272070},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031160806"},{"type":"electronic","value":"9783031160813"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16081-3_4","type":"book-chapter","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T18:02:24Z","timestamp":1663437744000},"page":"35-45","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Scheme for\u00a0Single-Machine Rescheduling with\u00a0Job Delay and\u00a0Rejection"],"prefix":"10.1007","author":[{"given":"Ruiqing","family":"Sun","sequence":"first","affiliation":[]},{"given":"Xiaofei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,18]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55\u201366 (1998)","journal-title":"J. Sched."},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/opre.39.3.470","volume":"39","author":"JC Bean","year":"1991","unstructured":"Bean, J.C., Birge, J.R., Mittenthal, J., Noon, C.E.: Matchup scheduling with multiple resources, release dates and disruptions. Oper. Res. 39(3), 470\u2013483 (1991)","journal-title":"Oper. Res."},{"issue":"9","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1287\/opre.1090.0751","volume":"58","author":"NG Hall","year":"2010","unstructured":"Hall, N.G., Potts, C.N.: Rescheduling for job unavailability. Oper. Res. 58(3), 746\u2013755 (2010)","journal-title":"Oper. Res."},{"issue":"7","key":"4_CR6","doi-asserted-by":"publisher","first-page":"3025","DOI":"10.1007\/s00453-019-00566-9","volume":"81","author":"I Kones","year":"2019","unstructured":"Kones, I., Levin, A.: A unified framework for designing EPTAS for load balancing on parallel machines. Algorithmica 81(7), 3025\u20133046 (2019)","journal-title":"Algorithmica"},{"issue":"05","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1250029","DOI":"10.1142\/S0217595912500297","volume":"29","author":"W Li","year":"2012","unstructured":"Li, W., Li, J., Zhang, T.: Two approximation schemes for scheduling on parallel machines under a grade of service provision. Asia-Pacific J. Oper. Res. 29(05), 1250029 (2012)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.tcs.2015.10.007","volume":"607","author":"W Li","year":"2015","unstructured":"Li, W., Li, J., Zhang, X., Chen, Z.: Penalty cost constrained identical parallel machine scheduling problem. Theor. Comput. Sci. 607, 181\u2013192 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10288-017-0356-0","volume":"16","author":"W Li","year":"2018","unstructured":"Li, W., Cui, Q.: Vector scheduling with rejection on a single machine. 4OR 16(1), 95\u2013104 (2018)","journal-title":"4OR"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10951-014-0372-2","volume":"17","author":"Z Liu","year":"2014","unstructured":"Liu, Z., Ro, Y.K.: Rescheduling for machine disruption to minimize makespan and maximum lateness. J. Sched. 17(4), 339\u2013352 (2014)","journal-title":"J. Sched."},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ejor.2017.09.015","volume":"266","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Lu, L., Qi, X.: Cost allocation in rescheduling with machine unavailable period. Eur. J. Oper. Res. 266(1), 16\u201328 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"106574","DOI":"10.1016\/j.cie.2020.106574","volume":"146","author":"W Luo","year":"2020","unstructured":"Luo, W., Jin, M., Su, B., Lin, G.: An approximation scheme for rejection-allowed single-machine rescheduling. Comput. Ind. Eng. 146, 106574 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"4_CR13","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10951-018-0575-z","volume":"21","author":"W Luo","year":"2018","unstructured":"Luo, W., Luo, T., Goebel, R., Lin, G.: Rescheduling due to machine disruption to minimize the total weighted completion time. J. Sched. 21(5), 565\u2013578 (2018)","journal-title":"J. Sched."},{"unstructured":"Schuurman, P., Woeginger, G.J.: Approximation schemes - a tutorial. In: Wolsey, L.A., et al. (eds.) Lectures on Scheduling (2009)","key":"4_CR14"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59\u201366 (1956)","journal-title":"Nav. Res. Logist. Q."},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1287\/opre.1080.0584","volume":"57","author":"S Thomson","year":"2009","unstructured":"Thomson, S., Nunez, M., Garfinkel, R., Dean, M.D.: Efficient short term allocation and reallocation of patients to floor of a hospital during demand surges. Oper. Res. 57(2), 261\u2013273 (2009)","journal-title":"Oper. Res."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.omega.2018.04.008","volume":"81","author":"D Wang","year":"2018","unstructured":"Wang, D., Yin, Y., Cheng, T.C.E.: Parallel-machine rescheduling with job unavailability and rejection. Omega 81, 246\u2013260 (2018)","journal-title":"Omega"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of an FPTAS? INFORMS J. Comput. 12(1), 57\u201374 (2000)","journal-title":"INFORMS J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Wu, S.D., Storer, R.H., Chang, P.C.: A rescheduling procedure for manufacturing systems under random disruptions. In: Proceedings Joint USA\/German Conference on New Directions for Operations Research in Manufacturing, pp. 292\u2013306 (1991)","key":"4_CR19","DOI":"10.1007\/978-3-642-77537-6_18"},{"key":"4_CR20","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-981-16-1877-2_4","volume-title":"Theoretical Computer Science","author":"M Xiao","year":"2021","unstructured":"Xiao, M., Ding, L., Zhao, S., Li, W.: Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1. In: He, K., Zhong, C., Cai, Z., Yin, Y. (eds.) NCTCS 2020. CCIS, vol. 1352, pp. 47\u201356. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-16-1877-2_4"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.ejor.2016.01.045","volume":"252","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Cheng, T.C.E., Wang, D.J.: Rescheduling on identical parallel machines with machine disruptions to minimize total completion time. Eur. J. Oper. Res. 252(3), 737\u2013749 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1287\/inte.33.1.5.12720","volume":"33","author":"G Yu","year":"2003","unstructured":"Yu, G., Arg\u00fcello, M., Song, G., McCowan, S.M., White, A.: A new era for crew recovery at Continental Airlines. Interfaces 33(1), 5\u201322 (2003)","journal-title":"Interfaces"},{"issue":"2","key":"4_CR23","first-page":"104","volume":"25","author":"S Yu","year":"2021","unstructured":"Yu, S., Jin, M., Luo, W.: Approximation scheme for rescheduling on a single machine with job delay and rejection. OR Trans. 25(2), 104\u2013114 (2021)","journal-title":"OR Trans."},{"issue":"6","key":"4_CR24","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1109\/21.257756","volume":"23","author":"M Zweben","year":"1993","unstructured":"Zweben, M., Davis, E., Daun, B., Deale, M.: Scheduling and rescheduling with iterative repair. IEEE Trans. Syst. Man Cybern. 23(6), 1588\u20131596 (1993)","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16081-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T18:03:01Z","timestamp":1663437781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16081-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031160806","9783031160813"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16081-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2022","order":10,"name":"conference_id","label":"Conference ID","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":"Springer Nature EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","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":"41","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":"69% - 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":"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)"}}]}}
