{"id":"W4246558774","doi":"10.32920/ryerson.14655156.v1","title":"An application of a genetic algorithm to retail staff scheduling","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Genetic algorithm; Mathematical optimization; Integer programming; Computer science; Branch and bound; Population; Job shop scheduling; Linear programming; Upper and lower bounds; Operations research; Algorithm; Mathematics; Medicine; Computer network","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":[],"consensus_categories":[],"category_scores_codex":[0.002831756,0.0002551217,0.0006282452,0.0005826594,0.0001378609,0.0005191907,0.001556214,0.0003233097,0.0004943319],"category_scores_gemma":[0.001872404,0.0002212116,0.0002683289,0.001335636,0.00007233625,0.0001195773,0.0007484399,0.0004328602,0.000247685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000053505,"about_ca_system_score_gemma":0.0005406231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006087017,"about_ca_topic_score_gemma":0.0001074509,"domain_scores_codex":[0.995249,0.0002734025,0.001211322,0.001317645,0.001612475,0.0003361608],"domain_scores_gemma":[0.9945184,0.0004118641,0.0004658387,0.00265396,0.001627012,0.000322951],"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.000007283493,0.0003092884,0.001173387,0.00001655981,0.00006090822,0.000003546091,0.0008405225,0.3586708,0.002044989,0.0005487911,0.0001199969,0.6362039],"study_design_scores_gemma":[0.0001645339,0.00009507961,0.004621918,0.00007070812,0.00007969842,0.000006717504,0.002547021,0.9750825,0.003043364,0.01218955,0.001666981,0.0004319892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2249065,0.0004094972,0.7726607,0.0003924422,0.0004180352,0.0003139532,0.00003641661,0.00009280632,0.0007696734],"genre_scores_gemma":[0.4536564,0.00001270961,0.5455822,0.00006471852,0.0001332661,0.00005399495,0.00003176357,0.00001630733,0.000448594],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6357719,"threshold_uncertainty_score":0.9020749,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1020428525715273,"score_gpt":0.3959969991864616,"score_spread":0.2939541466149343,"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."}}