{"id":"W1965105237","doi":"10.1007/s10951-011-0264-7","title":"Semi-online two-level supply chain scheduling problems","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competitive analysis; Online algorithm; Supply chain; A priori and a posteriori; Scheduling (production processes); Supply chain management; Computer science; Mathematical optimization; Upper and lower bounds; Job shop scheduling; Lost sales; Operations research; Mathematics; Business; Schedule; Marketing","routes":{"ca_aff":true,"ca_fund":true,"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.004659467,0.001749704,0.004803298,0.001065298,0.00112302,0.003885126,0.004131217,0.003868059,0.01053661],"category_scores_gemma":[0.01101661,0.001746232,0.001548936,0.002325331,0.001769631,0.005885447,0.004066499,0.002798591,0.0008166474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002003792,"about_ca_system_score_gemma":0.002634505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003240436,"about_ca_topic_score_gemma":0.002972248,"domain_scores_codex":[0.9968419,0.001330567,0.0001651234,0.0005389384,0.0004530636,0.0006702516],"domain_scores_gemma":[0.9858769,0.01038749,0.001101067,0.0007105584,0.0007772995,0.001146633],"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.0009735657,0.0004270351,0.0007473855,0.0004400414,0.0001408024,0.0003202812,0.0001088522,0.9395725,0.001061342,0.03057272,0.002798161,0.0228373],"study_design_scores_gemma":[0.00007651267,0.00009780306,0.0001420843,0.00001078793,0.00001800479,0.00003172174,0.00002617532,0.9803981,0.0002962955,0.01856942,0.0003203819,0.00001273733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1097822,0.0007943954,0.8742915,0.00170549,0.000246685,0.0003362437,0.001395201,0.0004299339,0.01101827],"genre_scores_gemma":[0.875542,0.000577527,0.1111973,0.0002949843,0.0002660264,0.0003495787,0.00119998,0.0001725056,0.01040015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01053661,"threshold_uncertainty_score":0.03524846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0427090246435247,"score_gpt":0.245424681843225,"score_spread":0.2027156571997003,"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."}}