{"id":"W2914964871","doi":"10.1007/s13675-019-00119-3","title":"A decomposition-based heuristic for large employee scheduling problems with inter-department transfers","year":2019,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Computer science; Job shop scheduling; Heuristic; Schedule; Time horizon; Mathematical optimization; Operations research; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001842179,0.002167419,0.002129475,0.001197651,0.0008201969,0.001265952,0.001890873,0.001910628,0.004183034],"category_scores_gemma":[0.003371292,0.0009375231,0.001718702,0.001505922,0.0007501685,0.001281556,0.001469326,0.002079261,0.0005785978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750179,"about_ca_system_score_gemma":0.002920317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008825459,"about_ca_topic_score_gemma":0.008344289,"domain_scores_codex":[0.998896,0.0004977888,0.00004831285,0.0001609083,0.0001318105,0.0002651036],"domain_scores_gemma":[0.9973724,0.001858258,0.000195225,0.0001171224,0.0001922916,0.0002646936],"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.0001195398,0.0002043766,0.000370609,0.0001276053,0.0000503438,0.00009324527,0.00005788372,0.9732978,0.001064317,0.002993251,0.001376544,0.0202445],"study_design_scores_gemma":[0.00005280265,0.00005408793,0.00009190933,0.00001299397,0.00001684135,0.00001554291,0.00003801996,0.996439,0.0002167865,0.002608089,0.000447609,0.00000640283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.102641,0.001406312,0.8823543,0.0006669057,0.0001560048,0.000556189,0.0004935566,0.0009681472,0.01075751],"genre_scores_gemma":[0.448301,0.0006260036,0.5460439,0.0003310317,0.00007714844,0.0007258746,0.001203506,0.0002725048,0.002418859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008825459,"threshold_uncertainty_score":0.01754814,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05109040726476697,"score_gpt":0.3510804581731453,"score_spread":0.2999900509083783,"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."}}