{"id":"W2009174425","doi":"10.1016/j.compchemeng.2004.03.009","title":"Flowsheet decomposition heuristic for scheduling: a relax-and-fix method","year":2004,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Process Optimization and Integration","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"Honeywell (Canada)","funders":"","keywords":"Mathematical optimization; Binary number; Scheduling (production processes); Integer programming; Heuristic; Linear programming; Decomposition; Computer science; Integer (computer science); Mathematics","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.00006414415,0.0001591931,0.0001622502,0.00007685465,0.00003011675,0.00004983173,0.0000899067,0.00009327028,0.000002699624],"category_scores_gemma":[0.00005833567,0.0001760975,0.00005216039,0.0001227217,0.00000908246,0.0001363227,0.0000206652,0.0001401771,0.000003287332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001008995,"about_ca_system_score_gemma":0.000009163858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001002298,"about_ca_topic_score_gemma":8.156808e-8,"domain_scores_codex":[0.9993653,0.00000253266,0.0001964113,0.0001756303,0.00007016684,0.0001899364],"domain_scores_gemma":[0.9996803,0.00007213196,0.00001579488,0.00009258719,0.0000401984,0.0000989658],"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.000004406671,0.000008481305,6.829583e-7,0.0001160047,0.00001916487,7.398031e-7,0.0001016252,0.92427,0.07099184,0.002207508,0.0000511826,0.002228414],"study_design_scores_gemma":[0.000494301,0.00001226397,0.000005173986,0.00009130942,0.00001400349,0.00001616089,0.000004118774,0.9109246,0.0875789,0.0003804406,0.0002963991,0.00018239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02160413,0.0002258073,0.977029,0.00009257384,0.000289204,0.0001351681,0.00000345274,0.0005591351,0.00006154858],"genre_scores_gemma":[0.4464206,0.00001525892,0.5533308,0.00004158571,0.00009739793,0.0000277345,0.00003582741,0.00002933957,0.000001503304],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4248165,"threshold_uncertainty_score":0.7181049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00618623950327441,"score_gpt":0.2372913085407404,"score_spread":0.231105069037466,"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."}}