{"id":"W3116777151","doi":"10.4230/lipics.isaac.2020.10","title":"Approximation Algorithms for Generalized Path Scheduling","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Queue; Path (computing); Algorithm; Computer science; Flow shop scheduling; Longest path problem; Mathematics; Mathematical optimization; Theoretical computer science; Shortest path problem; Graph","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.001807718,0.002123176,0.001796499,0.001471138,0.0009853528,0.002195462,0.002773858,0.002047162,0.01299784],"category_scores_gemma":[0.007994058,0.0007327187,0.00138608,0.002817934,0.001061197,0.003615582,0.001840368,0.002935973,0.001802154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003294477,"about_ca_system_score_gemma":0.002844405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008295065,"about_ca_topic_score_gemma":0.007903429,"domain_scores_codex":[0.9985936,0.0005403475,0.00005123614,0.000272659,0.0002993112,0.0002429267],"domain_scores_gemma":[0.9972844,0.001801862,0.000212102,0.0003426549,0.0002262964,0.0001327825],"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.0002257123,0.0001121274,0.0004800267,0.0002478208,0.00009276555,0.00006834704,0.00008374238,0.8311076,0.0004104952,0.07494585,0.01554385,0.07668158],"study_design_scores_gemma":[0.0000478837,0.00003532161,0.00007126469,0.00002199547,0.00001223172,0.00002725918,0.00002552882,0.9283465,0.00008291453,0.06851688,0.002806546,0.000005797452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01590743,0.002700507,0.9633543,0.001043621,0.00034008,0.0001892978,0.0006778007,0.001514511,0.0142725],"genre_scores_gemma":[0.3362504,0.003155924,0.6415479,0.0007130603,0.0004068678,0.0007424167,0.003463651,0.0007436355,0.01297622],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01299784,"threshold_uncertainty_score":0.04348207,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05034793449047627,"score_gpt":0.2875827974597208,"score_spread":0.2372348629692445,"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."}}