{"id":"https://openalex.org/W4318053678","doi":"https://doi.org/10.1017/s1471068423000017","title":"Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling","display_name":"Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling","publication_year":2023,"publication_date":"2023-01-26","ids":{"openalex":"https://openalex.org/W4318053678","doi":"https://doi.org/10.1017/s1471068423000017"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068423000017","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s1471068423000017","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/97CCF0F184BD06B40A6E4D66FF326E35/S1471068423000017a.pdf/div-class-title-answer-set-programming-for-lexicographical-makespan-optimisation-in-parallel-machine-scheduling-div.pdf","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://www.cambridge.org/core/services/aop-cambridge-core/content/view/97CCF0F184BD06B40A6E4D66FF326E35/S1471068423000017a.pdf/div-class-title-answer-set-programming-for-lexicographical-makespan-optimisation-in-parallel-machine-scheduling-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082178480","display_name":"Thomas Eiter","orcid":"https://orcid.org/0000-0001-6003-6345"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"THOMAS EITER","raw_affiliation_strings":["Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails:"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074262091","display_name":"Tobias Geibinger","orcid":"https://orcid.org/0000-0002-0856-7162"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"TOBIAS GEIBINGER","raw_affiliation_strings":["Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails:"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084546772","display_name":"Nysret Musliu","orcid":"https://orcid.org/0000-0002-3992-8637"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"NYSRET MUSLIU","raw_affiliation_strings":["Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails:"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028255011","display_name":"Johannes Oetsch","orcid":"https://orcid.org/0000-0002-9902-7662"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"JOHANNES OETSCH","raw_affiliation_strings":["Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails:"],"affiliations":[{"raw_affiliation_string":"Institute of Logic and Computation, Vienna University of Technology (TU Wien), Austria (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079309646","display_name":"Peter Sko\u010dovsk\u00fd","orcid":null},"institutions":[{"id":"https://openalex.org/I889804353","display_name":"Robert Bosch (Germany)","ror":"https://ror.org/01fe0jt45","country_code":"DE","type":"company","lineage":["https://openalex.org/I889804353"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"PETER SKO\u010cOVSK\u00dd","raw_affiliation_strings":["Bosch Center for AI, Robert Bosch Campus 1, D-71272 Renningen, Germany (e-mails:"],"affiliations":[{"raw_affiliation_string":"Bosch Center for AI, Robert Bosch Campus 1, D-71272 Renningen, Germany (e-mails:","institution_ids":["https://openalex.org/I889804353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102841687","display_name":"Daria Stepanova","orcid":"https://orcid.org/0000-0001-8654-5121"},"institutions":[{"id":"https://openalex.org/I889804353","display_name":"Robert Bosch (Germany)","ror":"https://ror.org/01fe0jt45","country_code":"DE","type":"company","lineage":["https://openalex.org/I889804353"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"DARIA STEPANOVA","raw_affiliation_strings":["Bosch Center for AI, Robert Bosch Campus 1, D-71272 Renningen, Germany (e-mails:"],"affiliations":[{"raw_affiliation_string":"Bosch Center for AI, Robert Bosch Campus 1, D-71272 Renningen, Germany (e-mails:","institution_ids":["https://openalex.org/I889804353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5082178480"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.3543,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62915096,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"23","issue":"6","first_page":"1281","last_page":"1306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994999766349792,"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.9994999766349792,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"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/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8415457010269165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8280095458030701},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7950788736343384},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.7232105731964111},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6040864586830139},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.5778504014015198},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5568938255310059},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5472743511199951},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49851179122924805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49336567521095276},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.43673980236053467},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.36859190464019775},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.31244274973869324},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3115280866622925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2413751482963562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09519389271736145}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8415457010269165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8280095458030701},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7950788736343384},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.7232105731964111},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6040864586830139},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.5778504014015198},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5568938255310059},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5472743511199951},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49851179122924805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49336567521095276},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.43673980236053467},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.36859190464019775},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.31244274973869324},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3115280866622925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2413751482963562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09519389271736145},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068423000017","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s1471068423000017","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/97CCF0F184BD06B40A6E4D66FF326E35/S1471068423000017a.pdf/div-class-title-answer-set-programming-for-lexicographical-makespan-optimisation-in-parallel-machine-scheduling-div.pdf","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/s1471068423000017","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s1471068423000017","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/97CCF0F184BD06B40A6E4D66FF326E35/S1471068423000017a.pdf/div-class-title-answer-set-programming-for-lexicographical-makespan-optimisation-in-parallel-machine-scheduling-div.pdf","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":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4318053678.pdf","grobid_xml":"https://content.openalex.org/works/W4318053678.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1834040419","https://openalex.org/W1982736809","https://openalex.org/W1985706454","https://openalex.org/W1997364826","https://openalex.org/W2037829364","https://openalex.org/W2071784417","https://openalex.org/W2078214107","https://openalex.org/W2089928029","https://openalex.org/W2091138122","https://openalex.org/W2096621306","https://openalex.org/W2097246734","https://openalex.org/W2146219471","https://openalex.org/W2157793635","https://openalex.org/W2159875930","https://openalex.org/W2187530266","https://openalex.org/W2214401117","https://openalex.org/W2360717914","https://openalex.org/W2407319686","https://openalex.org/W2803412322","https://openalex.org/W2887704695","https://openalex.org/W2896685544","https://openalex.org/W2924704542","https://openalex.org/W2946766242","https://openalex.org/W2963234253","https://openalex.org/W2963268497","https://openalex.org/W2985257580","https://openalex.org/W2994667977","https://openalex.org/W3080772958","https://openalex.org/W3095899369","https://openalex.org/W3206326277","https://openalex.org/W4254790956","https://openalex.org/W6673070848","https://openalex.org/W6675103656","https://openalex.org/W6732635222","https://openalex.org/W6790794663"],"related_works":["https://openalex.org/W2009976334","https://openalex.org/W1588925719","https://openalex.org/W1991617491","https://openalex.org/W1511336005","https://openalex.org/W1903938722","https://openalex.org/W1875972884","https://openalex.org/W34858115","https://openalex.org/W2785378597","https://openalex.org/W2141565127","https://openalex.org/W1575307414"],"abstract_inverted_index":{"Abstract":[0],"We":[1,103],"deal":[2],"with":[3,11,190],"a":[4,19,176],"challenging":[5],"scheduling":[6],"problem":[7,186],"on":[8,49],"parallel":[9],"machines":[10,37,57,90],"sequence-dependent":[12],"setup":[13],"times":[14],"and":[15,59,80,96,124,166,180,187,195],"release":[16],"dates":[17],"from":[18],"real-world":[20],"application":[21,106],"of":[22,44,66,100,107,121,142],"semiconductor":[23],"work-shop":[24],"production.":[25],"There,":[26],"jobs":[27,46,60],"can":[28,38],"only":[29,68],"be":[30,63],"processed":[31],"by":[32,138,144],"dedicated":[33],"machines,":[34],"thus":[35],"few":[36],"determine":[39],"the":[40,50,69,73,83,98,101,105,119,125,148],"makespan":[41],"almost":[42],"regardless":[43],"how":[45],"are":[47],"scheduled":[48],"remaining":[51],"ones.":[52],"This":[53,86],"causes":[54],"problems":[55],"when":[56],"fail":[58],"need":[61],"to":[62,111],"rescheduled.":[64],"Instead":[65],"optimising":[67],"makespan,":[70],"we":[71,150,162],"put":[72],"individual":[74],"machine":[75],"spans":[76],"in":[77],"non-ascending":[78],"order":[79],"lexicographically":[81],"minimise":[82],"resulting":[84],"tuples.":[85],"achieves":[87],"that":[88,154,172],"all":[89],"complete":[91],"as":[92,94],"early":[93],"possible":[95],"increases":[97],"robustness":[99],"schedule.":[102],"study":[104,163],"answer-set":[108],"programming":[109,193],"(ASP)":[110],"solve":[112],"this":[113,185],"problem.":[114],"While":[115],"ASP":[116,143,173],"eases":[117],"modelling,":[118],"combination":[120],"timing":[122],"constraints":[123],"considered":[126],"objective":[127],"function":[128],"challenges":[129],"current":[130],"solving":[131],"technology.":[132],"The":[133],"former":[134],"issue":[135],"is":[136,174,188],"addressed":[137],"using":[139],"an":[140],"extension":[141],"difference":[145],"logic.":[146],"For":[147],"latter,":[149],"devise":[151],"different":[152,164],"algorithms":[153],"use":[155],"multi-shot":[156],"solving.":[157],"To":[158],"tackle":[159],"industrial-sized":[160],"instances,":[161],"approximations":[165],"heuristics.":[167],"Our":[168],"experimental":[169],"results":[170],"show":[171],"indeed":[175],"promising":[177],"knowledge":[178],"representation":[179],"reasoning":[181],"(KRR)":[182],"paradigm":[183],"for":[184],"competitive":[189],"state-of-the-art":[191],"constraint":[192],"(CP)":[194],"Mixed-Integer":[196],"Programming":[197],"(MIP)":[198],"solvers.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2023-01-26T00:00:00"}