{"id":"W3172863303","doi":"10.1007/s40314-021-01548-w","title":"Integrated hub location and flow processing schedule problem under renewable capacity constraint","year":2021,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Tardiness; Mathematical optimization; Computer science; Lagrangian relaxation; Schedule; Flow network; Integer programming; Scheduling (production processes); Profitability index; Linear programming; Operations research; Job shop scheduling; Engineering; 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.001232085,0.001044187,0.002177143,0.0009251221,0.0005830762,0.00179009,0.002351668,0.001926512,0.008416343],"category_scores_gemma":[0.002268074,0.001241706,0.001134772,0.002241503,0.000726482,0.001863718,0.001068477,0.001337212,0.0006550751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001650118,"about_ca_system_score_gemma":0.002478422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0127146,"about_ca_topic_score_gemma":0.009903486,"domain_scores_codex":[0.9993331,0.0001522479,0.00001767214,0.0002300427,0.0001171486,0.0001498166],"domain_scores_gemma":[0.9990368,0.0004731298,0.0001623692,0.00008043714,0.000136894,0.0001104964],"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.0001167292,0.00006417861,0.0002368854,0.00006776939,0.00003084047,0.0001003344,0.00002410438,0.9823737,0.0006677961,0.006543351,0.001017527,0.008756798],"study_design_scores_gemma":[0.00002302411,0.00004373832,0.0002154634,0.000004188482,0.00001651414,0.0000175881,0.00001972874,0.9944546,0.0003424289,0.004483653,0.0003725839,0.000006535928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.121196,0.0004203272,0.8607161,0.0005525026,0.0001725856,0.0002171172,0.001327785,0.0004722701,0.01492529],"genre_scores_gemma":[0.8055121,0.0003482459,0.1731513,0.0001072216,0.0001309169,0.0002616048,0.001311595,0.0002224994,0.01895454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0127146,"threshold_uncertainty_score":0.02815551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02633252222274936,"score_gpt":0.2409302420706465,"score_spread":0.2145977198478971,"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."}}