{"id":"W2584897526","doi":"10.1007/978-3-319-57586-5_3","title":"Scheduling Maintenance Jobs in Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in 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":"","keywords":"Preemption; Computer science; Scheduling (production processes); Time complexity; Job shop scheduling; Mathematical optimization; Simple (philosophy); Approximation algorithm; Distributed computing; Algorithm; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001512036,0.0004411249,0.0005060878,0.0008164571,0.0003560396,0.001191247,0.005169353,0.000355281,0.00002189403],"category_scores_gemma":[0.0002049653,0.0004084343,0.000103063,0.0003733006,0.0007057308,0.0009637206,0.001807366,0.001307986,0.00004187793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002961215,"about_ca_system_score_gemma":0.0005738457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003737323,"about_ca_topic_score_gemma":0.0002670434,"domain_scores_codex":[0.9962184,0.0000423668,0.0005246758,0.001493114,0.0007981424,0.0009232633],"domain_scores_gemma":[0.9971011,0.0002717558,0.000325241,0.001846713,0.0002528648,0.0002023533],"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.000002500503,0.00001309282,0.0001394322,0.00001412118,0.000002866966,0.0001008019,0.000242712,0.6665444,0.000005084647,0.02782731,0.00001391265,0.3050937],"study_design_scores_gemma":[0.0002774901,0.00005400389,0.0002118132,0.0006015455,0.000001169146,0.0000257883,5.927274e-8,0.9205016,0.00002208356,0.07669281,0.00117011,0.0004414702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000008630008,0.0004124135,0.9884248,0.001410186,0.001573895,0.0003850888,0.000001131328,0.0001147092,0.007669084],"genre_scores_gemma":[0.1252139,0.0004269397,0.869682,0.002375941,0.0005467157,0.00001813354,0.000005264308,0.0000527173,0.001678485],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3046523,"threshold_uncertainty_score":0.9998456,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02342604167475172,"score_gpt":0.2648984266182322,"score_spread":0.2414723849434804,"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."}}