{"id":"https://openalex.org/W4283797444","doi":"https://doi.org/10.1017/s1471068422000217","title":"Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling","display_name":"Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling","publication_year":2022,"publication_date":"2022-07-01","ids":{"openalex":"https://openalex.org/W4283797444","doi":"https://doi.org/10.1017/s1471068422000217"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068422000217","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068422000217","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1017/s1471068422000217","any_repository_has_fulltext":false},"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":[{"id":"https://openalex.org/I145487455","display_name":"Cairo University","ror":"https://ror.org/03q21mh05","country_code":"EG","type":"education","lineage":["https://openalex.org/I145487455"]},{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT","EG"],"is_corresponding":true,"raw_author_name":"MOHAMMED M. S. EL-KHOLANY","raw_affiliation_strings":["University of Klagenfurt, Austria and Cairo University, Egypt (e-mail:"],"raw_orcid":"https://orcid.org/0000-0002-1088-2081","affiliations":[{"raw_affiliation_string":"University of Klagenfurt, Austria and Cairo University, Egypt (e-mail:","institution_ids":["https://openalex.org/I4210166741","https://openalex.org/I145487455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006066772","display_name":"Martin Gebser","orcid":"https://orcid.org/0000-0002-8010-4752"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]},{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"MARTIN GEBSER","raw_affiliation_strings":["University of Klagenfurt, Austria and Graz University of Technology, Austria (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Klagenfurt, Austria and Graz University of Technology, Austria (e-mail:","institution_ids":["https://openalex.org/I4092182","https://openalex.org/I4210166741"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055185135","display_name":"Konstantin Schekotihin","orcid":"https://orcid.org/0000-0002-0286-0958"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"KONSTANTIN SCHEKOTIHIN","raw_affiliation_strings":["University of Klagenfurt, Austria (e-mail:"],"raw_orcid":"https://orcid.org/0000-0002-0286-0958","affiliations":[{"raw_affiliation_string":"University of Klagenfurt, Austria (e-mail:","institution_ids":["https://openalex.org/I4210166741"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027435948"],"corresponding_institution_ids":["https://openalex.org/I145487455","https://openalex.org/I4210166741"],"apc_list":null,"apc_paid":null,"fwci":2.5641,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89702532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"22","issue":"4","first_page":"623","last_page":"639"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983000159263611,"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/T10142","display_name":"Formal Methods in Verification","score":0.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8439866304397583},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6718011498451233},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5736676454544067},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5387073755264282},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5089435577392578},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.140921950340271},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09679463505744934}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8439866304397583},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6718011498451233},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5736676454544067},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5387073755264282},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5089435577392578},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.140921950340271},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09679463505744934},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068422000217","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068422000217","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s1471068422000217","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068422000217","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1488662850","https://openalex.org/W1507539267","https://openalex.org/W1885448744","https://openalex.org/W1970176495","https://openalex.org/W1998355772","https://openalex.org/W1998510734","https://openalex.org/W2036786338","https://openalex.org/W2088304441","https://openalex.org/W2101666345","https://openalex.org/W2136088569","https://openalex.org/W2143183418","https://openalex.org/W2148287610","https://openalex.org/W2156391157","https://openalex.org/W2157846217","https://openalex.org/W2552503268","https://openalex.org/W2743045177","https://openalex.org/W2790306361","https://openalex.org/W2795456052","https://openalex.org/W2889394362","https://openalex.org/W2963234253","https://openalex.org/W2973473096","https://openalex.org/W2985257580","https://openalex.org/W2994667977","https://openalex.org/W3012364298","https://openalex.org/W3034428006","https://openalex.org/W3128925444","https://openalex.org/W3141175846","https://openalex.org/W3165018699","https://openalex.org/W3191896485","https://openalex.org/W3198389305","https://openalex.org/W3203072813","https://openalex.org/W4205490898","https://openalex.org/W4254790956","https://openalex.org/W4302419487","https://openalex.org/W6732635222"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2401723157","https://openalex.org/W2952904874","https://openalex.org/W324626582","https://openalex.org/W3204654320"],"abstract_inverted_index":{"Abstract":[0],"Scheduling":[1,26],"methods":[2,85],"are":[3,44,94],"important":[4],"for":[5,226],"effective":[6],"production":[7],"and":[8,17,33,73,113,167,182,205,217,236],"logistics":[9],"management,":[10],"where":[11,286],"tasks":[12,40,135],"need":[13],"to":[14,45,80,90,130,244,250,271,295],"be":[15,46,56,70,110,155],"allocated":[16],"performed":[18],"with":[19,140,290],"limited":[20],"resources.":[21],"In":[22,97],"particular,":[23],"the":[24,78,165,175,200,215,240,276,283,287,291,298,316,318],"Job-shop":[25],"Problem":[27],"(JSP)":[28],"is":[29,86],"a":[30,42,49,125,141,159,207,305],"well":[31,223],"known":[32],"challenging":[34],"combinatorial":[35],"optimization":[36,84,247,265,281],"problem":[37,102,171,325],"in":[38,48,158,196,212],"which":[39],"sharing":[41],"machine":[43],"arranged":[47],"sequence":[50],"such":[51],"that":[52,63,147,263],"encompassing":[53],"jobs":[54,181],"can":[55,69,109,154],"completed":[57],"as":[58,60,222,224],"early":[59],"possible.":[61],"Given":[62],"already":[64],"moderately":[65],"sized":[66],"JSP":[67,256],"instances":[68],"highly":[71,132],"combinatorial,":[72],"neither":[74],"optimal":[75,151],"schedules":[76,93,184,274],"nor":[77],"runtime":[79,198,277],"termination":[81],"of":[82,95,117,144,162,169,177,209,214,219,259,293],"complete":[83],"known,":[87],"efficient":[88],"approaches":[89],"approximate":[91],"good-quality":[92,148],"interest.":[96],"this":[98],"paper,":[99],"we":[100,231],"propose":[101],"decomposition":[103,128,172,210],"into":[104,136,239],"time":[105,187,220,233],"windows":[106,188,221],"whose":[107],"operations":[108,145,178,294],"successively":[111],"scheduled":[112],"optimized":[114,185],"by":[115,186,266,324],"means":[116],"multi-shot":[118,267,311],"Answer":[119],"Set":[120],"Programming":[121,308],"(ASP)":[122],"solving.":[123],"From":[124],"computational":[126],"perspective,":[127],"aims":[129],"split":[131],"complex":[133],"scheduling":[134,242],"better":[137,191,273],"manageable":[138],"subproblems":[139],"balanced":[142],"number":[143,216,292],"so":[146],"or":[149],"even":[150],"partial":[152,183,251],"solutions":[153,193],"reliably":[156],"found":[157],"small":[160],"fraction":[161],"runtime.":[163],"Regarding":[164],"feasibility":[166],"quality":[168,301],"solutions,":[170],"must":[173],"respect":[174],"precedence":[176],"within":[179,275],"their":[180,228],"should":[189],"yield":[190],"global":[192,280],"than":[194,279],"obtainable":[195],"similar":[197],"on":[199,255,282],"entire":[201],"instance.":[202],"We":[203],"devise":[204],"investigate":[206],"variety":[208],"strategies":[211],"terms":[213],"size":[218],"heuristics":[225],"choosing":[227],"operations.":[229],"Moreover,":[230],"incorporate":[232],"window":[234],"overlapping":[235],"compression":[237],"techniques":[238],"iterative":[241],"process":[243],"counteract":[245],"window-wise":[246],"limitations":[248],"restricted":[249],"schedules.":[252],"Our":[253],"experiments":[254],"benchmark":[257],"sets":[258],"several":[260],"sizes":[261],"show":[262],"successive":[264],"ASP":[268],"solving":[269,312],"leads":[270],"substantially":[272],"limit":[278],"full":[284],"problem,":[285],"gap":[288],"increases":[289],"schedule.":[296],"While":[297],"obtained":[299],"solution":[300],"still":[302],"remains":[303],"behind":[304],"state-of-the-art":[306],"Constraint":[307],"system,":[309],"our":[310],"approach":[313],"comes":[314],"closer":[315],"larger":[317],"instance":[319],"size,":[320],"demonstrating":[321],"good":[322],"scalability":[323],"decomposition.":[326]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":8}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}