{"id":"https://openalex.org/W2811342826","doi":"https://doi.org/10.1109/codit.2018.8394957","title":"Scheduling People's Daily Activities Using Temporal Constraints Satisfaction Problem","display_name":"Scheduling People's Daily Activities Using Temporal Constraints Satisfaction Problem","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2811342826","doi":"https://doi.org/10.1109/codit.2018.8394957","mag":"2811342826"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2018.8394957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2018.8394957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th 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/A5060149296","display_name":"Feras Sameer Alhaijawy","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Feras Sameer Alhaijawy","raw_affiliation_strings":["Computer Science and Engineering Department, University Politehnica of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, University Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074295040","display_name":"Adina Magda Florea","orcid":"https://orcid.org/0000-0001-7249-1871"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Adina Magda Florea","raw_affiliation_strings":["Computer Science and Engineering Department, University Politehnica of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, University Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060149296"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08153245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"876","last_page":"881"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9724000096321106,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.9573408961296082},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6631514430046082},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6531074643135071},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6473134756088257},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5770401358604431},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5251902341842651},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5184197425842285},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.47894150018692017},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.45410048961639404},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4076279103755951},{"id":"https://openalex.org/keywords/industrial-engineering","display_name":"Industrial engineering","score":0.3349330723285675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3054516911506653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1863413155078888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1586795151233673},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14077723026275635}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9573408961296082},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6631514430046082},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6531074643135071},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6473134756088257},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5770401358604431},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5251902341842651},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5184197425842285},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.47894150018692017},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.45410048961639404},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4076279103755951},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.3349330723285675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3054516911506653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1863413155078888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1586795151233673},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14077723026275635},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","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":1,"locations":[{"id":"doi:10.1109/codit.2018.8394957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2018.8394957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W640625031","https://openalex.org/W793524323","https://openalex.org/W1576780029","https://openalex.org/W1587303597","https://openalex.org/W1967190838","https://openalex.org/W1969062313","https://openalex.org/W2080223813","https://openalex.org/W2083523511","https://openalex.org/W2111143264","https://openalex.org/W2162778049"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2354343466","https://openalex.org/W3014398131","https://openalex.org/W3122634451","https://openalex.org/W2997121997","https://openalex.org/W2188549339","https://openalex.org/W1576780029","https://openalex.org/W2101480270"],"abstract_inverted_index":{"One":[0],"of":[1,9,22,30,39,70,85,102],"the":[2,7,20,32,37,56,63,68,83,86,105,120],"most":[3],"prominent":[4],"approaches":[5],"in":[6,43,94],"field":[8],"planning":[10],"and":[11,48,81,98,131],"scheduling":[12,44,52,64],"is":[13,19],"Constraint":[14,72],"Satisfaction":[15,73],"Problem":[16,74],"(CSP),":[17],"which":[18],"process":[21,65],"finding":[23],"a":[24,28,79,95,100,114,124],"solution":[25,125],"according":[26],"to":[27,35,58,91,110,112],"set":[29,101],"constraints,":[31],"paper":[33,77],"aims":[34],"discuss":[36],"possibility":[38],"using":[40,67,129],"constraint":[41],"satisfaction":[42],"people's":[45],"daily":[46,89],"activities":[47],"proposes":[49,99],"an":[50],"automatic":[51],"algorithm":[53,106],"that":[54,117],"aids":[55],"users":[57],"plan":[59],"their":[60],"everyday":[61],"activities,":[62],"released":[66],"concepts":[69],"Temporal":[71],"(TCSP).":[75],"The":[76],"suggests":[78],"scenario":[80],"explains":[82],"properties":[84],"human":[87],"being's":[88],"activity":[90],"be":[92,127],"absorbed":[93],"TCSP":[96],"algorithm,":[97],"special":[103],"constraints":[104],"will":[107,126],"tie":[108],"itself":[109],"them":[111],"produce":[113],"final":[115],"schedule":[116],"may":[118],"satisfy":[119],"user.":[121],"Searching":[122],"for":[123],"done":[128],"backtracking":[130],"back-jumping":[132],"techniques.":[133]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}