{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002769948,0.001872072,0.00310827,0.00231898,0.001373147,0.001455116,0.002364706,0.002167438,0.009879584],"category_scores_gemma":[0.004631751,0.001842123,0.002277328,0.001998198,0.001287215,0.002194874,0.001755513,0.00384563,0.00130099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001380705,"about_ca_system_score_gemma":0.003498109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01213588,"about_ca_topic_score_gemma":0.01125737,"domain_scores_codex":[0.9990996,0.0004176908,0.00003314193,0.0001080556,0.0001657952,0.0001758067],"domain_scores_gemma":[0.9981135,0.001299786,0.00009398044,0.0001448437,0.0002232471,0.0001247105],"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.0002640965,0.0001857031,0.0001895622,0.0001222357,0.00007831815,0.00005362985,0.00006234261,0.8960761,0.001126816,0.0135637,0.003357969,0.08491951],"study_design_scores_gemma":[0.00005662678,0.00004359226,0.00003918908,0.00001303086,0.00001712931,0.00000702718,0.00001055129,0.9939184,0.0002787675,0.004909626,0.0006972062,0.000008895751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01084402,0.000389899,0.9837679,0.0002410993,0.0001621371,0.0002058137,0.0001124649,0.0005654529,0.003711218],"genre_scores_gemma":[0.1299455,0.0004853416,0.8614109,0.000292095,0.0001343418,0.0005552994,0.0003610169,0.0005129779,0.006302519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01213588,"threshold_uncertainty_score":0.03305054,"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."}}