{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009254441,0.0003048652,0.0004633109,0.0004189411,0.0001195189,0.00007608221,0.0004228659,0.0001626182,0.0002050974],"category_scores_gemma":[0.0001854799,0.0002846566,0.000218647,0.0004704171,0.00005059982,0.0004982115,0.0000495643,0.0008350916,0.00003532475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009980307,"about_ca_system_score_gemma":0.00009075348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001014684,"about_ca_topic_score_gemma":0.000006312812,"domain_scores_codex":[0.9977996,0.00004419839,0.001021942,0.0001882428,0.0004339826,0.000512062],"domain_scores_gemma":[0.9986541,0.00007268709,0.0003331337,0.000236306,0.0004032664,0.0003005254],"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.00002649061,0.0001176891,0.002816058,0.00008051491,0.0001630199,0.00005230481,0.001673314,0.9850791,0.003745441,0.0001599996,0.00001939939,0.006066693],"study_design_scores_gemma":[0.002077459,0.0001487607,0.001446637,0.0006837557,0.0001099871,0.0004387491,0.001641988,0.980978,0.01118126,0.0005729423,0.0001526298,0.0005678029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5573155,0.002367275,0.4372834,0.0001156459,0.00161566,0.0001311337,0.00001474632,0.0002254962,0.0009311406],"genre_scores_gemma":[0.4961052,0.0002471785,0.5028616,0.00006440289,0.0006091124,0.000002159461,0.000005426106,0.00005964374,0.00004529546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06557817,"threshold_uncertainty_score":0.9999605,"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."}}