{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827638,0.000111468,0.0001128737,0.0001420082,0.000611804,0.0003138373,0.00009668805,0.00007630698,0.0001817079],"category_scores_gemma":[0.000206318,0.00011413,0.00001982401,0.0006204633,0.00008950262,0.0001877825,0.00002457435,0.0003559746,0.00004360381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005864749,"about_ca_system_score_gemma":0.00007494052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001836135,"about_ca_topic_score_gemma":0.0001525749,"domain_scores_codex":[0.9987999,0.0001851247,0.0002121425,0.0002053338,0.0002345089,0.000363045],"domain_scores_gemma":[0.9992948,0.0001452485,0.000005256073,0.0001832937,0.0002291869,0.0001422461],"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.000001894654,0.00003040644,0.00008681018,0.00001680275,0.00001732898,0.000002139626,0.0001895102,0.9913009,0.002067619,0.004308655,0.00009296418,0.001884909],"study_design_scores_gemma":[0.0002675987,0.00004007123,0.00002114733,0.0000570819,0.000004579506,0.00003199002,0.00013338,0.9973022,0.001206713,0.0001970603,0.0006021481,0.0001360468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1160453,0.006494645,0.8438079,0.0008368933,0.0003840629,0.00119669,0.00003601334,0.0006685152,0.03052994],"genre_scores_gemma":[0.4941399,0.0001717779,0.5052988,0.0000153212,0.00005844628,0.00007000147,0.00002744532,0.00002079943,0.000197477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3780946,"threshold_uncertainty_score":0.4705564,"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."}}