{"id":"W2397478800","doi":"10.4230/dagsemproc.09261.9","title":"Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Integer programming; Solver; Rule-based machine translation; Scheduling (production processes); Grammar; ENCODE; Theoretical computer science; Integer (computer science); Mathematical optimization; Algorithm; Programming language; Artificial intelligence; 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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004617331,0.000597994,0.0008811416,0.0007885497,0.001100258,0.001468076,0.001460486,0.0004092014,0.00002778267],"category_scores_gemma":[0.003074982,0.0004889956,0.0008795797,0.001032179,0.0002109178,0.002416217,0.0001475845,0.0006496478,0.0001369336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001771836,"about_ca_system_score_gemma":0.0002914026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003226441,"about_ca_topic_score_gemma":0.00003983734,"domain_scores_codex":[0.9945021,0.00009852086,0.001943658,0.0006649941,0.00135317,0.001437502],"domain_scores_gemma":[0.9950434,0.001220051,0.0009337853,0.001244489,0.001111003,0.0004472946],"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.002878674,0.007747754,0.01222299,0.000790854,0.0007975397,0.00001327192,0.02248468,0.2936362,0.0005890147,0.07439606,0.004159884,0.5802831],"study_design_scores_gemma":[0.003922135,0.0003855544,0.0008884577,0.0001305745,0.00007733374,0.000008195722,0.0008931029,0.967423,0.0007816246,0.01441198,0.01044384,0.0006341764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.159078,0.00005917419,0.835831,0.001034524,0.0008589646,0.001840998,0.0004353342,0.0003461086,0.0005158513],"genre_scores_gemma":[0.7184852,0.000002921516,0.2799593,0.0007694851,0.0001525603,0.0002059671,0.0001734193,0.00003971543,0.000211427],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6737868,"threshold_uncertainty_score":0.9997562,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.201953135779614,"score_gpt":0.4130827993715797,"score_spread":0.2111296635919657,"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."}}