{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001148027,0.000455365,0.00131745,0.001137689,0.000642364,0.0008025048,0.001416492,0.001440972,0.003817635],"category_scores_gemma":[0.004445146,0.0004541537,0.0007312026,0.001299629,0.0007561853,0.001427377,0.001097861,0.001032172,0.0003477359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000979166,"about_ca_system_score_gemma":0.001120147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006749691,"about_ca_topic_score_gemma":0.007330165,"domain_scores_codex":[0.9994476,0.0003291548,0.00001907603,0.00005422875,0.0001100994,0.00003976248],"domain_scores_gemma":[0.9982606,0.00140983,0.00006821803,0.00005652076,0.0001352676,0.0000696259],"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.00007686853,0.00006438048,0.0001850205,0.00007251515,0.00003373133,0.00004844599,0.00006177891,0.940849,0.0005313898,0.02736026,0.001090491,0.0296261],"study_design_scores_gemma":[0.00002630804,0.00002328084,0.0000483764,0.000005191017,0.000006362528,0.000008922785,0.00001054286,0.9885535,0.00006084181,0.01074071,0.0005114922,0.000004472607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02637012,0.0006528378,0.9649851,0.0004595509,0.00009810641,0.00008576077,0.00006584599,0.0001412441,0.007141441],"genre_scores_gemma":[0.5367602,0.0007691348,0.450841,0.0001673564,0.0001685712,0.000368725,0.0002300286,0.0001183556,0.01057664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006749691,"threshold_uncertainty_score":0.01342082,"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."}}