{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008342076,0.0003084968,0.000658904,0.0004481731,0.0009682173,0.001053093,0.001078248,0.000187955,0.00008138086],"category_scores_gemma":[0.006412672,0.000186733,0.0004959452,0.000870564,0.0002251232,0.001344947,0.0001849476,0.0008890614,0.0001090175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007114117,"about_ca_system_score_gemma":0.0002915307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001402235,"about_ca_topic_score_gemma":0.00001469272,"domain_scores_codex":[0.9960868,0.0002430148,0.001336478,0.0004883212,0.001194504,0.0006509316],"domain_scores_gemma":[0.991362,0.004849638,0.001375971,0.000520061,0.001516219,0.000376143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001299466,0.001016765,0.01297863,0.0000578084,0.0007716415,0.00001493885,0.004086556,0.06934778,0.02318876,0.0007900653,0.000362455,0.8872547],"study_design_scores_gemma":[0.002753791,0.0001579859,0.02956886,0.000157055,0.0001657193,0.0001447516,0.001299768,0.9562534,0.001068847,0.006372206,0.001688396,0.0003692135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2786265,0.002336203,0.7143093,0.003538039,0.0006949996,0.0004341082,0.00000878358,0.00003124144,0.00002077215],"genre_scores_gemma":[0.5221273,0.00006444089,0.4770703,0.0001544996,0.000371939,0.00002644646,3.115182e-7,0.00002172568,0.0001630609],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8869056,"threshold_uncertainty_score":0.9999839,"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."}}