{"id":"https://openalex.org/W3133493643","doi":"https://doi.org/10.1109/lra.2021.3086422","title":"A Novel Integer Linear Programming Formulation for Job-Shop Scheduling Problems","display_name":"A Novel Integer Linear Programming Formulation for Job-Shop Scheduling Problems","publication_year":2021,"publication_date":"2021-07-01","ids":{"openalex":"https://openalex.org/W3133493643","doi":"https://doi.org/10.1109/lra.2021.3086422","mag":"3133493643"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2021.3086422","doi":"https://doi.org/10.1109/lra.2021.3086422","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3086422","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","jufo-2","ki-jl-1","norway-1","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.techrxiv.org/articles/preprint/A_Novel_Integer_Linear_Programming_Formulation_for_Job-Shop_Scheduling_Problems/14135075/files/26653976.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079665471","display_name":"Anbang Liu","orcid":"https://orcid.org/0000-0002-5827-4368","observed_orcids":["https://orcid.org/0000-0002-5827-4368"]},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Anbang Liu","raw_affiliation_strings":["Center for Intelligent and Networked System (CFINS), Department of Automation, Tsinghua University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-5827-4368","affiliations":[{"raw_affiliation_string":"Center for Intelligent and Networked System (CFINS), Department of Automation, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070935042","display_name":"Peter B. Luh","orcid":"https://orcid.org/0000-0002-5158-7388","observed_orcids":["https://orcid.org/0000-0002-5158-7388"]},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter B. Luh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA"],"raw_orcid":"https://orcid.org/0000-0002-5158-7388","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001651510","display_name":"Bing Yi Yan","orcid":"https://orcid.org/0000-0002-0126-5524","observed_orcids":["https://orcid.org/0000-0002-0126-5524"]},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bing Yan","raw_affiliation_strings":["Department of Electrical and Microelectronic Engineering at Rochester Institute of Technology, Rochester, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-0126-5524","affiliations":[{"raw_affiliation_string":"Department of Electrical and Microelectronic Engineering at Rochester Institute of Technology, Rochester, NY, USA","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023766412","display_name":"Mikhail A. Bragin","orcid":"https://orcid.org/0000-0002-7783-9053","observed_orcids":["https://orcid.org/0000-0002-7783-9053"]},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mikhail A. Bragin","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA"],"raw_orcid":"https://orcid.org/0000-0002-7783-9053","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2045,"currency":"USD","value_usd":2045},"apc_paid":null,"fwci":2.328,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.8829711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"6","issue":"3","first_page":"5937","last_page":"5944"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.0,"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":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"job shop scheduling","score":0.9990000128746033},{"id":"https://openalex.org/keywords/integer-linear-programming-model","display_name":"integer linear programming formulation","score":0.9900000095367432},{"id":"https://openalex.org/keywords/total-weighted-tardiness","display_name":"total weighted tardiness","score":0.9190000295639038},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"branch-and-cut","score":0.953000009059906},{"id":"https://openalex.org/keywords/decomposition-coordination","display_name":"decomposition and coordination","score":0.7429999709129333},{"id":"https://openalex.org/keywords/quadratic-penalty","display_name":"quadratic penalty","score":0.7450000047683716},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.5789999961853027}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7236979007720947},{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.7157514095306396},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7150665521621704},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6948939561843872},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5208028554916382},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4944751262664795},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.47760793566703796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47573065757751465},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46438419818878174},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4603521525859833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44854822754859924},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.43244582414627075},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.41008567810058594},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2058623731136322},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/lra.2021.3086422","doi":"https://doi.org/10.1109/lra.2021.3086422","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3086422","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-b","jufo-2","ki-jl-1","norway-1","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},{"id":"doi:10.36227/techrxiv.14135075.v1","doi":"https://doi.org/10.36227/techrxiv.14135075.v1","is_oa":true,"landing_page_url":"https://doi.org/10.36227/techrxiv.14135075.v1","pdf_url":"https://www.techrxiv.org/articles/preprint/A_Novel_Integer_Linear_Programming_Formulation_for_Job-Shop_Scheduling_Problems/14135075/files/26653976.pdf","source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},{"id":"doi:10.36227/techrxiv.14601123.v1","doi":"https://doi.org/10.36227/techrxiv.14601123.v1","is_oa":true,"landing_page_url":"https://doi.org/10.36227/techrxiv.14601123.v1","pdf_url":null,"source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},{"id":"pmh:oai:figshare.com:article/14135075","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/preprint/A_Novel_Integer_Linear_Programming_Formulation_for_Job-Shop_Scheduling_Problems/14135075","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:figshare.com:article/14601123","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/preprint/A_Novel_Integer_Linear_Programming_Formulation_for_Job-Shop_Scheduling_Problems/14601123","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.36227/techrxiv.14135075.v1","doi":"https://doi.org/10.36227/techrxiv.14135075.v1","is_oa":true,"landing_page_url":"https://doi.org/10.36227/techrxiv.14135075.v1","pdf_url":"https://www.techrxiv.org/articles/preprint/A_Novel_Integer_Linear_Programming_Formulation_for_Job-Shop_Scheduling_Problems/14135075/files/26653976.pdf","source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3133493643.pdf","grobid_xml":"https://content.openalex.org/works/W3133493643.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1513888968","https://openalex.org/W1545639070","https://openalex.org/W1964674593","https://openalex.org/W1968143987","https://openalex.org/W1984200231","https://openalex.org/W1992679414","https://openalex.org/W1999445878","https://openalex.org/W2024966195","https://openalex.org/W2029242918","https://openalex.org/W2032523714","https://openalex.org/W2041592598","https://openalex.org/W2076716919","https://openalex.org/W2087376002","https://openalex.org/W2103254960","https://openalex.org/W2122967269","https://openalex.org/W2143183418","https://openalex.org/W2150473588","https://openalex.org/W2296319761","https://openalex.org/W2798566347","https://openalex.org/W2798766386","https://openalex.org/W2801976624","https://openalex.org/W2808281002","https://openalex.org/W2810191079","https://openalex.org/W3006275750","https://openalex.org/W3048444086","https://openalex.org/W3092251811","https://openalex.org/W4238671349","https://openalex.org/W4254315244"],"related_works":["https://openalex.org/W2810191079","https://openalex.org/W3048444086","https://openalex.org/W2000672358","https://openalex.org/W7124995131","https://openalex.org/W7096746162","https://openalex.org/W7096349640","https://openalex.org/W2155938357","https://openalex.org/W2169224602","https://openalex.org/W2133922862","https://openalex.org/W2100447752"],"abstract_inverted_index":{"Job-shop":[0],"scheduling":[1],"is":[2,14,41,90,103,129],"an":[3,46,150],"important":[4],"but":[5],"difficult":[6],"problem":[7],"arising":[8],"in":[9,45],"low-volume":[10],"high-variety":[11],"manufacturing.":[12],"It":[13],"usually":[15],"solved":[16],"at":[17],"the":[18,162,187,191],"beginning":[19],"of":[20,57,117,165],"each":[21],"shift":[22],"with":[23,32],"strict":[24,36],"computational":[25,67,163],"time":[26,37],"requirements.":[27],"To":[28],"obtain":[29],"near-optimal":[30,180],"solutions":[31,181],"quantifiable":[33],"quality":[34],"within":[35],"limits,":[38],"a":[39,81,133,143],"direction":[40],"to":[42,54,105,110,149,169],"formulate":[43],"them":[44],"Integer":[47],"Linear":[48],"Programming":[49],"(ILP)":[50],"form":[51],"so":[52],"as":[53,63,108,147,167],"take":[55],"advantages":[56],"widely":[58],"available":[59],"ILP":[60,70,74,83],"methods":[61,71],"such":[62],"Branch-and-Cut":[64],"(B&C).":[65],"Nevertheless,":[66],"requirements":[68,164],"for":[69,85],"on":[72],"existing":[73],"formulations":[75],"are":[76,182],"high.":[77],"In":[78],"this":[79],"letter,":[80],"novel":[82],"formulation":[84,94,159],"minimizing":[86],"total":[87],"weighted":[88],"tardiness":[89],"presented.":[91],"The":[92],"new":[93,158,192],"has":[95,178],"much":[96],"fewer":[97],"decision":[98],"variables":[99],"and":[100,102],"constraints,":[101],"proven":[104],"be":[106],"tighter":[107],"compared":[109,148,168],"our":[111,120,157,170],"previous":[112,171],"formulation.":[113,172,193],"For":[114,173],"fast":[115],"resolution":[116],"large":[118,174],"problems,":[119],"recent":[121],"decomposition-and-coordination":[122],"method":[123],"\u201cSurrogate":[124],"Absolute-Value":[125],"Lagrangian":[126],"Relaxation\u201d":[127],"(SAVLR)":[128],"enhanced":[130,188],"by":[131,185],"using":[132,186],"3-segment":[134],"piecewise":[135],"linear":[136],"penalty":[137,145],"function,":[138],"which":[139],"more":[140],"accurately":[141],"approximates":[142],"quadratic":[144],"function":[146],"absolute-value":[151],"function.":[152],"Testing":[153],"results":[154],"demonstrate":[155],"that":[156],"drastically":[160],"reduces":[161],"B&C":[166,177],"problems":[175],"where":[176],"difficulties,":[179],"efficiently":[183],"obtained":[184],"SAVLR":[189],"under":[190]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5}],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2021-03-15T00:00:00"}