{"id":"https://openalex.org/W3092251811","doi":"https://doi.org/10.1109/case48305.2020.9217035","title":"Tightened Formulation and Resolution of Energy-Efficient Job-Shop Scheduling","display_name":"Tightened Formulation and Resolution of Energy-Efficient Job-Shop Scheduling","publication_year":2020,"publication_date":"2020-08-01","ids":{"openalex":"https://openalex.org/W3092251811","doi":"https://doi.org/10.1109/case48305.2020.9217035","mag":"3092251811"},"language":"en","primary_location":{"id":"doi:10.1109/case48305.2020.9217035","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case48305.2020.9217035","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001651510","display_name":"Bing Yan","orcid":"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":true,"raw_author_name":"Bing Yan","raw_affiliation_strings":["Department of Electrical and Microelectronic Engineering, Rochester Institute of Technology, Rochester, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Microelectronic Engineering, Rochester Institute of Technology, Rochester, USA","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023766412","display_name":"Mikhail A. Bragin","orcid":"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, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Connecticut, Storrs, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070935042","display_name":"Peter B. Luh","orcid":"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, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Connecticut, Storrs, USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001651510"],"corresponding_institution_ids":["https://openalex.org/I155173764"],"apc_list":null,"apc_paid":null,"fwci":0.7133,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7743983,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"741","last_page":"746"},"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.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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.73785400390625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6673625707626343},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6430887579917908},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6081212162971497},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.595841646194458},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5330209732055664},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4954608678817749},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.4935988187789917},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.34496864676475525},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23060506582260132},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15122255682945251},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.11148223280906677}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.73785400390625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6673625707626343},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6430887579917908},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6081212162971497},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.595841646194458},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5330209732055664},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4954608678817749},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.4935988187789917},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.34496864676475525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23060506582260132},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15122255682945251},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.11148223280906677},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case48305.2020.9217035","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case48305.2020.9217035","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1999445878","https://openalex.org/W2003869323","https://openalex.org/W2012586594","https://openalex.org/W2032523714","https://openalex.org/W2056276294","https://openalex.org/W2128973482","https://openalex.org/W2150473588","https://openalex.org/W2158023072","https://openalex.org/W2604126453","https://openalex.org/W2726506533","https://openalex.org/W2808281002","https://openalex.org/W2810191079","https://openalex.org/W2898113355","https://openalex.org/W2900116312","https://openalex.org/W2946177841","https://openalex.org/W3006275750","https://openalex.org/W3048444086","https://openalex.org/W6650072106"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"Job":[0],"shops":[1],"are":[2,13,189],"an":[3,36],"important":[4],"production":[5],"environment":[6,37],"for":[7,106,140],"low-volume":[8],"high-variety":[9],"manufacturing.":[10],"When":[11],"there":[12],"urgent":[14],"orders,":[15],"the":[16,123,157,161,172],"speeds":[17],"of":[18,94,194],"certain":[19],"machines":[20,61,103,141],"can":[21,151,163],"be":[22,64,152,164],"adjusted":[23],"with":[24,142],"a":[25,84],"high":[26],"energy":[27,45,69,110,201],"and":[28,30,43,60,112,118,178,200],"wear":[29],"tear":[31],"cost.":[32],"Scheduling":[33],"in":[34,104],"such":[35],"is":[38,73,81,99,126,131,147,181],"to":[39,63,67,74,90,154],"achieve":[40],"on-time":[41,198],"deliveries":[42,199],"low":[44],"costs.":[46,70,202],"The":[47,79,129,145],"problem":[48,80,125,162,173],"is,":[49],"however,":[50],"complicated":[51],"because":[52],"part":[53,115],"processing":[54,116],"time":[55],"depends":[56],"on":[57,197],"machine":[58,119],"speeds,":[59],"need":[62],"modeled":[65],"individually":[66],"capture":[68],"This":[71,98],"paper":[72],"obtain":[75],"near-optimal":[76],"solutions":[77,188],"efficiently.":[78],"formulated":[82],"as":[83],"Mixed-Integer":[85],"Linear":[86],"Programming":[87],"(MILP)":[88],"form":[89],"make":[91],"effective":[92],"use":[93],"available":[95],"MILP":[96],"methods.":[97,169],"done":[100],"by":[101,113,134,166],"modeling":[102],"groups":[105],"simplicity":[107],"while":[108],"approximating":[109],"costs,":[111],"linking":[114],"status":[117],"speed":[120],"variables.":[121],"Nevertheless,":[122],"resulting":[124],"still":[127],"complicated.":[128],"formulation":[130],"therefore":[132],"transformed":[133,153],"extending":[135],"our":[136,175,195],"previous":[137],"tightening":[138],"approach":[139,196],"constant":[143],"speeds.":[144],"idea":[146],"that":[148,186],"if":[149],"constraints":[150],"directly":[155],"delineate":[156],"convex":[158],"hull,":[159],"then":[160],"solved":[165],"linear":[167],"programming":[168],"To":[170],"solve":[171],"efficiently,":[174],"advanced":[176],"decomposition":[177],"coordination":[179],"method":[180],"used.":[182],"Numerical":[183],"results":[184],"show":[185],"nearoptimal":[187],"obtained,":[190],"demonstrating":[191],"significant":[192],"benefits":[193]},"counts_by_year":[{"year":2021,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}