{"id":"W1210901285","doi":"10.1016/j.ifacol.2015.06.305","title":"On-line Supply Chain Scheduling Problem with Capacity Limited Vehicles","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Supply chain; Competitive analysis; Robustness (evolution); Operations research; Mathematics; Computer network; Upper and lower bounds; Business; Routing (electronic design automation)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002702473,0.00033097,0.000304671,0.0001600957,0.0000895234,0.00007313336,0.0001992488,0.0001585015,0.00005020925],"category_scores_gemma":[0.0001154389,0.0002789471,0.0000586895,0.0004685154,0.00006828399,0.0001539146,0.0000227065,0.0004115401,0.0001217431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001120331,"about_ca_system_score_gemma":0.00005865124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003092085,"about_ca_topic_score_gemma":0.00004168466,"domain_scores_codex":[0.9985198,0.00003632334,0.0002923733,0.0003296437,0.0003911256,0.0004307321],"domain_scores_gemma":[0.9990372,0.00008706551,0.000055431,0.0003138583,0.0001821087,0.0003243497],"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.00007891461,0.00009409676,0.0003295376,0.00003656701,0.00006787864,0.00001795605,0.0008085928,0.9946923,0.0005523968,0.0002655553,0.00001559379,0.003040595],"study_design_scores_gemma":[0.001842571,0.0003076187,0.0001073558,0.0001468424,0.00003130713,0.00002671601,0.000482894,0.9936236,0.002717713,0.00009555553,0.000166818,0.0004510356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9241212,0.0003963387,0.0697062,0.001324121,0.0004154257,0.0003872867,0.00008251511,0.001553634,0.00201327],"genre_scores_gemma":[0.2550282,0.00002897028,0.7438724,0.0002981974,0.0002967416,0.00002363117,0.000110378,0.00008101288,0.0002603983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6741662,"threshold_uncertainty_score":0.9999663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02993425478790617,"score_gpt":0.2288458763730954,"score_spread":0.1989116215851892,"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."}}