{"id":"https://openalex.org/W4310364446","doi":"https://doi.org/10.3390/a15120450","title":"A Hybrid Exact\u2013Local Search Approach for One-Machine Scheduling with Time-Dependent Capacity","display_name":"A Hybrid Exact\u2013Local Search Approach for One-Machine Scheduling with Time-Dependent Capacity","publication_year":2022,"publication_date":"2022-11-29","ids":{"openalex":"https://openalex.org/W4310364446","doi":"https://doi.org/10.3390/a15120450"},"language":"en","primary_location":{"id":"doi:10.3390/a15120450","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15120450","pdf_url":"https://www.mdpi.com/1999-4893/15/12/450/pdf?version=1669706703","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/12/450/pdf?version=1669706703","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012530516","display_name":"Christos Valouxis","orcid":"https://orcid.org/0000-0001-6832-2311"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Valouxis","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Patras, 26500 Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Patras, 26500 Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049850289","display_name":"Christos Gogos","orcid":"https://orcid.org/0000-0003-1113-8462"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Christos Gogos","raw_affiliation_strings":["Department of Informatics and Telecommunications, University of Ioannina, 47100 Arta, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications, University of Ioannina, 47100 Arta, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007202717","display_name":"Angelos Dimitsas","orcid":"https://orcid.org/0000-0002-7892-046X"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Angelos Dimitsas","raw_affiliation_strings":["Department of Informatics and Telecommunications, University of Ioannina, 47100 Arta, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications, University of Ioannina, 47100 Arta, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031323555","display_name":"\u03a0\u03ad\u03c4\u03c1\u03bf\u03c2 \u03a0\u03bf\u03c4\u03af\u03ba\u03b1\u03c2","orcid":"https://orcid.org/0009-0001-6858-591X"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Petros Potikas","raw_affiliation_strings":["Department of Electrical and Computer Engineering, National Technical University of Athens, 15772 Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, National Technical University of Athens, 15772 Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061884444","display_name":"Anastasios Vittas","orcid":null},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Anastasios Vittas","raw_affiliation_strings":["Department of Informatics and Telecommunications, University of Ioannina, 47100 Arta, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications, University of Ioannina, 47100 Arta, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5049850289"],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.6671,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74583244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"12","first_page":"450","last_page":"450"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9904000163078308,"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/constraint-programming","display_name":"Constraint programming","score":0.7192686796188354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.717644214630127},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6839762926101685},{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.6838866472244263},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6387481093406677},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6179519891738892},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5586841702461243},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.49844980239868164},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4432045519351959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22010350227355957},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.20235911011695862},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17829447984695435}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7192686796188354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.717644214630127},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6839762926101685},{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.6838866472244263},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6387481093406677},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6179519891738892},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5586841702461243},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49844980239868164},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4432045519351959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22010350227355957},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.20235911011695862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17829447984695435},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15120450","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15120450","pdf_url":"https://www.mdpi.com/1999-4893/15/12/450/pdf?version=1669706703","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b464f04748a74c82b296a91bce89e0d6","is_oa":true,"landing_page_url":"https://doaj.org/article/b464f04748a74c82b296a91bce89e0d6","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 12, p 450 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/12/450/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15120450","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 12; Pages: 450","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15120450","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15120450","pdf_url":"https://www.mdpi.com/1999-4893/15/12/450/pdf?version=1669706703","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4310364446.pdf","grobid_xml":"https://content.openalex.org/works/W4310364446.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1535560884","https://openalex.org/W1542362607","https://openalex.org/W1969590301","https://openalex.org/W1981106240","https://openalex.org/W1998314628","https://openalex.org/W2007363252","https://openalex.org/W2018449375","https://openalex.org/W2028697667","https://openalex.org/W2090826610","https://openalex.org/W2148962278","https://openalex.org/W2155809154","https://openalex.org/W2157671570","https://openalex.org/W2255312499","https://openalex.org/W2617234139","https://openalex.org/W2737631213","https://openalex.org/W2743045177","https://openalex.org/W2782628021","https://openalex.org/W2790098940","https://openalex.org/W2886707908","https://openalex.org/W2974498203","https://openalex.org/W3021654671","https://openalex.org/W3217012897","https://openalex.org/W4255654664","https://openalex.org/W4310364446","https://openalex.org/W6682990601"],"related_works":["https://openalex.org/W2011810134","https://openalex.org/W2050497389","https://openalex.org/W1568976062","https://openalex.org/W2960025371","https://openalex.org/W2367625138","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W2147600044","https://openalex.org/W2014328192"],"abstract_inverted_index":{"Machine":[0],"scheduling":[1],"is":[2,26,55,61,209,265],"a":[3,36,97,115,121,144,155,166,184,198],"hard":[4],"combinatorial":[5],"problem":[6,34,71,95,276],"having":[7],"many":[8,275],"manifestations":[9],"in":[10,57,67,154,197,241,249,274],"real":[11],"life.":[12],"Due":[13,106],"to":[14,62,77,107,194,213,223,234],"the":[15,18,33,64,75,94,108,129,133,158,163,176,188,217,224,238,245,270],"schedule":[16,78],"followed,":[17],"possibility":[19],"of":[20,22,35,45,81,102,110,162,175,187,201,231,237,244,251,254],"installations":[21],"machines":[23],"operating":[24],"sub-optimally":[25],"high.":[27],"In":[28],"this":[29],"work,":[30],"we":[31,123,127,142],"examine":[32],"single":[37,185],"machine":[38],"with":[39,183],"time-dependent":[40],"capacity":[41,208],"that":[42,91,147,262],"performs":[43],"jobs":[44,182,193,202],"deterministic":[46],"durations,":[47],"while":[48],"for":[49],"each":[50],"job,":[51],"its":[52],"due":[53],"time":[54,246],"known":[56],"advance.":[58],"The":[59,70],"objective":[60],"minimize":[63],"aggregated":[65],"tardiness":[66],"all":[68],"tasks.":[69],"was":[72],"motivated":[73],"by":[74,179],"need":[76],"charging":[79],"times":[80,131,196],"electric":[82],"vehicles":[83],"effectively.":[84],"We":[85],"formulate":[86],"an":[87],"integer":[88],"programming":[89,99,118,135,160,227],"model":[90,100,136],"clearly":[92],"describes":[93],"and":[96,120,268],"constraint":[98,117,134,159,226],"capable":[101],"effectively":[103],"solving":[104],"it.":[105],"usage":[109],"interval":[111],"variables,":[112],"global":[113],"constraints,":[114],"powerful":[116],"solver,":[119,228],"heuristic":[122],"have":[124],"identified,":[125],"which":[126],"call":[128],"\u201cdue":[130],"rule\u201d,":[132],"can":[137],"reach":[138],"excellent":[139],"solutions.":[140],"Furthermore,":[141],"employ":[143],"hybrid":[145],"approach":[146,264],"exploits":[148],"three":[149],"local":[150],"search":[151,177],"improvement":[152,170],"procedures":[153,171],"schema":[156],"where":[157,207],"part":[161],"solver":[164],"plays":[165],"central":[167],"role.":[168],"These":[169],"exhaustively":[172],"enumerate":[173],"portions":[174],"space":[178],"exchanging":[180],"consecutive":[181,199,252],"job":[186],"same":[189],"duration,":[190],"moving":[191],"cost-incurring":[192],"earlier":[195],"sequence":[200],"or":[203,248],"even":[204],"exploiting":[205],"periods":[206],"not":[210],"fully":[211],"utilized":[212],"rearrange":[214],"jobs.":[215,255],"On":[216],"other":[218],"hand,":[219],"subproblems":[220],"are":[221],"given":[222],"exact":[225],"allowing":[229],"freedom":[230],"movement":[232],"only":[233],"certain":[235],"parts":[236],"schedule,":[239],"either":[240],"vertical":[242],"ribbons":[243],"axis":[247],"groups":[250],"sequences":[253],"Experiments":[256],"on":[257],"publicly":[258],"available":[259],"data":[260],"show":[261],"our":[263],"highly":[266],"competitive":[267],"achieves":[269],"new":[271],"best":[272],"results":[273],"instances.":[277]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2022-12-09T00:00:00"}