{"id":"W2114085960","doi":"10.1007/s10732-009-9106-6","title":"A large neighbourhood search approach to the  multi-activity shift scheduling problem","year":2009,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Neighbourhood (mathematics); Paradigm shift; Mathematical optimization; Theoretical computer science; Mathematics","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.009224104,0.0001617027,0.0003978827,0.0003687172,0.0005179791,0.0004993115,0.001158656,0.0000895255,0.00003623994],"category_scores_gemma":[0.006663387,0.00009269667,0.0002524237,0.00120709,0.00004827049,0.0002327134,0.000106079,0.0008436884,0.0001420788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005731526,"about_ca_system_score_gemma":0.0003039978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000106121,"about_ca_topic_score_gemma":0.000006871497,"domain_scores_codex":[0.9962847,0.0003782233,0.0008172658,0.0002734967,0.001742795,0.0005035283],"domain_scores_gemma":[0.9969521,0.0008886278,0.0004449131,0.0005296412,0.0008574288,0.0003273056],"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.001094702,0.01426294,0.03623502,0.00005316457,0.0005749553,0.0002629339,0.0289956,0.6570678,0.002525727,0.08967175,0.02818794,0.1410674],"study_design_scores_gemma":[0.004576656,0.00171311,0.3246551,0.0002120167,0.0003286425,0.0007639577,0.004798695,0.5611724,0.0009564004,0.04978739,0.04997749,0.0010581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1794046,0.0002975277,0.810928,0.007153873,0.0003860812,0.0001648957,0.00001729905,0.00001952901,0.001628159],"genre_scores_gemma":[0.8263791,0.00001080062,0.1725388,0.0003983489,0.000431015,0.000001069408,3.919808e-7,0.000009277434,0.0002312298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6469744,"threshold_uncertainty_score":0.7977178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1476587390143901,"score_gpt":0.4031855617987858,"score_spread":0.2555268227843956,"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."}}