{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606101,0.0001018995,0.0001563104,0.00006444073,0.000705469,0.0003214433,0.0005863959,0.00005460847,0.0000604157],"category_scores_gemma":[0.0002184903,0.00005784161,0.0002190818,0.0004354783,0.0001243561,0.0004341271,0.0000523371,0.0003766791,0.000004677941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009660385,"about_ca_system_score_gemma":0.0001686657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000053617,"about_ca_topic_score_gemma":0.00003573615,"domain_scores_codex":[0.9986801,0.0001091397,0.0003466386,0.00009662432,0.0005141353,0.0002533762],"domain_scores_gemma":[0.9983433,0.0002210253,0.00004368461,0.0002878911,0.0009868314,0.0001172698],"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.000007934852,0.00006011144,0.00003374338,0.00002130131,0.0001191789,7.990786e-8,0.00395421,0.9763308,0.0105663,0.0002394144,0.008007128,0.0006597593],"study_design_scores_gemma":[0.0004334099,0.0001603557,0.0005961149,0.00008465828,0.00001814084,0.00000827287,0.002221691,0.9868993,0.008219605,0.0005538217,0.0007145235,0.00009016207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7402237,0.0008906375,0.2320794,0.02371588,0.0007642235,0.001661652,0.00002130488,0.00003864594,0.000604582],"genre_scores_gemma":[0.6579481,0.0001208832,0.3408345,0.0001033512,0.0004082991,0.00005484851,0.000001284181,0.00002896203,0.0004997101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1087551,"threshold_uncertainty_score":0.5425968,"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."}}