{"id":"https://openalex.org/W7214368679","doi":"https://doi.org/10.48550/arxiv.2609.28751","title":"Strong NP-Hardness and Approximation Algorithm for Weighted Tardiness with Release Dates and Identical Processing Times","display_name":"Strong NP-Hardness and Approximation Algorithm for Weighted Tardiness with Release Dates and Identical Processing Times","publication_year":2026,"publication_date":"2026-09-23","ids":{"openalex":"https://openalex.org/W7214368679","doi":"https://doi.org/10.48550/arxiv.2609.28751"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.28751","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.28751","pdf_url":"https://arxiv.org/pdf/2609.28751","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.28751","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100751333","display_name":"Zhi\u2010Long Chen","orcid":"https://orcid.org/0000-0002-9960-0465","observed_orcids":["https://orcid.org/0000-0002-9960-0465"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chen, Zhi-Long","raw_affiliation_strings":["University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038577914","display_name":"Nicholas G. Hall","orcid":"https://orcid.org/0000-0003-4484-9252","observed_orcids":["https://orcid.org/0000-0003-4484-9252"]},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hall, Nicholas G.","raw_affiliation_strings":["The Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.004900000058114529,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/weighted-tardiness","display_name":"weighted tardiness","score":0.8560000061988831},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"single machine scheduling","score":0.8889999985694885},{"id":"https://openalex.org/keywords/release-dates","display_name":"release dates","score":0.953000009059906},{"id":"https://openalex.org/keywords/deadlines","display_name":"deadlines","score":0.7770000100135803},{"id":"https://openalex.org/keywords/equal-processing-times","display_name":"equal processing times","score":0.7390000224113464},{"id":"https://openalex.org/keywords/strong-np-hardness","display_name":"strong NP-hardness","score":0.8560000061988831},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6449999809265137},{"id":"https://openalex.org/keywords/additive-approximation","display_name":"additive approximation","score":0.5260000228881836}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8472999930381775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6345999836921692},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5521000027656555},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5392000079154968},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5234000086784363},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4788999855518341},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4634000062942505},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.460099995136261},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4320000112056732},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4253999888896942},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.420199990272522},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.4016000032424927},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3952000141143799},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.3905999958515167},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3790999948978424},{"id":"https://openalex.org/C136886441","wikidata":"https://www.wikidata.org/wiki/Q926129","display_name":"Normalization (sociology)","level":2,"score":0.3702000081539154},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3601999878883362},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.3246000111103058},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2703000009059906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26919999718666077},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2547999918460846}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.28751","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.28751","pdf_url":"https://arxiv.org/pdf/2609.28751","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.28751","doi":"https://doi.org/10.48550/arxiv.2609.28751","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.28751","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.28751","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.28751","pdf_url":"https://arxiv.org/pdf/2609.28751","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214368679.pdf","grobid_xml":"https://content.openalex.org/works/W7214368679.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W40309320","https://openalex.org/W123039402","https://openalex.org/W1484610295","https://openalex.org/W1488422606","https://openalex.org/W1489262994","https://openalex.org/W1704392916","https://openalex.org/W1972077325","https://openalex.org/W1988328380","https://openalex.org/W2005380783","https://openalex.org/W2011559494","https://openalex.org/W2022265817","https://openalex.org/W2025422398","https://openalex.org/W2030087828","https://openalex.org/W2030250600","https://openalex.org/W2086012697","https://openalex.org/W2092993493","https://openalex.org/W2222512263","https://openalex.org/W2743045177","https://openalex.org/W3021012527","https://openalex.org/W4403689865","https://openalex.org/W4414563290"],"related_works":["https://openalex.org/W2898578331","https://openalex.org/W1981858350","https://openalex.org/W2157859449","https://openalex.org/W2093528244","https://openalex.org/W2370703266","https://openalex.org/W1565098934","https://openalex.org/W1588284186","https://openalex.org/W7096505402","https://openalex.org/W2069710083","https://openalex.org/W4224002264"],"abstract_inverted_index":{"We":[0,50,127],"study":[1],"nonpreemptive":[2],"scheduling":[3],"on":[4],"a":[5,17,81,95,107,120,123,130,240],"single":[6],"machine":[7],"with":[8,86],"release":[9],"dates,":[10,12],"due":[11,66],"positive":[13],"job":[14,62],"weights,":[15],"and":[16,79,165,177,201,238],"common":[18],"processing":[19],"time.":[20],"The":[21,73,147],"objective":[22,139],"is":[23,56,75,94,143,191],"to":[24,215],"minimize":[25],"total":[26,116,144],"weighted":[27,117,145],"tardiness.":[28,146],"Although":[29],"closely":[30],"related":[31],"equal-processing-time":[32],"problems":[33],"admit":[34],"polynomial-time":[35,132],"algorithms,":[36],"the":[37,46,137,167,179,187,195,199,206,211,216,220,223,230,234,245],"complexity":[38,236],"of":[39,84,193],"this":[40,184],"problem":[41,161],"has":[42],"remained":[43],"open":[44],"in":[45,173],"literature":[47],"since":[48],"2010.":[49],"prove":[51],"that":[52,99],"its":[53,65],"decision":[54],"version":[55],"strongly":[57],"NP-complete,":[58],"even":[59],"when":[60],"every":[61,101],"can":[63],"meet":[64],"date":[67],"if":[68],"processed":[69],"immediately":[70],"upon":[71],"release.":[72],"reduction":[74],"from":[76],"unweighted":[77],"MAX-CUT":[78],"uses":[80],"quadratic":[82],"number":[83],"jobs":[85,196],"polynomially":[87],"bounded":[88],"numerical":[89],"data.":[90],"Its":[91],"main":[92],"ingredient":[93],"constructive":[96],"normalization":[97],"theorem":[98],"converts":[100],"sufficiently":[102],"inexpensive":[103],"feasible":[104],"schedule":[105],"into":[106],"binary":[108],"choice":[109],"for":[110,136,162,183,219,244],"each":[111,163],"graph":[112],"vertex;":[113],"after":[114],"normalization,":[115],"tardiness":[118],"equals":[119],"constant":[121],"minus":[122],"scaled":[124],"cut":[125],"value.":[126],"also":[128],"give":[129],"deterministic":[131],"phase-grid":[133,169,246],"assignment":[134,160,247],"algorithm":[135,148],"shifted":[138,200,217],"$\u03a6=F+p\\sum_jw_j$,":[140],"where":[141],"$F$":[142],"enumerates":[149],"at":[150],"most":[151],"$N$":[152],"release-date":[153],"residues":[154],"modulo":[155],"$p$,":[156],"solves":[157],"one":[158],"minimum-cost":[159],"residue,":[164],"returns":[166],"best":[168],"schedule.":[170],"It":[171],"runs":[172],"$O(N^5)$":[174],"arithmetic":[175],"operations":[176],"achieves":[178],"tight":[180],"ratio":[181],"$3/2-1/(2N)$":[182],"algorithm.":[185,248],"Because":[186],"added":[188],"term":[189],"$p\\sum_jw_j$":[190],"independent":[192],"how":[194],"are":[197],"scheduled,":[198],"original":[202,221],"objectives":[203],"have":[204],"exactly":[205],"same":[207],"optimal":[208],"schedules.":[209],"However,":[210],"approximation":[212],"guarantee":[213,243],"applies":[214],"objective;":[218],"objective,":[222],"analysis":[224],"provides":[225,239],"an":[226],"additive":[227],"bound.":[228],"Thus,":[229],"paper":[231],"both":[232],"resolves":[233],"long-standing":[235],"question":[237],"complementary":[241],"worst-case":[242]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-26T00:00:00"}