{"id":"W2025689931","doi":"10.1007/s10951-013-0338-9","title":"A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Task (project management); Job shop scheduling; Set (abstract data type); Mathematics; Economics","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.001575002,0.001137916,0.002450224,0.001516341,0.001159994,0.001679559,0.002104881,0.002557659,0.01058606],"category_scores_gemma":[0.003212596,0.0009736482,0.0009780085,0.002131559,0.000662062,0.001973977,0.001416075,0.002105957,0.001085308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001408789,"about_ca_system_score_gemma":0.003435202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01107365,"about_ca_topic_score_gemma":0.009686693,"domain_scores_codex":[0.9993851,0.0001775764,0.00002779994,0.00008908648,0.0001865527,0.0001338994],"domain_scores_gemma":[0.9985618,0.001011565,0.00006906657,0.00005016105,0.000181847,0.0001256063],"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.000424107,0.0003977568,0.0005255836,0.0001989075,0.00006954021,0.0000867468,0.00008870448,0.7443095,0.002315286,0.01412451,0.007786757,0.2296727],"study_design_scores_gemma":[0.00009406194,0.00006398637,0.00007935167,0.000007854377,0.00001317063,0.00001352928,0.00001363841,0.9941169,0.0001992771,0.004738608,0.0006531519,0.000006422158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02656123,0.0005586134,0.9634442,0.0006208772,0.0001835098,0.0003127924,0.0001966648,0.0008954515,0.007226578],"genre_scores_gemma":[0.2220838,0.0005099044,0.7702034,0.0002020117,0.0001441994,0.0005067028,0.0004956086,0.0002785926,0.005575775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107365,"threshold_uncertainty_score":0.03541386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1176176703911333,"score_gpt":0.3762298569327138,"score_spread":0.2586121865415806,"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."}}