{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006021354,0.000312748,0.0003845122,0.000154582,0.0003999243,0.0007285236,0.00111937,0.0001713566,0.00002053391],"category_scores_gemma":[0.0002126897,0.0002884088,0.0002470612,0.0004475739,0.00005323317,0.00214431,0.0003317208,0.0002523871,0.00008228764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007093733,"about_ca_system_score_gemma":0.0001159301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003307169,"about_ca_topic_score_gemma":8.689892e-7,"domain_scores_codex":[0.9974688,0.00004096581,0.0009780132,0.0003456698,0.0004867311,0.0006797966],"domain_scores_gemma":[0.9982133,0.0001078635,0.0003692948,0.000485295,0.0004733593,0.0003508738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005960272,0.001176207,0.00113999,0.006638301,0.0007569637,0.000009717929,0.09717932,0.1034178,0.001445123,0.5410204,0.03376184,0.2128584],"study_design_scores_gemma":[0.003301074,0.0002492525,0.00001289687,0.00004204843,0.00001478934,0.000006375551,0.0003039594,0.9584905,0.000861667,0.001311482,0.03505055,0.0003554183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002613963,0.00003199564,0.990592,0.002859432,0.0004438586,0.001996072,0.0002011829,0.0003996471,0.0008618571],"genre_scores_gemma":[0.03636021,0.00004196271,0.9569653,0.005092991,0.0002565949,0.0004008884,0.00070191,0.00004468689,0.0001354652],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8550727,"threshold_uncertainty_score":0.9999568,"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."}}