{"id":"W2593006794","doi":"10.5539/cis.v10n2p25","title":"Study on Loading-Machine Production Scheduling Algorithm of Forest-Pulp-Paper Enterprise","year":2017,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Fair-share scheduling; Dynamic priority scheduling; Rationalization (economics); Algorithm; Industrial engineering; Mathematical optimization; Operating system; Engineering","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.0006891126,0.0004958577,0.0006290184,0.0003852757,0.0006703096,0.0009546467,0.0007758341,0.0006328687,0.002690253],"category_scores_gemma":[0.001259334,0.0002761553,0.0004164875,0.000548005,0.000244312,0.001058715,0.000406753,0.0005003516,0.0002350977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009659261,"about_ca_system_score_gemma":0.00150036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01352795,"about_ca_topic_score_gemma":0.00674438,"domain_scores_codex":[0.999647,0.00008741387,0.00002109336,0.00008624351,0.00008327149,0.00007497569],"domain_scores_gemma":[0.9996421,0.0001561745,0.0000311226,0.0000134634,0.0001166102,0.00004046328],"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.00009445547,0.00005430348,0.002693555,0.00007617235,0.00001980459,0.0000649061,0.0001159927,0.9504972,0.001536843,0.006602119,0.001290625,0.036954],"study_design_scores_gemma":[0.000007615405,0.00001639252,0.0002304058,0.000002236752,0.000004105446,0.000008821952,0.00001617016,0.9980566,0.0002572408,0.001151199,0.0002467675,0.000002455983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.172964,0.0004507191,0.8171353,0.0004442693,0.00006314596,0.0001149255,0.00007833029,0.0003006799,0.008448703],"genre_scores_gemma":[0.9031442,0.000390301,0.09071482,0.00006864234,0.00004401253,0.0001351643,0.0002114902,0.0000516545,0.005239632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01352795,"threshold_uncertainty_score":0.02689844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01288219978110149,"score_gpt":0.2533338530368068,"score_spread":0.2404516532557053,"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."}}