{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432016,0.0001025697,0.000110388,0.0003196088,0.0001564093,0.0001770989,0.0001912946,0.00002030275,0.0001510921],"category_scores_gemma":[0.0001368307,0.00007871469,0.00003556841,0.0003214567,0.00005401987,0.000204315,0.00001608491,0.0005489141,0.0001064389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007498886,"about_ca_system_score_gemma":0.00008292777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002232826,"about_ca_topic_score_gemma":0.000002259729,"domain_scores_codex":[0.9981831,0.0002699607,0.0003639523,0.0001086046,0.0008551968,0.000219243],"domain_scores_gemma":[0.9988869,0.0001327458,0.00004618601,0.0001064551,0.0007333012,0.00009437759],"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.00004379827,0.00005201092,0.0001452261,0.00001172033,0.00001870947,0.00005598603,0.00008215564,0.9949314,0.001080673,0.001724146,0.0007889122,0.001065264],"study_design_scores_gemma":[0.001898496,0.00117832,0.003255296,0.0003788525,0.000007792391,0.0001951657,0.0001043455,0.9881393,0.002632854,0.0002731432,0.00170441,0.0002320286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.573038,0.0006493655,0.4008279,0.001430563,0.0003042984,0.0002802812,0.00001029523,0.00009394258,0.02336531],"genre_scores_gemma":[0.933429,0.00004642468,0.065033,0.00002879953,0.0007332723,0.000002497207,0.00001983384,0.0000455523,0.0006615907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.360391,"threshold_uncertainty_score":0.3209892,"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."}}