{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273241,0.0006171674,0.001356246,0.0005873781,0.0005182298,0.0005652415,0.001564371,0.0008800647,0.00218875],"category_scores_gemma":[0.002447165,0.0003721465,0.0007187784,0.0007484144,0.0004883622,0.0007794448,0.0007186123,0.000672209,0.0002746387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007401307,"about_ca_system_score_gemma":0.001288408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007131004,"about_ca_topic_score_gemma":0.005995465,"domain_scores_codex":[0.9993618,0.000297547,0.00002809254,0.0001130058,0.0001034802,0.00009597604],"domain_scores_gemma":[0.9990923,0.0005762272,0.00009349608,0.00004415882,0.0001304897,0.00006326985],"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.00007659793,0.00006214879,0.000684879,0.00007589147,0.0000391449,0.00008726703,0.00006657617,0.9676824,0.0007416084,0.002485154,0.00134023,0.02665829],"study_design_scores_gemma":[0.00003056225,0.00005219839,0.0001178442,0.000005166162,0.00001046106,0.00002211944,0.00002934247,0.9970912,0.0002814537,0.001989886,0.0003654228,0.000004311808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1276976,0.0006371511,0.8648583,0.000521244,0.00005066074,0.0001807511,0.0001753518,0.0008041995,0.005074712],"genre_scores_gemma":[0.6600243,0.0003166893,0.3349857,0.0001988248,0.00004087243,0.0004058957,0.0004342025,0.0001188641,0.003474776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007131004,"threshold_uncertainty_score":0.01417899,"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."}}