{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:56:06Z","timestamp":1743087366729,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031231001"},{"type":"electronic","value":"9783031231018"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-23101-8_13","type":"book-chapter","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:18:53Z","timestamp":1671481133000},"page":"192-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Complexity of\u00a0Scheduling Problems with\u00a0a\u00a0Fixed Number of\u00a0Parallel Identical Machines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8358-6796","authenticated-orcid":false,"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8066-4004","authenticated-orcid":false,"given":"Kai","family":"Kahler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Abboud, A., Bringmann, K., Hermelin, D., Shabtay, D.: Seth-based lower bounds for subset sum and bicriteria path. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, 6\u20139 January, 2019, pp. 41\u201357 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.3","DOI":"10.1137\/1.9781611975482.3"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jcss.2022.01.005","volume":"127","author":"A Abboud","year":"2022","unstructured":"Abboud, A., Bringmann, K., Hermelin, D., Shabtay, D.: Scheduling lower bounds via and subset sum. J. Comput. Syst. Sci. 127, 29\u201340 (2022). https:\/\/doi.org\/10.1016\/j.jcss.2022.01.005","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Bruno, J.L., Coffman, Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17(7), 382\u2013387 (1974). https:\/\/doi.org\/10.1145\/361011.361064","DOI":"10.1145\/361011.361064"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: Complexity, algorithms and approximability. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization: Volume 1\u20133, pp. 1493\u20131641. Springer, US, Boston, MA (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_25","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Chen, L., Jansen, K., Zhang, G.: On the optimality of approximation schemes for the classical scheduling problem. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January, 2014. pp. 657\u2013668. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.50","DOI":"10.1137\/1.9781611973402.50"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Cygan, M., Mucha, M., Wundefinedgrzycki, K., W\u0142odarczyk, M.: On problems equivalent to (min,+)-convolution. ACM Trans. Algorithms 15(1) (2019). https:\/\/doi.org\/10.1145\/3293465","DOI":"10.1145\/3293465"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Drozdowski, M.: Scheduling for Parallel Processing. Springer Publishing Company, Incorporated, 1st edn. (2009). https:\/\/doi.org\/10.1007\/978-1-84882-310-5","DOI":"10.1007\/978-1-84882-310-5"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J Du","year":"1989","unstructured":"Du, J., Leung, J.Y.T.: Complexity of scheduling parallel task systems. SIAM J. Discret. Math. 2(4), 473\u2013487 (1989). https:\/\/doi.org\/10.1137\/0402042","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","volume":"3","author":"G Gens","year":"1981","unstructured":"Gens, G., Levner, E.: Fast approximation algorithm for job sequencing with deadlines. Discret. Appl. Math. 3(4), 313\u2013318 (1981). https:\/\/doi.org\/10.1016\/0166-218X(81)90008-1","journal-title":"Discret. Appl. Math."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer, P., Johnson, E., Korte, B. (eds.) Discrete Optimization II, Annals of Discrete Mathematics, vol. 5, pp. 287\u2013326. Elsevier (1979). https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s00224-019-09910-6","volume":"64","author":"S Henning","year":"2019","unstructured":"Henning, S., Jansen, K., Rau, M., Schmarje, L.: Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. Theory of Computing Systems 64(1), 120\u2013140 (2019). https:\/\/doi.org\/10.1007\/s00224-019-09910-6","journal-title":"Theory of Computing Systems"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Hermelin, D., Molter, H., Shabtay, D.: Minimizing the weighted number of tardy jobs via (max,+)-convolutions (2022). https:\/\/doi.org\/10.48550\/ARXIV.2202.06841","DOI":"10.48550\/ARXIV.2202.06841"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-sat. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727","DOI":"10.1006\/jcss.2000.1727"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Jansen, K., Kahler, K.: On the complexity of scheduling problems with a fixed number of parallel identical machines (2022). https:\/\/doi.org\/10.48550\/ARXIV.2202.07932, https:\/\/arxiv.org\/abs\/2202.07932","DOI":"10.48550\/ARXIV.2202.07932"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1137\/140952636","volume":"30","author":"K Jansen","year":"2016","unstructured":"Jansen, K., Land, F., Land, K.: Bounding the running time of algorithms for scheduling and packing problems. SIAM J. Discret. Math. 30(1), 343\u2013366 (2016). https:\/\/doi.org\/10.1137\/140952636","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","journal-title":"Complexity of Computer Computations"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Klein, K.M.: On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem, pp. 3567\u20133582. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.141","DOI":"10.1137\/1.9781611977073.141"},{"issue":"5","key":"13_CR18","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10951-017-0550-0","volume":"21","author":"D Knop","year":"2017","unstructured":"Knop, D., Kouteck\u00fd, M.: Scheduling meets n-fold integer programming. J. Sched. 21(5), 493\u2013503 (2017). https:\/\/doi.org\/10.1007\/s10951-017-0550-0","journal-title":"J. Sched."},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Lawler, E.L.: A \u201cpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness. In: Hammer, P., Johnson, E., Korte, B., Nemhauser, G. (eds.) Studies in Integer Programming, Annals of Discrete Mathematics, vol. 1, pp. 331\u2013342. Elsevier (1977). https:\/\/doi.org\/10.1016\/S0167-5060(08)70742-8","DOI":"10.1016\/S0167-5060(08)70742-8"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H., Shmoys, D.B.: Chapter 9 sequencing and scheduling: algorithms and complexity. In: Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol. 4, pp. 445\u2013522. Elsevier (1993). https:\/\/doi.org\/10.1016\/S0927-0507(05)80189-6","DOI":"10.1016\/S0927-0507(05)80189-6"},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler, E.L., Moore, J.M.: A functional equation and its application to resource allocation and sequencing problems. Manage. Sci. 16(1), 77\u201384 (1969). https:\/\/doi.org\/10.1287\/mnsc.16.1.77","journal-title":"Manage. Sci."},{"issue":"5","key":"13_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1080\/07408179908969847","volume":"31","author":"CY Lee","year":"1999","unstructured":"Lee, C.Y., Cai, X.: Scheduling one and two-processor tasks on two parallel processors. IIE Trans. 31(5), 445\u2013455 (1999). https:\/\/doi.org\/10.1080\/07408179908969847","journal-title":"IIE Trans."},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Lee, C.Y., Uzsoy, R.: A new dynamic programming algorithm for the parallel machines total weighted completion time problem. Operations Research Letters 11(2), 73\u201375 (mar 1992). https:\/\/doi.org\/10.1016\/0167-6377(92)90035-2","DOI":"10.1016\/0167-6377(92)90035-2"},{"key":"13_CR24","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., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977). https:\/\/doi.org\/10.1016\/S0167-5060(08)70743-X","journal-title":"Ann. Discrete Math."},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Lenstra, J.K., Shmoys, D.B.: Elements of scheduling (2020). https:\/\/doi.org\/10.48550\/ARXIV.2001.06005","DOI":"10.48550\/ARXIV.2001.06005"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.cor.2018.07.020","volume":"100","author":"M Mnich","year":"2018","unstructured":"Mnich, M., van Bevern, R.: Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100, 254\u2013261 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.07.020","journal-title":"Comput. Oper. Res."},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. Mathematical Programming 154(1\u20132), 533\u2013562 (dec 2015). https:\/\/doi.org\/10.1007\/s10107-014-0830-9","DOI":"10.1007\/s10107-014-0830-9"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Mucha, M., Wundefinedgrzycki, K., W\u0142odarczyk, M.: A subquadratic approximation scheme for partition. In: Chan, T.M. (ed.) Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 70\u201388. Society for Industrial and Applied Mathematics, USA (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.5","DOI":"10.1137\/1.9781611975482.5"},{"issue":"5","key":"13_CR29","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","volume":"12","author":"MH Rothkopf","year":"1966","unstructured":"Rothkopf, M.H.: Scheduling independent tasks on parallel processors. Manage. Sci. 12(5), 437\u2013447 (1966). https:\/\/doi.org\/10.1287\/mnsc.12.5.437","journal-title":"Manage. Sci."},{"issue":"16\u201318","key":"13_CR30","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L Zhang","year":"2010","unstructured":"Zhang, L., Lu, L., Yuan, J.: Single-machine scheduling under the job rejection constraint. Theoret. Comput. Sci. 411(16\u201318), 1877\u20131882 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.02.006","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2023: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23101-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:05:52Z","timestamp":1673049952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23101-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031231001","9783031231018"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23101-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics.science.upjs.sk\/sofsem2023\/","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":"26","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":"60% - 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":"6-7","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)"}}]}}