{"id":"https://openalex.org/W7124893999","doi":"https://doi.org/10.1109/seeda-cecnsm68644.2025.11329736","title":"An Approach for Computing Lower Bounds for Flexible Job-Shop Scheduling Problems","display_name":"An Approach for Computing Lower Bounds for Flexible Job-Shop Scheduling Problems","publication_year":2025,"publication_date":"2025-09-19","ids":{"openalex":"https://openalex.org/W7124893999","doi":"https://doi.org/10.1109/seeda-cecnsm68644.2025.11329736"},"language":null,"primary_location":{"id":"doi:10.1109/seeda-cecnsm68644.2025.11329736","is_oa":false,"landing_page_url":"https://doi.org/10.1109/seeda-cecnsm68644.2025.11329736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 10th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)","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/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":["Univerity of Patras,Dept. of Electrical and Computer Engineering,Patras,Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univerity of Patras,Dept. of Electrical and Computer Engineering,Patras,Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123403120","display_name":"Christos Gogos","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":"Christos Gogos","raw_affiliation_strings":["University of Ioannina,Dept. of Informatics and Telecommunications,Arta,Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ioannina,Dept. of Informatics and Telecommunications,Arta,Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073108931","display_name":"Dimitrios Kiosses","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":"Dimitrios Kiosses","raw_affiliation_strings":["University of Ioannina,Dept. of Informatics and Telecommunications,Arta,Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ioannina,Dept. of Informatics and Telecommunications,Arta,Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029443523","display_name":"Aris Magklaras","orcid":"https://orcid.org/0000-0002-6147-2322"},"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":"Aris Magklaras","raw_affiliation_strings":["Univerity of Patras,Dept. of Electrical and Computer Engineering,Patras,Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univerity of Patras,Dept. of Electrical and Computer Engineering,Patras,Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052714215","display_name":"Panayiotis Alefragis","orcid":"https://orcid.org/0000-0002-1313-1750"},"institutions":[{"id":"https://openalex.org/I158716096","display_name":"University of Peloponnese","ror":"https://ror.org/04d4d3c02","country_code":"GR","type":"education","lineage":["https://openalex.org/I158716096"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Panayiotis Alefragis","raw_affiliation_strings":["University of Peloponnese,Dept. of Electrical and Computer Engineering,Patras,Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Peloponnese,Dept. of Electrical and Computer Engineering,Patras,Greece","institution_ids":["https://openalex.org/I158716096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63714874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8442999720573425,"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.8442999720573425,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.05310000106692314,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.03460000082850456,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6523000001907349},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6407999992370605},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5812000036239624},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.5580999851226807},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49549999833106995},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.43230000138282776},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4113999903202057},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4023999869823456},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.3788999915122986}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6884999871253967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6590999960899353},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6523000001907349},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6407999992370605},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5812000036239624},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.5580999851226807},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49549999833106995},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.43230000138282776},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4113999903202057},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4023999869823456},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3555000126361847},{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.35260000824928284},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3483999967575073},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.34279999136924744},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3075999915599823},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.30570000410079956},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.28130000829696655},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2678000032901764},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2596000134944916},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.25589999556541443}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/seeda-cecnsm68644.2025.11329736","is_oa":false,"landing_page_url":"https://doi.org/10.1109/seeda-cecnsm68644.2025.11329736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 10th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.656241774559021,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W159012016","https://openalex.org/W1588382077","https://openalex.org/W1970176495","https://openalex.org/W1995048221","https://openalex.org/W1999924084","https://openalex.org/W2038956457","https://openalex.org/W2046437335","https://openalex.org/W2061929703","https://openalex.org/W2091642568","https://openalex.org/W2104517380","https://openalex.org/W2122736695","https://openalex.org/W2157846217","https://openalex.org/W2997614609","https://openalex.org/W3021534971","https://openalex.org/W3175071150","https://openalex.org/W3182259687","https://openalex.org/W4210714644","https://openalex.org/W4310364446","https://openalex.org/W4324052666","https://openalex.org/W4377695412","https://openalex.org/W4388859688","https://openalex.org/W4390075045","https://openalex.org/W4401503771"],"related_works":[],"abstract_inverted_index":{"This":[0,15],"paper":[1],"presents":[2],"a":[3,18,59,117,122],"way":[4],"of":[5,20,28,67,107],"computing":[6],"lower":[7,56,88,101],"bounds":[8,89,102],"for":[9,121],"the":[10,21,26,29,33,79,91,111],"Flexible":[11,112],"Job-shop":[12,113],"Scheduling":[13,114],"Problem.":[14],"occurs":[16],"through":[17],"formulation":[19],"related":[22],"problem":[23,40,51,120],"that":[24,31,64,81,110],"minimizes":[25],"workload":[27,35],"machine":[30],"has":[32],"maximum":[34],"across":[36],"all":[37],"machines.":[38],"The":[39],"is":[41,62,65,106,116],"modeled":[42],"using":[43],"Constraint":[44],"Programming":[45],"and":[46,85],"experiments":[47],"over":[48,125],"well":[49],"studied":[50,119],"instances":[52],"produce":[53,86],"rather":[54],"tight":[55],"bounds.":[57],"Moreover,":[58],"new":[60,87,99],"heuristic":[61],"proposed":[63],"capable":[66],"producing":[68],"high":[69],"quality":[70],"solutions":[71,74,84],"fast.":[72],"These":[73],"are":[75,103],"used":[76],"to":[77],"warm-start":[78],"solver":[80],"finds":[82],"better":[83],"if":[90],"optimality":[92],"cannot":[93],"be":[94],"proved.":[95],"For":[96],"some":[97],"cases":[98],"best":[100],"found,":[104],"which":[105],"interest":[108],"given":[109],"Problem":[115],"heavily":[118],"period":[123],"spanning":[124],"three":[126],"decades.":[127]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-21T00:00:00"}