{"id":"W2063635201","doi":"10.1016/j.cie.2009.01.010","title":"A genetic approach to two-phase optimization of dynamic supply chain scheduling","year":2009,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Procurement; Supply chain; Scheduling (production processes); Computer science; Tardiness; Build to order; Supply chain optimization; Mass customization; Job shop scheduling; Industrial engineering; Operations research; Personalization; Mathematical optimization; Supply chain management; Schedule; Engineering; Operations management; Production (economics); Business","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001502005,0.0002565224,0.0003194178,0.0003836006,0.00003772082,0.00005898116,0.0002514429,0.0001537981,0.000006743993],"category_scores_gemma":[0.00005995517,0.0003069419,0.00007910007,0.0007225767,0.00001024596,0.0001042005,0.00002765608,0.0002753913,0.000003739952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074842,"about_ca_system_score_gemma":0.00002668109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003057884,"about_ca_topic_score_gemma":7.488613e-8,"domain_scores_codex":[0.9987533,0.00001606594,0.000441667,0.0002552684,0.0001958505,0.0003378429],"domain_scores_gemma":[0.9994125,0.00004058108,0.00004695514,0.000254061,0.00005584067,0.0001900813],"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.00001080886,0.00004832542,0.000004455248,0.00001526601,0.00002881653,0.000002375114,0.0001878853,0.9703077,0.0009767644,0.00006428174,0.00002461062,0.02832867],"study_design_scores_gemma":[0.001889116,0.00009395581,0.00003829306,0.0001011138,0.0000201147,0.00001036248,0.0000243905,0.9968578,0.0006318563,0.000002671342,0.00003266156,0.0002976308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07541293,0.0001361517,0.9226019,0.00003673443,0.0008954434,0.0003036921,0.000007272763,0.0005162589,0.00008956977],"genre_scores_gemma":[0.4978802,0.000007491959,0.5017861,0.00002202148,0.0002360855,0.000007817802,0.00002381494,0.00003276997,0.000003709563],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4224672,"threshold_uncertainty_score":0.9999382,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01511577713601886,"score_gpt":0.2282072735914384,"score_spread":0.2130914964554195,"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."}}