{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.005958388,0.0001859169,0.0001715704,0.0001416013,0.001767515,0.001108047,0.006470928,0.00004750427,0.000008822162],"category_scores_gemma":[0.0004964668,0.0001143718,0.00007886186,0.001771104,0.006914414,0.0007228703,0.002446433,0.000431805,0.0002093941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005178154,"about_ca_system_score_gemma":0.0001082587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.261277e-7,"about_ca_topic_score_gemma":4.319104e-7,"domain_scores_codex":[0.9962356,0.0003496655,0.0002975659,0.0008440276,0.001187955,0.001085195],"domain_scores_gemma":[0.996101,0.001587451,0.0000621783,0.001570973,0.00026215,0.0004162019],"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.000005541753,0.00001805076,0.00002224222,0.000002032658,0.000001745515,0.000001796703,0.00007886307,0.0003367824,0.0004268417,0.8592654,0.00001161988,0.1398291],"study_design_scores_gemma":[0.00009017174,0.0001005053,0.0001223965,0.000008411817,6.949508e-7,0.00001833585,0.000001974546,0.4522551,0.001421258,0.5449644,0.0009077712,0.0001090161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007087385,0.00002756891,0.9784088,0.004150645,0.0003692732,0.0001901608,1.730156e-7,0.0002908019,0.009475201],"genre_scores_gemma":[0.6818891,0.000004282417,0.3175621,0.0003837711,0.0001252099,0.00001205573,8.875996e-8,0.000007210873,0.00001616546],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6748018,"threshold_uncertainty_score":0.9999289,"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."}}