{"id":"W2050028837","doi":"10.1016/j.ejor.2006.06.004","title":"On-line supply chain scheduling problems with preemption","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Preemption; Competitive analysis; Computer science; Scheduling (production processes); Supply chain; Total cost; Operations research; Holding cost; Lead time; Supply chain management; Online algorithm; Mathematical optimization; Operations management; Business; Microeconomics; Algorithm; Marketing; Economics; Mathematics; Upper and lower bounds; Operating system","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.003640951,0.003004771,0.003753232,0.001362397,0.001687333,0.003487732,0.003601711,0.004643271,0.01002386],"category_scores_gemma":[0.008915849,0.002179025,0.00137203,0.003230684,0.001587133,0.00434009,0.002706243,0.002308108,0.0007847135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002238499,"about_ca_system_score_gemma":0.001495338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004516181,"about_ca_topic_score_gemma":0.003728756,"domain_scores_codex":[0.9974661,0.001127666,0.0001157794,0.0004172585,0.0003564217,0.000516863],"domain_scores_gemma":[0.992857,0.004748276,0.0009169364,0.0003700249,0.000430023,0.0006778276],"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.0004863686,0.0002038024,0.0004468891,0.0002075659,0.00008910491,0.0003212273,0.00007385958,0.9750797,0.0008775109,0.007065242,0.001819216,0.0133295],"study_design_scores_gemma":[0.0001200441,0.0002079812,0.000211253,0.00001670071,0.00004011431,0.00007470214,0.00005817192,0.9836668,0.0005707439,0.01412689,0.000891429,0.00001524098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2265764,0.001866935,0.7393933,0.002180371,0.0006352713,0.0008847812,0.001185744,0.0004823086,0.02679484],"genre_scores_gemma":[0.8975786,0.001323625,0.08026789,0.0003153914,0.0004816603,0.0004047034,0.0008026141,0.0002489033,0.01857665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01002386,"threshold_uncertainty_score":0.03353316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04593923085254975,"score_gpt":0.2958616965913797,"score_spread":0.2499224657388299,"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."}}