{"id":"W3015499206","doi":"10.1139/cjfr-2019-0425","title":"Partitioning and solving large-scale tactical harvest scheduling problems for industrial plantation forests","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Forest Biomass Utilization and Management","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; Conselho Nacional de Desenvolvimento Científico e Tecnológico; European Commission; Oregon State University","keywords":"Scheduling (production processes); Mathematical optimization; Integer programming; Computer science; Linear programming; Heuristic; Optimization problem; Transportation theory; Scale (ratio); Operations research; Mathematics; Geography","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953189,0.0008327489,0.0005120714,0.0004080186,0.0006859463,0.0007692325,0.0005738214,0.0006216502,0.001670665],"category_scores_gemma":[0.001202018,0.0004293188,0.0005695375,0.0006718558,0.0005809275,0.0006018858,0.0006282219,0.0007149269,0.0001054426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019615,"about_ca_system_score_gemma":0.001764923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03192143,"about_ca_topic_score_gemma":0.04080601,"domain_scores_codex":[0.9997273,0.00009931029,0.00001289279,0.00005060634,0.00003952529,0.0000703039],"domain_scores_gemma":[0.9992437,0.0005872824,0.00005966887,0.00003093889,0.0000388202,0.00003959409],"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.00002020062,0.00004066431,0.0004858147,0.00004084975,0.00001108666,0.00005513668,0.00003964535,0.9860424,0.001011604,0.001649762,0.0002430359,0.01035986],"study_design_scores_gemma":[0.00001832849,0.00003264971,0.0004244853,0.000005158456,0.000009203556,0.00001818728,0.00008594664,0.9945428,0.00077233,0.003503941,0.0005820265,0.000004931178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3224147,0.0004772132,0.6653571,0.0003850612,0.00003751713,0.00034127,0.000272717,0.0003131003,0.0104015],"genre_scores_gemma":[0.7447325,0.0002913921,0.2525622,0.00005460183,0.00001776511,0.0002719063,0.0002433152,0.00007400426,0.001752349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03192143,"threshold_uncertainty_score":0.06347126,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09608171213536579,"score_gpt":0.3026083847634741,"score_spread":0.2065266726281083,"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."}}