{"id":"W4255765049","doi":"10.32920/ryerson.14655156","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); Integer programming; Genetic algorithm; Mathematical optimization; Computer science; Branch and bound; Population; Linear programming; Upper and lower bounds; Job shop scheduling; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630981,0.0004782293,0.0005367156,0.0007648381,0.0004143511,0.0005476124,0.0007274713,0.001054292,0.001224393],"category_scores_gemma":[0.002652382,0.0002469283,0.0004117246,0.001023385,0.0005191378,0.0003780343,0.000377147,0.0005448465,0.000179696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006680341,"about_ca_system_score_gemma":0.001103256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008071702,"about_ca_topic_score_gemma":0.005397815,"domain_scores_codex":[0.9995702,0.0001983924,0.00001364281,0.00006015908,0.0001187742,0.00003891641],"domain_scores_gemma":[0.9993584,0.0004348514,0.00003388698,0.00003381289,0.0001220688,0.00001704367],"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.00004698773,0.00006680487,0.0008203426,0.0000355877,0.00003251348,0.00009652406,0.0000542012,0.9211842,0.002524273,0.005978562,0.0006932703,0.0684668],"study_design_scores_gemma":[0.00001528397,0.00003978499,0.0001437416,0.000005088162,0.000008529321,0.00002451552,0.00001164355,0.9967496,0.0006089307,0.001691277,0.0006979518,0.000003563398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0939339,0.000459438,0.8959693,0.0003818462,0.000104424,0.0001310973,0.0000472758,0.0006231055,0.008349555],"genre_scores_gemma":[0.4642589,0.0004205876,0.5321046,0.0001344611,0.00003478535,0.0001278644,0.00008000452,0.00005936542,0.00277937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008071702,"threshold_uncertainty_score":0.01604944,"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."}}