{"id":"https://openalex.org/W4387914628","doi":"https://doi.org/10.1109/codit58514.2023.10284420","title":"An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints","display_name":"An Efficient A* Like Algorithm for the Scheduling of Unit-Time Jobs with Release and Due Dates under Non Idling Constraints","publication_year":2023,"publication_date":"2023-07-03","ids":{"openalex":"https://openalex.org/W4387914628","doi":"https://doi.org/10.1109/codit58514.2023.10284420"},"language":"en","primary_location":{"id":"doi:10.1109/codit58514.2023.10284420","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/codit58514.2023.10284420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5048947754","display_name":"Philippe Chr\u00e9tienne","orcid":"https://orcid.org/0000-0002-4507-5757"},"institutions":[{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Philippe Chretienne","raw_affiliation_strings":["LIP6 Lab.,Paris"],"affiliations":[{"raw_affiliation_string":"LIP6 Lab.,Paris","institution_ids":["https://openalex.org/I4210159731"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111653166","display_name":"Alain Quilliot","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alain. Quilliot","raw_affiliation_strings":["UCA,LIMOS Lab.,Clermont-Ferrand,France"],"affiliations":[{"raw_affiliation_string":"UCA,LIMOS Lab.,Clermont-Ferrand,France","institution_ids":["https://openalex.org/I4210099416"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110632930","display_name":"H\u00e9l\u00e8ne Toussaint","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"H\u00e9l\u00e8ne Toussaint","raw_affiliation_strings":["UCA,LIMOS Lab.,Clermont-Ferrand,France"],"affiliations":[{"raw_affiliation_string":"UCA,LIMOS Lab.,Clermont-Ferrand,France","institution_ids":["https://openalex.org/I4210099416"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048947754"],"corresponding_institution_ids":["https://openalex.org/I4210159731"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24076441,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":null,"first_page":"136","last_page":"141"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9984999895095825,"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.9945999979972839,"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/scheduling","display_name":"Scheduling (production processes)","score":0.7299931645393372},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6258191466331482},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.551962673664093},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5361776947975159},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5292807221412659},{"id":"https://openalex.org/keywords/homogeneous-space","display_name":"Homogeneous space","score":0.5000531673431396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46161139011383057},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4592052102088928},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4418623447418213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2883314788341522},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09209254384040833},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08212721347808838}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7299931645393372},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6258191466331482},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.551962673664093},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5361776947975159},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5292807221412659},{"id":"https://openalex.org/C96469262","wikidata":"https://www.wikidata.org/wiki/Q1324364","display_name":"Homogeneous space","level":2,"score":0.5000531673431396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46161139011383057},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4592052102088928},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4418623447418213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2883314788341522},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09209254384040833},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08212721347808838},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/codit58514.2023.10284420","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/codit58514.2023.10284420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04611116v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04611116","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"9th International Conference on Control, Decision and Information Technologies (CoDIT), Jul 2023, Rome, Italy. pp.136-141, &#x27E8;10.1109/CODIT58514.2023.10284420&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2030945855","https://openalex.org/W2036317481","https://openalex.org/W2068221156","https://openalex.org/W2075214065","https://openalex.org/W2079870327","https://openalex.org/W2793045913","https://openalex.org/W2964319900","https://openalex.org/W4252209735","https://openalex.org/W4395017056"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W4291309325","https://openalex.org/W2950474130","https://openalex.org/W2737452945","https://openalex.org/W4313469555","https://openalex.org/W1547011777","https://openalex.org/W2263461846","https://openalex.org/W1514706798","https://openalex.org/W1985899403"],"abstract_inverted_index":{"We":[0,45],"study":[1],"here":[2,47],"the":[3,24,60],"problem":[4,31],"of":[5,26],"scheduling":[6],"unit-time":[7],"jobs":[8],"with":[9],"release":[10],"and":[11,22,57,65],"due":[12],"dates":[13],"on":[14],"identical":[15],"machines":[16],"while":[17],"meeting":[18],"a":[19,67],"non-idling":[20],"constraint":[21,77],"minimizing":[23],"number":[25],"active":[27],"machines.":[28],"Though":[29],"this":[30],"is":[32],"theoretically":[33],"solvable":[34],"in":[35],"polynomial":[36],"time,":[37],"designing":[38,64],"an":[39,43],"efficient":[40,69],"algorithm":[41,75],"remains":[42],"issue.":[44],"establish":[46],"several":[48],"theoretical":[49],"results":[50],"that":[51],"allow":[52],"us":[53],"to":[54],"break":[55],"symmetries":[56],"significantly":[58],"reduce":[59],"search":[61],"space,":[62],"before":[63],"testing":[66],"very":[68],"<tex":[70],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[71],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\boldsymbol{A}^{\\ast":[72],"}$</tex>":[73],"like":[74],"involving":[76],"propagation,":[78],"which":[79],"outperforms":[80],"standard":[81],"approaches":[82],"based":[83],"upon":[84],"ILP":[85],"formulations.":[86]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}