{"id":"W2064818654","doi":"10.1002/aic.690481226","title":"Chronological decomposition heuristic for scheduling: Divide and conquer method","year":2002,"lang":"en","type":"article","venue":"AIChE Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"Honeywell (Canada)","funders":"","keywords":"Spec#; Scheduling (production processes); Heuristics; Operations research; Computer science; Decomposition; Mathematics; Mathematical optimization; Chemistry; Programming language","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.0002858147,0.00009632147,0.0001320671,0.00006090558,0.0001297183,0.00008717497,0.00006110256,0.00008589048,0.0001569559],"category_scores_gemma":[0.0001301742,0.00008461219,0.0000438745,0.00005972674,0.00001944606,0.00009326187,0.00001022411,0.0002246909,0.00001973319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000330734,"about_ca_system_score_gemma":0.00000437234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.040926e-7,"about_ca_topic_score_gemma":2.287873e-7,"domain_scores_codex":[0.9994199,0.0000326166,0.0002038046,0.00009041354,0.00008013545,0.0001731228],"domain_scores_gemma":[0.999568,0.0001634665,0.00003846418,0.00006125985,0.00005905418,0.0001097115],"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.00003270437,0.00009741014,0.0007937115,0.00008873127,0.0002620592,0.00004055045,0.0007648961,0.842231,0.003900412,0.000757041,0.006410886,0.1446206],"study_design_scores_gemma":[0.0006414729,0.00005055625,0.0002714821,0.00002243496,0.00003493273,0.0004057582,0.00003495829,0.9952368,0.000843723,0.0008238165,0.001501665,0.0001324111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02381273,0.001541771,0.9731702,0.0006012073,0.0003401246,0.00008701938,0.000002866076,0.0001104896,0.0003335454],"genre_scores_gemma":[0.3193388,0.000337005,0.6796852,0.0001353617,0.0004162859,0.000009604066,0.000003441017,0.0000192746,0.00005508583],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2955261,"threshold_uncertainty_score":0.3450385,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02610529776044341,"score_gpt":0.2845650213634277,"score_spread":0.2584597236029842,"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."}}