{"id":"W27038116","doi":"10.1093/jnci/djw115","title":"Polyhedral Approaches to Machine Scheduling","year":2008,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polyhedron; Scheduling (production processes); Mathematical optimization; Polyhedral combinatorics; Mathematical proof; Travelling salesman problem; Computer science; Cutting-plane method; Mathematics; Algorithm; Combinatorics; Integer programming; Regular polygon; Convex optimization","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.001264081,0.002266288,0.001607075,0.00196111,0.0009599092,0.002511245,0.002685347,0.001558779,0.01357931],"category_scores_gemma":[0.003243733,0.001225137,0.001813725,0.005748951,0.001899385,0.002928949,0.001709297,0.004671843,0.004934224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002370678,"about_ca_system_score_gemma":0.001781668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003032977,"about_ca_topic_score_gemma":0.004019342,"domain_scores_codex":[0.9982544,0.0006068785,0.0001434859,0.0002985354,0.0005517314,0.0001449598],"domain_scores_gemma":[0.9988627,0.0006697268,0.00009187571,0.0001481813,0.0001759866,0.00005147346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002288033,0.00005815486,0.00009552639,0.0007697551,0.00004992598,0.00005418174,0.00009353161,0.1433129,0.0007395546,0.7525749,0.01225145,0.08997729],"study_design_scores_gemma":[0.00002523184,0.00003701689,0.0001063276,0.0002290351,0.00002517596,0.0001131406,0.00006373409,0.1261029,0.0005029052,0.7328395,0.1399316,0.00002336143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000600212,0.01507471,0.9569002,0.0008055071,0.0005224195,0.00009749806,0.0002280002,0.0001325461,0.02563886],"genre_scores_gemma":[0.05951409,0.07013898,0.8460385,0.0009880395,0.002068148,0.0007434587,0.0009852229,0.0002654569,0.01925816],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01357931,"threshold_uncertainty_score":0.04542732,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07337646448938698,"score_gpt":0.2119761857776887,"score_spread":0.1385997212883018,"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."}}