{"id":"W2127277545","doi":"10.1287/opre.51.6.981.24912","title":"Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematical optimization; Parametric statistics; Linear programming relaxation; Scheduling (production processes); Linear programming; Decomposition; Computer science; Mathematics; Relaxation (psychology); Permutation (music); Schedule; Job shop scheduling; Algorithm","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.0008199411,0.0008917978,0.0003805009,0.0008711133,0.0005480664,0.0009487885,0.0005233472,0.0006289165,0.004053968],"category_scores_gemma":[0.003066018,0.0004130757,0.0004614444,0.002186917,0.000874067,0.001771154,0.0007017265,0.000980414,0.0002784485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000965703,"about_ca_system_score_gemma":0.001153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003542123,"about_ca_topic_score_gemma":0.004075176,"domain_scores_codex":[0.9996239,0.0001680437,0.00001438504,0.00005433119,0.00008418703,0.00005514627],"domain_scores_gemma":[0.9989623,0.000662905,0.0001488879,0.00008523268,0.00005873373,0.00008202776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001132441,0.00009537533,0.0007952218,0.0001401952,0.00002455988,0.000166715,0.0001024573,0.7012072,0.001524159,0.2445963,0.004114704,0.04711981],"study_design_scores_gemma":[0.0000219227,0.0000340291,0.0005475999,0.00003060877,0.00001366695,0.0001562567,0.00009022581,0.72897,0.0007638242,0.2629305,0.006430432,0.00001095405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.108478,0.001444941,0.8621807,0.001048029,0.0001008142,0.0001255132,0.0005192533,0.0002000196,0.02590272],"genre_scores_gemma":[0.5561854,0.001856416,0.4334354,0.0001814806,0.000108601,0.0002074604,0.0009400461,0.0001131579,0.006972129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004053968,"threshold_uncertainty_score":0.0135619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03660956468196876,"score_gpt":0.3075154858989144,"score_spread":0.2709059212169457,"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."}}