{"id":"W2144444935","doi":"10.5267/j.msl.2012.06.021","title":"A greedy double swap heuristic for nurse scheduling","year":2012,"lang":"en","type":"preprint","venue":"Management Science Letters","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Nurse scheduling problem; Swap (finance); Computer science; Greedy algorithm; Scheduling (production processes); Heuristic; Mathematical optimization; Schedule; Operations research; Job shop scheduling; Nursing; Medicine; Artificial intelligence; Mathematics; Economics; Algorithm; Flow shop scheduling","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079577,0.0008846127,0.001080211,0.0009727659,0.0006450355,0.0007496318,0.001241942,0.001156861,0.004762906],"category_scores_gemma":[0.001913849,0.0005666153,0.0008225109,0.001235088,0.0006565683,0.0007324705,0.0008303812,0.0007460538,0.0005695595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001218252,"about_ca_system_score_gemma":0.002168325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00406148,"about_ca_topic_score_gemma":0.004506213,"domain_scores_codex":[0.9992224,0.0003681337,0.00002655008,0.00007693152,0.0001551543,0.000150701],"domain_scores_gemma":[0.9993612,0.0003972233,0.00005763397,0.00004767573,0.00006481358,0.00007138093],"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.0002206482,0.0001321052,0.0004657009,0.0001135597,0.00003740019,0.0001119871,0.00006971587,0.9116761,0.001706077,0.01334654,0.00352233,0.06859779],"study_design_scores_gemma":[0.00003997243,0.00008054165,0.0001245122,0.000008782385,0.00001042296,0.00003885909,0.0000252538,0.9915717,0.0005685163,0.006103281,0.001418069,0.00001009885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04593575,0.0004447889,0.9447697,0.0002552601,0.000106954,0.0002549929,0.0001375801,0.0004781049,0.007616797],"genre_scores_gemma":[0.4064319,0.0003337965,0.5876776,0.000206117,0.00005488937,0.0004510667,0.0002900373,0.000147565,0.004406991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004762906,"threshold_uncertainty_score":0.01593357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1482721822949325,"score_gpt":0.4050844058086853,"score_spread":0.2568122235137528,"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."}}