{"id":"W1983854422","doi":"10.1007/s40305-012-0002-7","title":"An Almost Tight Lower Bound for the Scheduling Problem to Meet Two Min-Sum Objectives","year":2013,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Scheduling (production processes); Combinatorics; Upper and lower bounds; Mathematics; Mathematical optimization; Computer science; Mathematical analysis","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.00794565,0.004805326,0.004488975,0.003171925,0.002368079,0.007371082,0.003819518,0.003847133,0.01423841],"category_scores_gemma":[0.03500282,0.001625851,0.00251238,0.004425957,0.002451111,0.00752415,0.005620594,0.00823588,0.00235155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004313971,"about_ca_system_score_gemma":0.004429187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0028193,"about_ca_topic_score_gemma":0.002960707,"domain_scores_codex":[0.9924428,0.002377437,0.0002562857,0.0009116833,0.002257381,0.001754536],"domain_scores_gemma":[0.9782248,0.01652974,0.0008427786,0.001456988,0.0018088,0.001137002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002037019,0.0007919549,0.001120962,0.001527911,0.0003741929,0.0002975714,0.0004653319,0.6196308,0.008024319,0.2261736,0.0377409,0.1018154],"study_design_scores_gemma":[0.0001255094,0.0003426661,0.0006107176,0.0001808165,0.0001084885,0.0002170918,0.0001763384,0.8011438,0.001979864,0.1892519,0.005804653,0.00005811477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05644932,0.00763262,0.8634166,0.006376514,0.001777575,0.000339162,0.001474533,0.001025377,0.06150842],"genre_scores_gemma":[0.6307989,0.005153448,0.3361513,0.003600753,0.002600041,0.001191837,0.00244152,0.001364469,0.01669773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01423841,"threshold_uncertainty_score":0.04763228,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02532677473620773,"score_gpt":0.334522220282114,"score_spread":0.3091954455459062,"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."}}