{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:37:17Z","timestamp":1771389437441,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["NI 369\/17"],"award-info":[{"award-number":["NI 369\/17"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["2434 \"Facets of Complexity\""],"award-info":[{"award-number":["2434 \"Facets of Complexity\""]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P020372\/1"],"award-info":[{"award-number":["EP\/P020372\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israeli Science Foundation","doi-asserted-by":"crossref","award":["1070\/20"],"award-info":[{"award-number":["1070\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10951-022-00754-6","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T19:05:38Z","timestamp":1663614338000},"page":"209-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Equitable scheduling on a single machine"],"prefix":"10.1007","volume":"26","author":[{"given":"Klaus","family":"Heeger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Hermelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4590-798X","authenticated-orcid":false,"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,19]]},"reference":[{"key":"754_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.3934\/jimo.2014.10.219","volume":"10","author":"M Adamu","year":"2014","unstructured":"Adamu, M., & Adewumi, A. (2014). Survey of single machine scheduling to minimize weighted number of tardy jobs. Journal of Industrial and Management Optimization, 10, 219.","journal-title":"Journal of Industrial and Management Optimization"},{"issue":"7","key":"754_CR2","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","volume":"33","author":"U Bagchi","year":"1987","unstructured":"Bagchi, U., Sullivan, R., & Chang, Y. (1987). Minimizing mean squared deviation of completion times about a common due date. Management Science, 33(7), 894\u2013906.","journal-title":"Management Science"},{"issue":"2","key":"754_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/moor.1060.0189","volume":"31","author":"N Bansal","year":"2006","unstructured":"Bansal, N., Kimbrel, T., & Sviridenko, M. (2006). Job shop scheduling with unit processing times. Mathematics of Operations Research, 31(2), 381\u2013389.","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"754_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2(6), 245\u2013252.","journal-title":"Journal of Scheduling"},{"key":"754_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0166-218X(99)00238-3","volume":"103","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103, 21\u201332.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"754_CR6","first-page":"111","volume":"2","author":"P Baptiste","year":"2004","unstructured":"Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. G. (2004). Ten notes on equal-processing-time scheduling. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2(2), 111\u2013127.","journal-title":"Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"issue":"6","key":"754_CR7","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/BF01940883","volume":"15","author":"SK Baruah","year":"1996","unstructured":"Baruah, S. K., Cohen, N. K., Plaxton, C. G., & Varvel, D. A. (1996). Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6), 600\u2013625.","journal-title":"Algorithmica"},{"key":"754_CR8","doi-asserted-by":"crossref","unstructured":"Bentert, M., Bredereck, R., Gy\u00f6rgyi, P., Kaczmarczyk, A., & Niedermeier, R. (2021). A multivariate complexity analysis of the material consumption problem. In Proceedings of the 35th AAAI conference on artificial intelligence, AAAI 2021 (pp. 11755\u201311763). AAAI Press.","DOI":"10.1609\/aaai.v35i13.17397"},{"issue":"1","key":"754_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-018-0595-8","volume":"22","author":"M Bentert","year":"2019","unstructured":"Bentert, M., van Bevern, R., & Niedermeier, R. (2019). Inductive $$k$$-independent graphs and $$c$$-colorable subgraphs in scheduling: A review. Journal of Scheduling, 22(1), 3\u201320.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"754_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V. F., & Trichakis, N. (2011). The price of fairness. Operations Research, 59(1), 17\u201331.","journal-title":"Operations Research"},{"key":"754_CR11","unstructured":"Bredereck, R., Kaczmarczyk, A., Niedermeier, R. (2018). Envy-free allocations respecting social networks. In Proceedings of the 17th international conference on autonomous agents and multiagent systems, AAMAS 2018 (pp. 283\u2013291)."},{"key":"754_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s001860200228","volume":"56","author":"P Brucker","year":"2002","unstructured":"Brucker, P., Hurink, J., & Knust, S. (2002). A polynomial algorithm for $$p|p_j=1, r_j,\\text{ outtree }|\\sum c_j$$ problem. Mathematical Methods of Operations Research, 56, 407\u2013412.","journal-title":"Mathematical Methods of Operations Research"},{"key":"754_CR13","doi-asserted-by":"crossref","unstructured":"B\u00fclb\u00fcl, K., Kedad-Sidhoum, S., & \u015een, H. (2019). Single-machine common due date total earliness\/tardiness scheduling with machine unavailability. Journal of Scheduling,22, 543\u2013565.","DOI":"10.1007\/s10951-018-0585-x"},{"issue":"1","key":"754_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0305-0548(90)90022-Y","volume":"17","author":"C Chen","year":"1990","unstructured":"Chen, C., & Bulfin, R. (1990). Scheduling unit processing time jobs on a single machine with multiple criteria. Computers & Operations Research, 17(1), 1\u20137.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"754_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF00365326","volume":"2","author":"H Chetto","year":"1990","unstructured":"Chetto, H., Silly, M., & Bouchentouf, T. (1990). Dynamic scheduling of real-time tasks under precedence constraints. Real-Time Systems, 2(3), 181\u2013194.","journal-title":"Real-Time Systems"},{"issue":"4","key":"754_CR16","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1287\/moor.1050.0158","volume":"30","author":"JR Correa","year":"2005","unstructured":"Correa, J. R., & Schulz, A. S. (2005). Single-machine scheduling with precedence constraints. Mathematics of Operations Research, 30(4), 1005\u20131021.","journal-title":"Mathematics of Operations Research"},{"key":"754_CR17","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., et al. (2015). Parameterized algorithms. Springer."},{"issue":"2","key":"754_CR18","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.ejor.2020.09.042","volume":"291","author":"M de Weerdt","year":"2021","unstructured":"de Weerdt, M., Baart, R., & He, L. (2021). Single-machine scheduling with release times, deadlines, setup times, and rejection. European Journal of Operational Research, 291(2), 629\u2013639.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"754_CR19","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s00373-014-1446-9","volume":"31","author":"A Dehghan","year":"2015","unstructured":"Dehghan, A., Sadeghi, M., & Ahadi, A. (2015). On the complexity of deciding whether the regular number is at most two. Graphs and Combinatorics, 31(5), 1359\u20131365.","journal-title":"Graphs and Combinatorics"},{"issue":"10","key":"754_CR20","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1287\/mnsc.46.10.1365.12272","volume":"46","author":"U Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000). A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Science, 46(10), 1365\u20131384.","journal-title":"Management Science"},{"key":"754_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R. G., & Fellows, M. R. (2013). Fundamentals of parameterized complexity. Springer."},{"issue":"2","key":"754_CR22","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. (2003). On the parametric complexity of schedules to minimize tardy tasks. Theoretical Computer Science, 298(2), 317\u2013324.","journal-title":"Theoretical Computer Science"},{"key":"754_CR23","unstructured":"Flum, J., & Grohe, M. (2006). Parameterized complexity theory, volume XIV of texts in theoretical computer science. An EATCS series. Springer."},{"key":"754_CR24","doi-asserted-by":"crossref","unstructured":"Fluschnik, T., Skowron, P., Triphaus, M., & Wilker, K. (2019). Fair knapsack. In Proceedings of the 33rd AAAI conference on artificial intelligence, AAAI 2019 (pp. 1941\u20131948). AAAI Press.","DOI":"10.1609\/aaai.v33i01.33011941"},{"key":"754_CR25","doi-asserted-by":"crossref","unstructured":"Ganian, R., Hamm, T., & Mescoff, G. (2020). The complexity landscape of resource-constrained scheduling. In Proceedings of the 29th international joint conference on artificial intelligence, IJCAI 2020 (pp. 1741\u20131747). ijcai.org","DOI":"10.24963\/ijcai.2020\/241"},{"key":"754_CR26","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W. H: Freeman."},{"issue":"3","key":"754_CR27","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976). Some simplified NP-complete problems. Theoretical Computer Science, 1(3), 237\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"754_CR28","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"3","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 3, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"754_CR29","doi-asserted-by":"crossref","unstructured":"Gupta, S., Jalan, A., Ranade, G., Yang, H., & Zhuang, S. (2020). Too many fairness metrics: Is there a solution? SSRN. https:\/\/dx.doi.org\/10.2139\/ssrn.3554829","DOI":"10.2139\/ssrn.3554829"},{"key":"754_CR30","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P. (1935). On representatives of subsets. Journal of the London Mathematical Society, 10, 26\u201330.","journal-title":"Journal of the London Mathematical Society"},{"key":"754_CR31","doi-asserted-by":"crossref","unstructured":"Heeger, K., Hermelin, D., Mertzios, G.\u00a0B., Molter, H., Niedermeier, R., & Shabtay, D. (2021). Equitable scheduling on a single machine. In Proceedings of the 35th AAAI conference on artificial intelligence, AAAI \u201921 (pp. 11818\u201311825). AAAI Press.","DOI":"10.1609\/aaai.v35i13.17404"},{"issue":"9","key":"754_CR32","doi-asserted-by":"publisher","first-page":"2644","DOI":"10.1007\/s00453-020-00702-w","volume":"82","author":"D Hermelin","year":"2020","unstructured":"Hermelin, D., Manoussakis, G., Pinedo, M., Shabtay, D., & Yedidsion, L. (2020). Parameterized multi-scenario single-machine scheduling problems. Algorithmica, 82(9), 2644\u20132667.","journal-title":"Algorithmica"},{"key":"754_CR33","unstructured":"Hermelin, D., Molter, H., Niedermeier, R., & Shabtay, D. (2021). Equitable scheduling for the total completion time objective. arXiv:2112.13824"},{"issue":"1","key":"754_CR34","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.07.038","volume":"273","author":"D Hermelin","year":"2019","unstructured":"Hermelin, D., Pinedo, M., Shabtay, D., & Talmon, N. (2019). On the parameterized tractability of single machine scheduling with rejection. European Journal of Operational Research, 273(1), 67\u201373.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"754_CR35","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s10951-019-00617-7","volume":"22","author":"D Hermelin","year":"2019","unstructured":"Hermelin, D., Shabtay, D., & Talmon, N. (2019). On the parameterized tractability of the just-in-time flow-shop scheduling problem. Journal of Scheduling, 22(6), 663\u2013676.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"754_CR36","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/37.45792","volume":"10","author":"DJ Hoitomt","year":"1990","unstructured":"Hoitomt, D. J., Luh, P. B., Max, E., & Pattipati, K. R. (1990). Scheduling jobs with simple precedence constraints on parallel machines. IEEE Control Systems Magazine, 10(2), 34\u201340.","journal-title":"IEEE Control Systems Magazine"},{"issue":"4","key":"754_CR37","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., & Karp, R. M. (1973). An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4), 225\u2013231.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"754_CR38","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jcss.2012.04.004","volume":"79","author":"K Jansen","year":"2013","unstructured":"Jansen, K., Kratsch, S., Marx, D., & Schlotter, I. (2013). Bin packing with fixed number of bins revisited. Journal of Computer and System Sciences, 79(1), 39\u201349.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"754_CR39","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"DS Johnson","year":"1974","unstructured":"Johnson, D. S. (1974). Fast algorithms for bin packing. Journal of Computer and System Sciences, 8(3), 272\u2013314.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"754_CR40","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D. S., Demers, A. J., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974). Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3(4), 299\u2013325.","journal-title":"SIAM Journal on Computing"},{"key":"754_CR41","doi-asserted-by":"crossref","unstructured":"Karp, R.\u00a0M. (1972). Reducibility among combinatorial problems. In Complexity of computer computations (pp. 85\u2013103). Springer.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"754_CR42","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1137\/S0097539703434966","volume":"36","author":"A Kumar","year":"2006","unstructured":"Kumar, A., & Kleinberg, J. M. (2006). Fairness measures for resource allocation. SIAM Journal on Computing, 36(3), 657\u2013680.","journal-title":"SIAM Journal on Computing"},{"key":"754_CR43","first-page":"493","volume-title":"Economics and computation, An introduction to algorithmic game theory, computational social choice, and fair division, Springer texts in business and economics","author":"J Lang","year":"2016","unstructured":"Lang, J., & Rothe, J. (2016). Fair division of indivisible goods. In J. Rothe (Ed.), Economics and computation, An introduction to algorithmic game theory, computational social choice, and fair division, Springer texts in business and economics (pp. 493\u2013550). Springer."},{"issue":"5","key":"754_CR44","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.mcm.2003.05.019","volume":"40","author":"V Lauff","year":"2004","unstructured":"Lauff, V., & Werner, F. (2004). Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey. Mathematical and Computer Modelling, 40(5), 637\u2013655.","journal-title":"Mathematical and Computer Modelling"},{"issue":"4","key":"754_CR45","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H. W., Jr. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4), 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"754_CR46","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(80)90111-3","volume":"4","author":"J Lenstra","year":"1980","unstructured":"Lenstra, J., & Rinnooy-Kan, A. (1980). Complexity results for scheduling chains on a single machine. European Journal of Operational Research, 4(4), 270\u2013275.","journal-title":"European Journal of Operational Research"},{"key":"754_CR47","doi-asserted-by":"crossref","unstructured":"Lenstra, J. K., & Rinnooy-Kan, A. (1978). Complexity of scheduling under precedence constraints. Operations Research,26(1), 22\u201335.","DOI":"10.1287\/opre.26.1.22"},{"issue":"1","key":"754_CR48","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/mnsc.16.5.295","volume":"19","author":"WL Maxwell","year":"1970","unstructured":"Maxwell, W. L. (1970). On sequencing $$n$$ jobs on one machine to minimize the number of late jobs. Management Science, 19(1), 295\u2013297.","journal-title":"Management Science"},{"key":"754_CR49","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. (2018). Parameterized complexity of machine scheduling: 15 open problems. Computers & Operations Research, 100, 254\u2013261.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"754_CR50","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. (2015). Scheduling and fixed-parameter tractability. Mathematical Programming, 154(1), 533\u2013562.","journal-title":"Mathematical Programming"},{"issue":"2","key":"754_CR51","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/S009753970037727X","volume":"33","author":"RH M\u00f6hring","year":"2004","unstructured":"M\u00f6hring, R. H., Skutella, M., & Stork, F. (2004). Scheduling with and\/or precedence constraints. SIAM Journal on Computing, 33(2), 393\u2013415.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"754_CR52","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J Moore","year":"1968","unstructured":"Moore, J. (1968). An $$n$$ job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(2), 102\u2013109.","journal-title":"Management Science"},{"issue":"3","key":"754_CR53","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1080\/0305215X.2020.1735380","volume":"53","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov, G., & Pruwer, S. (2021). On the minmax common-due-date problem: Extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops. Engineering Optimization, 53(3), 408\u2013424.","journal-title":"Engineering Optimization"},{"issue":"2","key":"754_CR54","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ejor.2004.10.021","volume":"172","author":"G Mosheiov","year":"2006","unstructured":"Mosheiov, G., & Yovel, U. (2006). Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs. European Journal of Operational Research, 172(2), 528\u2013544.","journal-title":"European Journal of Operational Research"},{"key":"754_CR55","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R. (2006). Invitation to fixed-parameter algorithms. Oxford University Press."},{"issue":"2","key":"754_CR56","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"SS Panwalkar","year":"1982","unstructured":"Panwalkar, S. S., Smith, M. L., & Seidmann, A. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30(2), 391\u2013399.","journal-title":"Operations Research"},{"key":"754_CR57","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.omega.2013.07.001","volume":"43","author":"D Shabtay","year":"2014","unstructured":"Shabtay, D., Arviv, K., Edan, Y., & Stern, H. (2014). A combined robot selection and scheduling problem for flow-shops with no-wait restrictions. Omega, 43, 96\u2013107.","journal-title":"Omega"},{"issue":"1","key":"754_CR58","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1287\/mnsc.17.1.116","volume":"17","author":"LBJM Sturm","year":"1970","unstructured":"Sturm, L. B. J. M. (1970). A simple optimality proof of Moore\u2019s sequencing algorithm. Management Science, 17(1), 116\u2013118.","journal-title":"Management Science"},{"key":"754_CR59","doi-asserted-by":"crossref","unstructured":"T\u2019kindt, V., Shang, L., & Croce, F. D. (2020). Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights. Journal of Combinatorial Optimization,39, 764\u2013775.","DOI":"10.1007\/s10878-019-00512-z"},{"key":"754_CR60","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Bredereck, R., Bulteau, L., Komusiewicz, C., Talmon, N., & Woeginger, G. J. (2016). Precedence-constrained scheduling problems parameterized by partial order width. In International conference on discrete optimization and operations research, DOOR 2016 (pp. 105\u2013120). Springer.","DOI":"10.1007\/978-3-319-44914-2_9"},{"issue":"3","key":"754_CR61","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10951-016-0478-9","volume":"20","author":"R van Bevern","year":"2017","unstructured":"van Bevern, R., Niedermeier, R., & Such\u1ef3, O. (2017). A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: Few machines, small looseness, and small slack. Journal of Scheduling, 20(3), 255\u2013265.","journal-title":"Journal of Scheduling"},{"key":"754_CR62","doi-asserted-by":"crossref","unstructured":"Walsh, T. (2020). Fair division: The computer scientist\u2019s perspective. In Proceedings of the 29th international joint conference on artificial intelligence, IJCAI 2020 (pp. 4966\u20134972). ijcai.org","DOI":"10.24963\/ijcai.2020\/691"},{"key":"754_CR63","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10951-018-0596-7","volume":"22","author":"T Wang","year":"2019","unstructured":"Wang, T., & Bellenguez-Morineau, O. (2019). The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints. Journal of Scheduling, 22, 263\u2013269.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00754-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00754-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00754-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T08:33:47Z","timestamp":1680078827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00754-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["754"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00754-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,19]]},"assertion":[{"value":"11 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors do not have conflicts of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}