{"id":"W2054747554","doi":"10.1145/2542050.2542093","title":"Iterated local search in nurse rostering problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Swap (finance); Tabu search; Nurse scheduling problem; Computer science; Iterated function; Iterated local search; Mathematical optimization; Hill climbing; Local search (optimization); Shuffling; Greedy algorithm; Descent (aeronautics); Artificial intelligence; Algorithm; Job shop scheduling; Mathematics; Schedule; Flow shop scheduling","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001579994,0.00007955196,0.0001450796,0.0003369967,0.00008659079,0.0004429174,0.0003608531,0.00005610713,0.003042671],"category_scores_gemma":[0.0003645364,0.00005413266,0.00004233697,0.001208166,0.00007533321,0.0003934043,0.00006411163,0.0001612268,0.007171785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003021796,"about_ca_system_score_gemma":0.00006062718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001035698,"about_ca_topic_score_gemma":0.0001366138,"domain_scores_codex":[0.9982433,0.0001207303,0.0003965621,0.0003166125,0.0005813115,0.0003414495],"domain_scores_gemma":[0.9988835,0.0003778703,0.00003055488,0.0003282825,0.0002646695,0.0001151357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005430703,0.0007084984,0.1932428,0.00001458814,0.00003978697,0.00004355811,0.006371472,0.1279449,0.0135839,0.0211094,0.02793424,0.6089525],"study_design_scores_gemma":[0.00106788,0.0001005937,0.1143113,0.00006297566,0.000004701266,0.00002747363,0.00558763,0.841466,0.003327027,0.02895913,0.00467878,0.000406482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9068115,0.00004332753,0.05659807,0.002669694,0.0001579672,0.0002320353,0.000001374831,0.00009630936,0.0333897],"genre_scores_gemma":[0.979269,7.069501e-7,0.009464488,0.0001494938,0.00002871893,0.00002026621,0.000001378711,0.00000626253,0.0110597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7135211,"threshold_uncertainty_score":0.9978687,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1148978744502649,"score_gpt":0.3949580150947329,"score_spread":0.280060140644468,"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."}}