{"id":"https://openalex.org/W7171174960","doi":"https://doi.org/10.1007/s12351-026-01092-7","title":"Iterated greedy with strategic reconstruction for parallel machine problem with weighted tardiness and setup times","display_name":"Iterated greedy with strategic reconstruction for parallel machine problem with weighted tardiness and setup times","publication_year":2026,"publication_date":"2026-07-25","ids":{"openalex":"https://openalex.org/W7171174960","doi":"https://doi.org/10.1007/s12351-026-01092-7"},"language":"en","primary_location":{"id":"doi:10.1007/s12351-026-01092-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12351-026-01092-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12351-026-01092-7.pdf","source":{"id":"https://openalex.org/S140563256","display_name":"Operational Research","issn_l":"1109-2858","issn":["1109-2858","1866-1505"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s12351-026-01092-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018915291","display_name":"Ahmed Missaoui","orcid":null},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Ahmed Missaoui","raw_affiliation_strings":["School of Computer Science & IT, University College Cork, Rinn Artificial Intelligence, Cork, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science & IT, University College Cork, Rinn Artificial Intelligence, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5143621282","display_name":"Barry O\u2019Sullivan","orcid":null},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Barry O\u2019Sullivan","raw_affiliation_strings":["School of Computer Science & IT, University College Cork, Rinn Artificial Intelligence, Cork, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science & IT, University College Cork, Rinn Artificial Intelligence, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018915291"],"corresponding_institution_ids":["https://openalex.org/I27577105"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":{"value":3190,"currency":"USD","value_usd":3190},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.78336536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.7111999988555908,"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.7111999988555908,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.1200999990105629,"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/T12288","display_name":"Optimization and Search Problems","score":0.03550000116229057,"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/tardiness","display_name":"Tardiness","score":0.8245999813079834},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.6017000079154968},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5960000157356262},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.570900022983551},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5586000084877014},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5097000002861023},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5051000118255615},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5047000050544739}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8245999813079834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7217000126838684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6504999995231628},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.6017000079154968},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5960000157356262},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.570900022983551},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5586000084877014},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5097000002861023},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5051000118255615},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.478300005197525},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.3433000147342682},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30390000343322754},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.28519999980926514},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.2549000084400177}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12351-026-01092-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12351-026-01092-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12351-026-01092-7.pdf","source":{"id":"https://openalex.org/S140563256","display_name":"Operational Research","issn_l":"1109-2858","issn":["1109-2858","1866-1505"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operational Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s12351-026-01092-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12351-026-01092-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12351-026-01092-7.pdf","source":{"id":"https://openalex.org/S140563256","display_name":"Operational Research","issn_l":"1109-2858","issn":["1109-2858","1866-1505"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5426973104476929,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320318630","display_name":"Irish Research eLibrary","ror":null},{"id":"https://openalex.org/F4320320863","display_name":"University College Cork","ror":"https://ror.org/03265fv13"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7171174960.pdf","grobid_xml":"https://content.openalex.org/works/W7171174960.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1982388391","https://openalex.org/W1990154239","https://openalex.org/W1997948597","https://openalex.org/W2006751452","https://openalex.org/W2023495086","https://openalex.org/W2030498135","https://openalex.org/W2035726437","https://openalex.org/W2050693033","https://openalex.org/W2052693123","https://openalex.org/W2052841853","https://openalex.org/W2071277483","https://openalex.org/W2090069860","https://openalex.org/W2096302562","https://openalex.org/W2113526966","https://openalex.org/W2117416910","https://openalex.org/W2174210390","https://openalex.org/W2327805511","https://openalex.org/W2624898391","https://openalex.org/W2744488249","https://openalex.org/W2792243022","https://openalex.org/W2806372432","https://openalex.org/W2947605446","https://openalex.org/W2979872753","https://openalex.org/W2998765444","https://openalex.org/W3005672367","https://openalex.org/W3025562615","https://openalex.org/W3049611292","https://openalex.org/W3129404727","https://openalex.org/W3162058293","https://openalex.org/W3199544617","https://openalex.org/W4212807509","https://openalex.org/W4224268770","https://openalex.org/W4393407322"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"On-time":[1],"delivery":[2],"is":[3],"becoming":[4],"increasingly":[5],"crucial":[6],"for":[7,15],"industrial":[8],"companies,":[9],"due":[10,39],"to":[11,40,49],"their":[12],"customers\u2019":[13],"need":[14],"deliveries":[16],"by":[17,80],"specific":[18],"dates.":[19],"This":[20],"paper":[21],"investigates":[22],"parallel":[23],"machine":[24],"scheduling":[25],"problems":[26],"with":[27,68,83],"sequence-dependent":[28],"setup":[29],"times,":[30],"a":[31,56,69,92],"combinatorial":[32],"challenge":[33],"that":[34,99],"has":[35],"gained":[36],"significant":[37],"attention":[38],"its":[41],"practicality":[42],"and":[43,62,86],"relevance":[44],"in":[45],"real-world":[46],"applications.":[47],"Aiming":[48],"reduce":[50],"total":[51],"weighted":[52],"tardiness,":[53],"we":[54],"introduce":[55],"mixed":[57],"integer":[58],"linear":[59],"programming":[60],"model":[61],"an":[63],"effective":[64],"iterated":[65,102],"greedy":[66,103],"approach":[67],"strategic":[70],"reconstruction":[71],"operator.":[72],"We":[73],"evaluate":[74],"the":[75,100],"performance":[76],"of":[77,95],"our":[78],"methods":[79],"comparing":[81],"it":[82],"six":[84],"well-established":[85],"related":[87],"approaches.":[88],"Our":[89],"experiments,":[90],"using":[91],"benchmark":[93],"set":[94],"900":[96],"instances,":[97],"validate":[98],"introduced":[101],"algorithm":[104],"consistently":[105],"produces":[106],"high-quality":[107],"solutions.":[108]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-07-26T00:00:00"}