{"id":"https://openalex.org/W7102409474","doi":"https://doi.org/10.48550/arxiv.2510.24013","title":"Discovering Heuristics with Large Language Models (LLMs) for Mixed-Integer Programs: Single-Machine Scheduling","display_name":"Discovering Heuristics with Large Language Models (LLMs) for Mixed-Integer Programs: Single-Machine Scheduling","publication_year":2025,"publication_date":"2025-10-28","ids":{"openalex":"https://openalex.org/W7102409474","doi":"https://doi.org/10.48550/arxiv.2510.24013"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2510.24013","doi":"https://doi.org/10.48550/arxiv.2510.24013","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.24013","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2510.24013","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120200695","display_name":"\u0130brahim O\u011fuz \u00c7etinkaya","orcid":"https://orcid.org/0009-0008-8354-5968","observed_orcids":["https://orcid.org/0009-0008-8354-5968"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u00c7etinkaya, \u0130brahim O\u011fuz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025665669","display_name":"\u0130. Esra B\u00fcy\u00fcktahtak\u0131n","orcid":"https://orcid.org/0000-0001-8928-2638","observed_orcids":["https://orcid.org/0000-0001-8928-2638"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B\u00fcy\u00fcktahtak\u0131n, \u0130. Esra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065006965","display_name":"Parshin Shojaee","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shojaee, Parshin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5104294407","display_name":"Chandan K. Reddy","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Reddy, Chandan K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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":true,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T11773","display_name":"Healthcare Operations and Scheduling Optimization","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/3604","display_name":"Emergency Medical Services"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":9.999999747378752e-05,"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/large-language-models","display_name":"large language models","score":0.8799999952316284},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"single machine scheduling","score":0.8410000205039978},{"id":"https://openalex.org/keywords/total-tardiness","display_name":"total tardiness","score":0.9169999957084656},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.8429999947547913},{"id":"https://openalex.org/keywords/earliest-due-date-rule","display_name":"earliest due date rule","score":0.8270000219345093},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8450000286102295},{"id":"https://openalex.org/keywords/human-llm-collaboration","display_name":"human-LLM collaboration","score":0.9020000100135803},{"id":"https://openalex.org/keywords/np-hard-scheduling-problems","display_name":"NP-hard scheduling","score":0.5260000228881836}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8827000260353088},{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8327999711036682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.701200008392334},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5974000096321106},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.571399986743927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5442000031471252},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.3402000069618225},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3109000027179718},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29649999737739563},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2510.24013","doi":"https://doi.org/10.48550/arxiv.2510.24013","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.24013","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2510.24013","doi":"https://doi.org/10.48550/arxiv.2510.24013","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.24013","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5451913475990295}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Our":[0],"study":[1,193],"contributes":[2],"to":[3,34,86,156],"the":[4,16,26,62,72,162,172],"scheduling":[5],"and":[6,51,56,66,78,105,124,134,149,166,179,188],"combinatorial":[7,206],"optimization":[8],"literature":[9],"with":[10,139,182],"new":[11],"heuristics":[12,123,178,202],"discovered":[13],"by":[14,38,71],"leveraging":[15],"power":[17],"of":[18,115],"Large":[19],"Language":[20],"Models":[21],"(LLMs).":[22],"We":[23,54,117],"focus":[24],"on":[25,42,186],"single-machine":[27],"total":[28,36],"tardiness":[29,37],"(SMTT)":[30],"problem,":[31],"which":[32],"aims":[33],"minimize":[35],"sequencing":[39],"n":[40],"jobs":[41],"a":[43,110],"single":[44],"processor":[45],"without":[46],"preemption,":[47],"given":[48],"processing":[49],"times":[50],"due":[52],"dates.":[53],"develop":[55],"benchmark":[57],"two":[58],"novel":[59],"LLM-discovered":[60,97],"heuristics,":[61,93],"EDD":[63,164],"Challenger":[64,68],"(EDDC)":[65],"MDD":[67],"(MDDC),":[69],"inspired":[70],"well-known":[73],"Earliest":[74],"Due":[75,80],"Date":[76,81],"(EDD)":[77],"Modified":[79],"(MDD)":[82],"rules.":[83],"In":[84],"contrast":[85],"prior":[87],"studies":[88],"that":[89,195],"employed":[90],"simpler":[91],"rule-based":[92],"we":[94],"evaluate":[95],"our":[96],"algorithms":[98],"using":[99],"rigorous":[100],"criteria,":[101],"including":[102],"optimality":[103],"gaps":[104],"solution":[106],"time":[107],"derived":[108],"from":[109],"mixed-integer":[111],"programming":[112,151],"(MIP)":[113],"formulation":[114],"SMTT.":[116],"compare":[118],"their":[119],"performance":[120],"against":[121],"state-of-the-art":[122],"exact":[125,144,183],"methods":[126,145],"across":[127],"various":[128],"job":[129],"sizes":[130],"(20,":[131],"100,":[132],"200,":[133],"500":[135,157],"jobs).":[136],"For":[137],"instances":[138],"more":[140,189],"than":[141],"100":[142],"jobs,":[143,158],"such":[146],"as":[147],"MIP":[148],"dynamic":[150],"become":[152],"computationally":[153],"intractable.":[154],"Up":[155],"EDDC":[159],"improves":[160],"upon":[161],"classic":[163],"rule":[165],"another":[167],"widely":[168],"used":[169],"algorithm":[170],"in":[171],"literature.":[173],"MDDC":[174],"consistently":[175],"outperforms":[176],"traditional":[177],"remains":[180],"competitive":[181],"approaches,":[184],"particularly":[185],"larger":[187],"complex":[190],"instances.":[191],"This":[192],"shows":[194],"human-LLM":[196],"collaboration":[197],"can":[198],"produce":[199],"scalable,":[200],"high-performing":[201],"for":[203],"NP-hard":[204],"constrained":[205],"optimization,":[207],"even":[208],"under":[209],"limited":[210],"resources":[211],"when":[212],"effectively":[213],"configured.":[214]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-30T00:00:00"}