{"id":"W772046056","doi":"10.1007/978-3-662-48350-3_41","title":"Approximate Deadline-Scheduling with Precedence Constraints","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Schedule; Computer science; Mathematical optimization; Job shop scheduling; Annals; Set (abstract data type); Mathematics; Programming language; Operating system","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.0004382569,0.0004057182,0.0003594387,0.0003430844,0.00008611258,0.0001906554,0.0006502207,0.0002445069,0.0000468144],"category_scores_gemma":[0.00005684039,0.0003525419,0.00003992294,0.0003047492,0.0006540995,0.0001858661,0.0001139159,0.0006573073,0.00002995575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001907749,"about_ca_system_score_gemma":0.000274002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002170803,"about_ca_topic_score_gemma":0.00001336938,"domain_scores_codex":[0.9980552,0.000007836789,0.0003049883,0.0006060512,0.0005940378,0.0004319264],"domain_scores_gemma":[0.9989049,0.0001165784,0.00008336316,0.0004610683,0.0002497204,0.0001843072],"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.000003097955,0.000003776637,0.00001305436,0.00003411464,0.000008731961,0.00002181331,0.0002063096,0.8777474,0.00001313134,0.0003299785,0.000002624319,0.121616],"study_design_scores_gemma":[0.0002440447,0.00005062031,0.000003572199,0.0004487856,0.00001029556,0.00008381044,5.704659e-7,0.9936797,0.0005441264,0.004370095,0.00008933437,0.0004750724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001168621,0.0005214867,0.9915199,0.00004838628,0.0008553483,0.000223186,0.000008195511,0.0003651716,0.006341525],"genre_scores_gemma":[0.06460555,0.00003430487,0.9347007,0.000115285,0.0003313758,0.000006961523,0.00001211543,0.000067238,0.0001265111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1211409,"threshold_uncertainty_score":0.9998927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02039480596164228,"score_gpt":0.2345974281482993,"score_spread":0.214202622186657,"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."}}