{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:50:18Z","timestamp":1757314218676,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811981517"},{"type":"electronic","value":"9789811981524"}],"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-981-19-8152-4_17","type":"book-chapter","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:04:02Z","timestamp":1670601842000},"page":"236-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Parameterized Tractability of\u00a0Single Machine Scheduling with\u00a0Rejection to\u00a0Minimize the\u00a0Weighted Makespan"],"prefix":"10.1007","author":[{"given":"Ruiqing","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,10]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2020.11.024","volume":"290","author":"MK Alix","year":"2021","unstructured":"Alix, M.K.: A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows. Disc. Appl. Math. 290, 1\u20136 (2021)","journal-title":"Disc. Appl. Math."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Spaccamela, A.M., Stougie, J.: Multi-processor scheduling with rejection. SIAM J. Disc. Math. 13, 64\u201378 (2000)","journal-title":"SIAM J. Disc. Math."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0167-6377(95)00031-9","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Fellows, M.R.: W[2]-hardness of precedence constrained k-processor scheduling. Oper. Res. Lett. 18(2), 93\u201397 (1995)","journal-title":"Oper. Res. Lett."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"1850048","DOI":"10.1142\/S0217595918500483","volume":"35","author":"X Chai","year":"2018","unstructured":"Chai, X., Lu, L., Li, W., Zhang, L.: Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time. Asia-Pacific J. Oper. Res. 35, 1850048 (2018)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"17_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"12","key":"17_CR6","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1080\/00207160.2019.1711373","volume":"97","author":"B Dai","year":"2020","unstructured":"Dai, B., Li, W.: Vector scheduling with rejection on two machines. Int. J. Comput. Math. 97(12), 2507\u20132515 (2020)","journal-title":"Int. J. Comput. Math."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-56686-4_38","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"MR Fellows","year":"1993","unstructured":"Fellows, M.R., Koblitz, N.: Fixed-parameter complexity and cryptography. In: Cohen, G., Mora, T., Moreno, O. (eds.) AAECC 1993. LNCS, vol. 673, pp. 121\u2013131. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56686-4_38"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0304-3975(02)00811-3","volume":"298","author":"MR Fellows","year":"2003","unstructured":"Fellows, M.R., McCartin, C.: On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci. 298(2), 317\u2013324 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR9","first-page":"121","volume":"11","author":"Q Feng","year":"2007","unstructured":"Feng, Q., Yuan, J.: NP-hardness of a multicriteria scheduling on two families of jobs. OR Trans. 11, 121\u2013126 (2007)","journal-title":"OR Trans."},{"key":"17_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"7","key":"17_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"1","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, E.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 1(7), 49\u201366 (1987)","journal-title":"Combinatorica"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Disc. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Disc. Math."},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10951-022-00731-z","volume":"25","author":"D Hermelin","year":"2022","unstructured":"Hermelin, D., Shabtay, D., Zelig, C., Pinedo, M.: A general scheme for solving a large set of scheduling problems with rejection in FPT time. J. Sched. 25(2), 229\u2013255 (2022)","journal-title":"J. Sched."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10951-017-0550-0","volume":"21","author":"D Knop","year":"2018","unstructured":"Knop, D., Kouteck\u00fd, M.: Scheduling meets n-fold integer programming. J. Sched. 21, 493\u2013503 (2018). https:\/\/doi.org\/10.1007\/s10951-017-0550-0","journal-title":"J. Sched."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"1550030","DOI":"10.1142\/S021759591550030X","volume":"32","author":"W Li","year":"2015","unstructured":"Li, W.: A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completed time. Asia-Pacific J. Oper. Res. 32, 1550030 (2015)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"17_CR16","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."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Li, W., Cui, Q.: Vector scheduling with rejection on a single machine. 4OR-Q. J. Oper. Res. 16(1), 95\u2013104 (2018)","DOI":"10.1007\/s10288-017-0356-0"},{"issue":"10","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.3390\/math8101785","volume":"8","author":"X Liu","year":"2020","unstructured":"Liu, X., Xing, P., Li, W.: Approximation algorithms for the submodular load balancing with submodular penalties. Mathematics 8(10), 1785 (2020)","journal-title":"Mathematics"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1007\/s11590-021-01724-1","volume":"15","author":"X Liu","year":"2021","unstructured":"Liu, X., Li, W.: Approximation algorithms for the multiprocessor scheduling with submodular penalties. Optim. Lett. 15, 2165\u20132180 (2021)","journal-title":"Optim. Lett."},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-030-93176-6_9","volume-title":"Algorithmic Aspects in Information and Management","author":"L Lu","year":"2021","unstructured":"Lu, L., Zhang, L., Ou, J.: Single machine scheduling with\u00a0rejection to\u00a0minimize the\u00a0weighted makespan. In: Wu, W., Du, H. (eds.) AAIM 2021. LNCS, vol. 13153, pp. 96\u2013110. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93176-6_9"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-014-0830-9","volume":"154","author":"M Mnich","year":"2015","unstructured":"Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. Math. Program. 154(1), 533\u2013562 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou, J., Zhong, X., Wang, G.: An improved heuristic for parallel machine scheduling with rejection. Eur. J. Oper. Res. 241(3), 653\u2013661 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., Kaspi, M.: A survey on off-line scheduling with rejection. J. Sched. 16, 3\u201328 (2013)","journal-title":"J. Sched."},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Sun, R., Liu, X.: Approximation scheme for single-machine rescheduling with job delay and rejection. In: Ni, Q., Wu, W. (eds) AAIM 2022. LNCS, vol. 13513, pp. 35\u201345. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-16081-3_4","DOI":"10.1007\/978-3-031-16081-3_4"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"L Zhang","year":"2009","unstructured":"Zhang, L., Lu, L., Yuan, J.: Single machine scheduling with release dates and rejection. Eur. J. Oper. Res. 198, 975\u2013978 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-8152-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:14:38Z","timestamp":1670602478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-8152-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811981517","9789811981524"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-8152-4_17","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":"10 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changchun","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2022","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":"https:\/\/conf.ccf.org.cn\/TCS2022","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"13","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":"6","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":"22% - 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":"3","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)"}}]}}