{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:54:36Z","timestamp":1776437676329,"version":"3.51.2"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.03.005","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T08:03:46Z","timestamp":1773648226000},"page":"234-250","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Makespan minimization for ordinal cardinality constrained scheduling"],"prefix":"10.1016","volume":"387","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6761-8521","authenticated-orcid":false,"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Lassota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marten","family":"Maack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Rohwedder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2026.03.005_b1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","article-title":"Better bounds for online scheduling","volume":"29","author":"Albers","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.dam.2026.03.005_b2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01193837","article-title":"The k-partitioning problem","volume":"47","author":"Babel","year":"1998","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/j.dam.2026.03.005_b3","series-title":"Proc. of the 10th International Conference on Combinatorial Optimization and Applications (COCOA2016)","first-page":"608","article-title":"An efficient PTAS for parallel machine scheduling with capacity constraints","author":"Chen","year":"2016"},{"issue":"5","key":"10.1016\/j.dam.2026.03.005_b4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.orl.2012.05.009","article-title":"Algorithms better than LPT for semi-online scheduling with decreasing processing times","volume":"40","author":"Cheng","year":"2012","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/j.dam.2026.03.005_b5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/jos.68","article-title":"Bounds for the cardinality constrained P||Cmax problem","volume":"4","author":"Dell\u2019Amico","year":"2001","journal-title":"J. Sched."},{"issue":"3","key":"10.1016\/j.dam.2026.03.005_b6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10951-018-0567-z","article-title":"A survey on makespan minimization in semi-online environments","volume":"21","author":"Epstein","year":"2018","journal-title":"J. Sched."},{"issue":"1","key":"10.1016\/j.dam.2026.03.005_b7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10878-023-01069-8","article-title":"Parallel solutions for ordinal scheduling with a small number of machines","volume":"46","author":"Epstein","year":"2023","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.03.005_b8","series-title":"Proc. of the 39th International Symposium on Theoretical Aspects of Computer Science, (STACS2022)","first-page":"28:1","article-title":"Cardinality constrained scheduling in online models","volume":"219","author":"Epstein","year":"2022"},{"issue":"5","key":"10.1016\/j.dam.2026.03.005_b9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.orl.2023.08.003","article-title":"Online cardinality constrained scheduling","volume":"51","author":"Epstein","year":"2023","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"10.1016\/j.dam.2026.03.005_b10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","article-title":"Online scheduling revisited","volume":"3","author":"Fleischer","year":"2000","journal-title":"J. Sched."},{"issue":"9","key":"10.1016\/j.dam.2026.03.005_b11","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"10.1016\/j.dam.2026.03.005_b12","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.03.005_b13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02669690","article-title":"Semi-on-line scheduling problems for maximizing the minimum machine completion time","volume":"17","author":"He","year":"2001","journal-title":"Acta Math. Appl. Sin."},{"issue":"2","key":"10.1016\/j.dam.2026.03.005_b14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1013855712183","article-title":"Ordinal on-line scheduling for maximizing the minimum machine completion time","volume":"6","author":"He","year":"2002","journal-title":"J. Comb. Optim."},{"issue":"10\u201311","key":"10.1016\/j.dam.2026.03.005_b15","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1016\/S0898-1221(03)90201-X","article-title":"k-Partitioning problems for maximizing the minimum load","volume":"46","author":"He","year":"2003","journal-title":"Comput. Math. Appl."},{"issue":"6","key":"10.1016\/j.dam.2026.03.005_b16","first-page":"245","article-title":"Ordinal semi on-line scheduling for jobs with arbitrary release times on identical parallel machines","volume":"9","author":"Ji","year":"2017","journal-title":"Intell. Inf. Manag."},{"issue":"1","key":"10.1016\/j.dam.2026.03.005_b17","first-page":"48","article-title":"A 7\/6\u2013approximation algorithm for 3-partitioning and its application to multiprocessor scheduling","volume":"37","author":"Kellerer","year":"1999","journal-title":"INFOR Inf. Syst. Oper. Res."},{"issue":"5","key":"10.1016\/j.dam.2026.03.005_b18","first-page":"359","article-title":"A 3\/2-approximation algorithm for ki-partitioning","volume":"39","author":"Kellerer","year":"2011","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/j.dam.2026.03.005_b19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0166-218X(93)90013-E","article-title":"A tight bound for 3-partitioning","volume":"45","author":"Kellerer","year":"1993","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10.1016\/j.dam.2026.03.005_b20","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(95)00058-5","article-title":"Ordinal algorithms for parallel machine scheduling","volume":"18","author":"Liu","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.dam.2026.03.005_b21","unstructured":"K. Pruhs, J. Sgall, E. Torng, Online scheduling, In Handb. Sched. - Algorithms, Model. Perform. Anal. 2004."},{"issue":"2","key":"10.1016\/j.dam.2026.03.005_b22","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1287\/moor.1090.0381","article-title":"Online scheduling with bounded migration","volume":"34","author":"Sanders","year":"2009","journal-title":"Math. Oper. Res."},{"issue":"5","key":"10.1016\/j.dam.2026.03.005_b23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","article-title":"Semi-online scheduling with decreasing job sizes","volume":"27","author":"Seiden","year":"2000","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.dam.2026.03.005_b24","series-title":"Online Algorithms, The State of the Art","first-page":"196","article-title":"On-line scheduling","author":"Sgall","year":"1998"},{"issue":"5","key":"10.1016\/j.dam.2026.03.005_b25","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-6377(01)00071-2","article-title":"Semi-on-line scheduling with ordinal data on two uniform machines","volume":"28","author":"Tan","year":"2001","journal-title":"Oper. Res. Lett."},{"issue":"12","key":"10.1016\/j.dam.2026.03.005_b26","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/S0898-1221(02)00115-3","article-title":"Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times","volume":"43","author":"Tan","year":"2002","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"10.1016\/j.dam.2026.03.005_b27","first-page":"161","article-title":"Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system","volume":"47","author":"Tan","year":"2004","journal-title":"Sci. China Ser. F: Inf. Sci."},{"issue":"1","key":"10.1016\/j.dam.2026.03.005_b28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ic.2004.10.002","article-title":"Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data","volume":"196","author":"Tan","year":"2005","journal-title":"Inform. and Comput."},{"issue":"5","key":"10.1016\/j.dam.2026.03.005_b29","first-page":"235","article-title":"Better algorithm of ordinal online schedule for jobs with similar sizes on two machines","volume":"9","author":"Wang","year":"2019","journal-title":"Am. J. Oper. Res."},{"key":"10.1016\/j.dam.2026.03.005_b30","series-title":"Proc. of the Third International Workshop on Frontiers in Algorithmics (FAW2009)","first-page":"283","article-title":"Approximating scheduling machines with capacity constraints","author":"Zhang","year":"2009"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001460?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001460?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:08:11Z","timestamp":1776434891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":30,"alternative-id":["S0166218X26001460"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.005","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Makespan minimization for ordinal cardinality constrained scheduling","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}