{"id":"W4318604517","doi":"10.1109/ssci51031.2022.10022250","title":"A Constraint Satisfaction Problem (CSP) Approach for the Nurse Scheduling Problem","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical optimization; Heuristics; Constraint satisfaction problem; Constraint satisfaction; Computer science; Nurse scheduling problem; Constraint programming; Job shop scheduling; Scheduling (production processes); Constraint satisfaction dual problem; Constraint (computer-aided design); Integer programming; Branch and bound; Linear programming; Combinatorial optimization; Constraint logic programming; Mathematics; Artificial intelligence; Routing (electronic design automation); Flow shop scheduling","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004667276,0.0003544418,0.0003984918,0.000458556,0.003290991,0.0006366848,0.001216022,0.00008926374,0.000654687],"category_scores_gemma":[0.0005285415,0.0002773344,0.0003607447,0.001847671,0.000485586,0.0004556646,0.0001343455,0.0007147267,0.0001262066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000281463,"about_ca_system_score_gemma":0.0005486688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009272057,"about_ca_topic_score_gemma":0.00002612037,"domain_scores_codex":[0.9943129,0.0004545408,0.001151417,0.001096267,0.002374131,0.0006107414],"domain_scores_gemma":[0.9941372,0.003737656,0.0005665079,0.0006333616,0.0007569777,0.0001683074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001884407,0.0001822623,0.0002462589,0.00001176394,0.00008259191,0.000001812846,0.00132554,0.8941264,0.0002931296,0.09181426,0.001910696,0.009816894],"study_design_scores_gemma":[0.0002660241,0.0006198317,0.0002523607,0.00001747883,0.00006371675,0.0001405602,0.01358019,0.8717871,0.0005151385,0.1054245,0.006894098,0.0004389698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007567837,0.0001964406,0.9755639,0.008605346,0.002078784,0.001822814,0.0003430894,0.000217047,0.003604728],"genre_scores_gemma":[0.8462817,0.00001531777,0.1491365,0.0007239825,0.0002932746,0.001306471,0.0001040627,0.00004425941,0.00209447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8387139,"threshold_uncertainty_score":0.9999679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08505266767852177,"score_gpt":0.3530456267598732,"score_spread":0.2679929590813514,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}