{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01329675,0.0004742318,0.0005811991,0.001884395,0.001288223,0.00227592,0.004811795,0.0001492865,0.0001546713],"category_scores_gemma":[0.001157754,0.000405187,0.00043424,0.002396752,0.001082059,0.0006930762,0.001788861,0.0005767943,0.001016078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002895415,"about_ca_system_score_gemma":0.00009378228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006867855,"about_ca_topic_score_gemma":0.000005834564,"domain_scores_codex":[0.9918823,0.00009188586,0.00101632,0.002039408,0.003396963,0.001573107],"domain_scores_gemma":[0.9957012,0.0005288525,0.0006617565,0.002438873,0.0002503426,0.0004189884],"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.0004349327,0.001246884,0.0275624,0.0007904191,0.0007017386,0.00009306111,0.005544744,0.5888449,0.004393669,0.1966569,0.1090876,0.06464276],"study_design_scores_gemma":[0.01035318,0.0002218752,0.07485523,0.001765885,0.002886529,0.0000503906,0.009814763,0.49955,0.002616168,0.2047855,0.1847765,0.008324021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.262206,0.0003685601,0.6819375,0.02546674,0.01371552,0.002706644,0.00005208631,0.0004383866,0.01310848],"genre_scores_gemma":[0.8729603,0.000008605538,0.1200767,0.003121967,0.0006999557,0.0003943905,0.00001957432,0.00003987581,0.002678692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6107542,"threshold_uncertainty_score":0.99984,"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."}}