{"id":"https://openalex.org/W2026682089","doi":"https://doi.org/10.1057/palgrave.jors.2601389","title":"A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem","display_name":"A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem","publication_year":2002,"publication_date":"2002-10-17","ids":{"openalex":"https://openalex.org/W2026682089","doi":"https://doi.org/10.1057/palgrave.jors.2601389","mag":"2026682089"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601389","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601389","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-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/A5075438770","display_name":"Federico Della Croce","orcid":"https://orcid.org/0000-0003-2897-183X"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"F Della Croce","raw_affiliation_strings":["DAI, Politecnico di Torino Turin Italy"],"affiliations":[{"raw_affiliation_string":"DAI, Politecnico di Torino Turin Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050636913","display_name":"Vincent t'Kindt","orcid":"https://orcid.org/0000-0002-7440-2980"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"V T'kindt","raw_affiliation_strings":["E3I, Universit\u00e9 de Tours Tours France"],"affiliations":[{"raw_affiliation_string":"E3I, Universit\u00e9 de Tours Tours France","institution_ids":["https://openalex.org/I110017253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075438770"],"corresponding_institution_ids":["https://openalex.org/I177477856"],"apc_list":null,"apc_paid":null,"fwci":10.7092,"has_fulltext":false,"cited_by_count":93,"citation_normalized_percentile":{"value":0.98432201,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"53","issue":"11","first_page":"1275","last_page":"1280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.9970999956130981,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9958999752998352,"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/beam-search","display_name":"Beam search","score":0.8405039310455322},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.7545821666717529},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7459352016448975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6168057918548584},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5730632543563843},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5619534850120544},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5381416082382202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5170924663543701},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5040746927261353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4675442576408386},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4350596070289612},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3554280996322632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2706212103366852}],"concepts":[{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.8405039310455322},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7545821666717529},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7459352016448975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6168057918548584},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5730632543563843},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5619534850120544},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5381416082382202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5170924663543701},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5040746927261353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4675442576408386},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4350596070289612},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3554280996322632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2706212103366852},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1057/palgrave.jors.2601389","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601389","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00803303v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00803303","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the Operational Research Society, 2002, 53 (11), pp.1275-1280","raw_type":"Journal articles"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:53:y:2002:i:11:d:10.1057_palgrave.jors.2601389","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601389","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W81587953","https://openalex.org/W1530491641","https://openalex.org/W1965182192","https://openalex.org/W1969455357","https://openalex.org/W1977745207","https://openalex.org/W1983196874","https://openalex.org/W1997547289","https://openalex.org/W1997568326","https://openalex.org/W2008713008","https://openalex.org/W2025816555","https://openalex.org/W2100233978","https://openalex.org/W2576116471"],"related_works":["https://openalex.org/W4386269615","https://openalex.org/W4390091683","https://openalex.org/W1994919150","https://openalex.org/W58921990","https://openalex.org/W2204575588","https://openalex.org/W2081821176","https://openalex.org/W3084994579","https://openalex.org/W3106196307","https://openalex.org/W4320350517","https://openalex.org/W2998661990"],"abstract_inverted_index":{"This":[0,12],"paper":[1],"deals":[2],"with":[3,49,105],"the":[4,20,32,69,77,90,111,115],"one-machine":[5],"dynamic":[6],"total":[7,78],"completion":[8],"time":[9,25,103],"scheduling":[10],"problem.":[11],"problem":[13],"is":[14,28,42,74,83,89,95],"known":[15],"to":[16,60,97,107],"be":[17],"NP-hard":[18],"in":[19,99],"strong":[21],"sense.":[22],"A":[23],"polynomial":[24],"heuristic":[26],"algorithm":[27,41,94],"proposed":[29,93],"which":[30],"applies":[31],"recently":[33],"introduced":[34],"Recovering":[35],"Beam":[36],"Search":[37],"(RBS)":[38],"approach.":[39],"The":[40,92],"based":[43],"on":[44],"a":[45,55],"beam":[46,51,70],"search":[47,71],"procedure":[48],"unitary":[50],"width":[52],"and":[53],"includes":[54],"recovering":[56],"subroutine":[57],"that":[58,76],"allows":[59],"overcome":[61],"wrong":[62],"decisions":[63],"taken":[64],"at":[65],"higher":[66],"levels":[67],"of":[68,80,114],"tree.":[72],"It":[73],"shown":[75],"number":[79],"considered":[81],"nodes":[82],"bounded":[84],"by":[85],"n":[86,88],"where":[87],"jobsize.":[91],"able":[96],"solve":[98],"very":[100],"short":[101],"CPU":[102],"problems":[104],"up":[106],"500":[108],"jobs":[109],"outperforming":[110],"best":[112],"state":[113],"art":[116],"heuristics.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}