{"id":"W2950744132","doi":"10.1016/j.tcs.2018.02.020","title":"Scheduling maintenance jobs in networks","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Einstein Stiftung Berlin; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Preemption; Scheduling (production processes); Computer science; Time complexity; Mathematical optimization; Job shop scheduling; Simple (philosophy); Distributed computing; Mathematics; Algorithm; Computer network","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.001088172,0.0007577658,0.0009441157,0.0006334761,0.0007942948,0.001539151,0.001331918,0.001415077,0.005449034],"category_scores_gemma":[0.005752567,0.0005869799,0.0004221999,0.0009256635,0.0007108312,0.001847449,0.0007593561,0.00102806,0.0004978125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001038334,"about_ca_system_score_gemma":0.00104411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00279904,"about_ca_topic_score_gemma":0.002493368,"domain_scores_codex":[0.999516,0.0001484858,0.00002125917,0.000118968,0.00007244243,0.0001228545],"domain_scores_gemma":[0.9981964,0.001206671,0.0001503798,0.0001650141,0.0001387018,0.0001427358],"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.001501499,0.0002199345,0.001580413,0.0005075132,0.00007675256,0.000168991,0.0001957201,0.8278246,0.006330574,0.04465768,0.0114485,0.1054877],"study_design_scores_gemma":[0.00004052571,0.00007936825,0.000335451,0.00001386965,0.00002462828,0.00003850984,0.00005371492,0.9584247,0.001460291,0.03784348,0.001678556,0.000006956059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3904621,0.002244542,0.5842959,0.002888719,0.0005637896,0.0002699078,0.0004148455,0.000884214,0.01797594],"genre_scores_gemma":[0.9437792,0.0005321001,0.04632298,0.0001200034,0.0002040206,0.00006903729,0.0002273654,0.0001658437,0.008579433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005449034,"threshold_uncertainty_score":0.01822883,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01711956884023272,"score_gpt":0.2766118358970304,"score_spread":0.2594922670567976,"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."}}