{"id":"https://openalex.org/W4318603208","doi":"https://doi.org/10.1109/ssci51031.2022.10022172","title":"A problem-independent search heuristic for single machine scheduling with release dates and deadlines","display_name":"A problem-independent search heuristic for single machine scheduling with release dates and deadlines","publication_year":2022,"publication_date":"2022-12-04","ids":{"openalex":"https://openalex.org/W4318603208","doi":"https://doi.org/10.1109/ssci51031.2022.10022172"},"language":"en","primary_location":{"id":"doi:10.1109/ssci51031.2022.10022172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci51031.2022.10022172","pdf_url":null,"source":{"id":"https://openalex.org/S4363605327","display_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-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/A5085061623","display_name":"Yacine Laalaoui","orcid":"https://orcid.org/0000-0002-4213-6403"},"institutions":[{"id":"https://openalex.org/I179331831","display_name":"Taif University","ror":"https://ror.org/014g1a453","country_code":"SA","type":"education","lineage":["https://openalex.org/I179331831"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Yacine Laalaoui","raw_affiliation_strings":["Taif University,Information Technology Department,Taif,KSA","Information Technology Department, Taif University, Taif, KSA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Taif University,Information Technology Department,Taif,KSA","institution_ids":["https://openalex.org/I179331831"]},{"raw_affiliation_string":"Information Technology Department, Taif University, Taif, KSA","institution_ids":["https://openalex.org/I179331831"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076485787","display_name":"Rym M\u2019Hallah","orcid":"https://orcid.org/0000-0001-6775-7276"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rym M'Hallah","raw_affiliation_strings":["King&#x0027;s College London,Engineering Department,London,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King&#x0027;s College London,Engineering Department,London,UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3445,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53078775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"782","last_page":"789"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9990000128746033,"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.9952999949455261,"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.8594708442687988},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7778050899505615},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7416877150535583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7201876640319824},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6119888424873352},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.560795783996582},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5045918226242065},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48883575201034546},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4872114062309265},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48465901613235474},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.42101961374282837},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24683886766433716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14396902918815613},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13306286931037903},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1270340085029602},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0628608763217926}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8594708442687988},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7778050899505615},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7416877150535583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7201876640319824},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6119888424873352},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.560795783996582},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5045918226242065},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48883575201034546},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4872114062309265},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48465901613235474},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.42101961374282837},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24683886766433716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14396902918815613},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13306286931037903},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1270340085029602},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0628608763217926},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci51031.2022.10022172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci51031.2022.10022172","pdf_url":null,"source":{"id":"https://openalex.org/S4363605327","display_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1544328127","https://openalex.org/W1575452963","https://openalex.org/W1680219918","https://openalex.org/W1965559416","https://openalex.org/W1992334474","https://openalex.org/W1993465263","https://openalex.org/W1999823010","https://openalex.org/W2005329159","https://openalex.org/W2011292059","https://openalex.org/W2021700650","https://openalex.org/W2024009720","https://openalex.org/W2034972917","https://openalex.org/W2044872085","https://openalex.org/W2119614702","https://openalex.org/W2174095053","https://openalex.org/W2187557816","https://openalex.org/W2199580357","https://openalex.org/W2604575217"],"related_works":["https://openalex.org/W2153799489","https://openalex.org/W2060337406","https://openalex.org/W4381616416","https://openalex.org/W2057653555","https://openalex.org/W2131482998","https://openalex.org/W4251798786","https://openalex.org/W2167746336","https://openalex.org/W2377478537","https://openalex.org/W2051555966","https://openalex.org/W1991096018"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,14,19,39,44,56,77,94,110],"new":[4,78],"search":[5,108],"heuristic":[6],"F":[7,35,72,97,129],"that":[8,42,59,63,128],"determines":[9],"the":[10,66,69],"feasibility":[11],"of":[12,16,68],"scheduling":[13],"set":[15],"jobs":[17,53,62,74,89],"on":[18],"single":[20],"machine":[21],"where":[22],"each":[23],"job":[24],"is":[25,98,130],"characterized":[26],"by":[27,48],"its":[28,107,115],"release":[29],"date,":[30],"processing":[31],"time,":[32],"and":[33,54,138],"deadline.":[34],"alternates":[36],"between":[37],"(i)":[38],"construction":[40],"phase":[41,58],"builds":[43],"partial":[45],"feasible":[46],"solution":[47],"assigning":[49],"positions":[50],"to":[51,76,132],"on-time":[52,61],"(ii)":[55],"backtracking":[57],"removes":[60],"are":[64,117],"causing":[65],"tardiness":[67],"current":[70],"job.":[71],"chooses":[73],"according":[75],"dynamic":[79],"priority":[80],"rule.":[81],"It":[82,103],"stops":[83],"when":[84,91],"it":[85,92],"successfully":[86],"schedules":[87],"all":[88],"or":[90],"reaches":[93],"threshold":[95],"runtime.":[96],"unique":[99],"in":[100],"two":[101],"ways.":[102],"does":[104],"not":[105],"guide":[106],"via":[109],"problem-dependent":[111],"heuristic.":[112],"In":[113],"addition,":[114],"parameters":[116],"problem-independent;":[118],"thus,":[119],"require":[120],"no":[121],"tuning.":[122],"Experimental":[123],"results":[124],"provide":[125],"computational":[126],"evidence":[127],"superior":[131],"existing":[133],"heuristics":[134],"such":[135],"as":[136],"NEH":[137],"Profile":[139],"Fitting.":[140]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
