{"id":"W2121556262","doi":"10.1016/j.tcs.2014.03.034","title":"The cyclical scheduling problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scheduling (production processes); Vertex (graph theory); Combinatorics; Job shop scheduling; Mathematics; Computer science; Matching (statistics); Algorithm; Mathematical optimization; Graph; Schedule","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.001709185,0.000870703,0.001078839,0.0009146908,0.002157939,0.003693214,0.002459039,0.002403839,0.01681674],"category_scores_gemma":[0.01129727,0.0007535664,0.001008629,0.002664093,0.001997155,0.004964808,0.001996346,0.003125448,0.00154915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00241963,"about_ca_system_score_gemma":0.004099713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004603345,"about_ca_topic_score_gemma":0.004489382,"domain_scores_codex":[0.998004,0.0006713671,0.00008325459,0.0005386156,0.0003395697,0.000363149],"domain_scores_gemma":[0.99178,0.00505663,0.0006822708,0.00105039,0.0006049974,0.0008257513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004713455,0.0002900172,0.0006594366,0.0004640721,0.00007447605,0.000220283,0.000274989,0.05550886,0.002151364,0.8412341,0.04209874,0.05655229],"study_design_scores_gemma":[0.0001157239,0.00005856569,0.0002182607,0.00004070612,0.00003097703,0.0001539427,0.0001629452,0.08963872,0.0009704389,0.8898857,0.01869997,0.00002403109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1975036,0.003051892,0.5792534,0.01683983,0.001390583,0.000705957,0.004105154,0.001020668,0.1961289],"genre_scores_gemma":[0.7439343,0.002612957,0.1863717,0.001918963,0.001717086,0.0005604047,0.004655395,0.0005522218,0.05767693],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01681674,"threshold_uncertainty_score":0.05625761,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0113602510684824,"score_gpt":0.2838421154584433,"score_spread":0.2724818643899609,"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."}}