{"id":"W2081401598","doi":"10.1007/s10951-009-0109-9","title":"Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Schedule; Job scheduler; Mathematical optimization; Scheduling (production processes); Due date; Supply chain; Job shop scheduling; Batch processing; Batch production; Time complexity; Supply chain management; Parametric statistics; Algorithm; Mathematics; Operations management; Economics; Statistics; Queue; Business","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.005423017,0.002030443,0.002915123,0.001346573,0.001177969,0.002738188,0.003812893,0.003017308,0.003420508],"category_scores_gemma":[0.01229887,0.001792786,0.001214362,0.002856011,0.00169954,0.003349506,0.002226779,0.002373809,0.000459875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00348123,"about_ca_system_score_gemma":0.003197534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009754174,"about_ca_topic_score_gemma":0.008622319,"domain_scores_codex":[0.9982163,0.0007267072,0.00007736484,0.0002065565,0.0003491641,0.0004239169],"domain_scores_gemma":[0.9920155,0.005950423,0.0006572181,0.0003628596,0.0005584995,0.0004554218],"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.0002322734,0.0000706531,0.0004548163,0.00007945302,0.00003732532,0.00002678241,0.00005407283,0.982514,0.0003196432,0.004216818,0.0007484143,0.0112457],"study_design_scores_gemma":[0.00002390614,0.00002404299,0.00004024407,0.000004938254,0.000007781668,0.000006750327,0.00001251358,0.9956148,0.00008729872,0.004098963,0.00007588971,0.000002968115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08412243,0.0008549994,0.9107548,0.0007981648,0.0001250514,0.0001495317,0.0001963551,0.0003925939,0.002606067],"genre_scores_gemma":[0.6798624,0.0007911864,0.3116949,0.0003378795,0.0001831321,0.0003929283,0.0005595353,0.000257461,0.005920566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009754174,"threshold_uncertainty_score":0.02868003,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01905853976061846,"score_gpt":0.2621603572587304,"score_spread":0.243101817498112,"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."}}