{"id":"https://openalex.org/W4413131985","doi":"https://doi.org/10.46298/lmcs-21(3:16)2025","title":"Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling","display_name":"Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling","publication_year":2025,"publication_date":"2025-08-07","ids":{"openalex":"https://openalex.org/W4413131985","doi":"https://doi.org/10.46298/lmcs-21(3:16)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(3:16)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:16)2025","pdf_url":"https://lmcs.episciences.org/16318/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16318/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027435948","display_name":"Mohammed M. S. El-Kholany","orcid":"https://orcid.org/0000-0002-1088-2081"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mohammed M. S. El-Kholany","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006066772","display_name":"Martin Gebser","orcid":"https://orcid.org/0000-0002-8010-4752"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin Gebser","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055185135","display_name":"Konstantin Schekotihin","orcid":"https://orcid.org/0000-0002-0286-0958"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Konstantin Schekotihin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027435948"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10827348,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9782999753952026,"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/computer-science","display_name":"Computer science","score":0.7407370209693909},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6628727912902832},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.563113808631897},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5492663979530334},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5083276629447937},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4160464406013489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1813451647758484},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10830119252204895}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7407370209693909},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6628727912902832},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.563113808631897},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5492663979530334},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5083276629447937},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4160464406013489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1813451647758484},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10830119252204895},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(3:16)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:16)2025","pdf_url":"https://lmcs.episciences.org/16318/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:2b27f9fb06174c599aaf8a13e1317799","is_oa":true,"landing_page_url":"https://doaj.org/article/2b27f9fb06174c599aaf8a13e1317799","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":"Logical Methods in Computer Science, Vol Volume 21, Issue 3 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(3:16)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:16)2025","pdf_url":"https://lmcs.episciences.org/16318/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.550000011920929,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413131985.pdf","grobid_xml":"https://content.openalex.org/works/W4413131985.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W4321353415","https://openalex.org/W2745001401","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2130974462","https://openalex.org/W3204654320"],"abstract_inverted_index":{"The":[0],"Job-shop":[1],"Scheduling":[2],"Problem":[3],"(JSP)":[4],"is":[5],"a":[6,17,24,65,81,99,108],"well-known":[7],"and":[8,53,106,118,137],"challenging":[9],"combinatorial":[10],"optimization":[11,147,167,183],"problem":[12,42],"in":[13,23,98,113],"which":[14],"tasks":[15,75],"sharing":[16],"machine":[18],"are":[19],"to":[20,70,145,150,153,173,205],"be":[21,31,50,95],"arranged":[22],"sequence":[25],"such":[26,86],"that":[27,87,165,192],"encompassing":[28],"jobs":[29],"can":[30,49,94],"completed":[32],"as":[33,35,123,125],"early":[34],"possible.":[36],"In":[37,188],"this":[38],"paper,":[39],"we":[40,132,190],"investigate":[41,107],"decomposition":[43,68,111],"into":[44,76,140,201],"time":[45,121,134,202],"windows":[46,122,203],"whose":[47],"operations":[48,85],"successively":[51],"scheduled":[52],"optimized":[54],"by":[55,168],"means":[56],"of":[57,84,102,110,115,120],"multi-shot":[58,169],"Answer":[59],"Set":[60],"Programming":[61],"(ASP)":[62],"solving.":[63],"From":[64],"computational":[66],"perspective,":[67],"aims":[69],"split":[71],"highly":[72],"complex":[73],"scheduling":[74,143],"better":[77,175],"manageable":[78],"subproblems":[79],"with":[80,197],"balanced":[82],"number":[83,117],"good-quality":[88],"or":[89],"even":[90],"optimal":[91],"partial":[92,155],"solutions":[93,195],"reliably":[96],"found":[97],"small":[100],"fraction":[101],"runtime.":[103],"We":[104],"devise":[105],"variety":[109],"strategies":[112],"terms":[114],"the":[116,141,151,185],"size":[119],"well":[124],"heuristics":[126],"for":[127],"choosing":[128],"their":[129],"operations.":[130],"Moreover,":[131],"incorporate":[133],"window":[135],"overlapping":[136],"compression":[138],"techniques":[139],"iterative":[142],"process":[144],"counteract":[146],"limitations":[148],"due":[149],"restriction":[152],"window-wise":[154],"schedules.":[156],"Our":[157],"experiments":[158],"on":[159,184],"different":[160],"JSP":[161],"benchmark":[162],"sets":[163],"show":[164],"successive":[166],"ASP":[170],"solving":[171],"leads":[172,204],"substantially":[174],"schedules":[176],"within":[177],"tight":[178],"runtime":[179],"limits":[180],"than":[181],"single-shot":[182],"full":[186],"problem.":[187],"particular,":[189],"find":[191],"decomposing":[193],"initial":[194],"obtained":[196],"proficient":[198],"heuristic":[199],"methods":[200],"improved":[206],"solution":[207],"quality.":[208]},"counts_by_year":[],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}