{"id":"W1980067218","doi":"10.1016/s0166-218x(02)00502-4","title":"A lower bound for the job insertion problem","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Kommission für Technologie und Innovation; École Polytechnique Fédérale de Lausanne","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Job loss","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.0001830691,0.0001199718,0.000112565,0.00002457023,0.0001105597,0.00007076665,0.0001000862,0.0000568244,0.00003830659],"category_scores_gemma":[0.00003000854,0.00008497317,0.00004855238,0.0001177086,0.00002423732,0.00003378199,0.000007090358,0.00007723731,0.00003714021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000210697,"about_ca_system_score_gemma":0.00001050552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.214587e-7,"about_ca_topic_score_gemma":0.000001042369,"domain_scores_codex":[0.9994301,0.00000287861,0.0001916703,0.00009278339,0.0001091204,0.0001734204],"domain_scores_gemma":[0.9995719,0.0001165103,0.0000312691,0.0002181686,0.00002699188,0.0000351348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001498817,0.00008976788,0.00000804488,0.0006461034,0.0002056022,7.683361e-7,0.003217699,0.3162157,0.002830756,0.6693484,0.002770263,0.004651907],"study_design_scores_gemma":[0.0008083978,0.00002326127,0.00001577153,0.00004125291,0.0001038731,0.000006583469,0.001233841,0.9295769,0.005908473,0.05219696,0.009684193,0.000400437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004584028,0.0001179665,0.9690399,0.00005121514,0.000182952,0.0005846874,0.000005515848,0.0002480354,0.02518573],"genre_scores_gemma":[0.1985785,0.00004335674,0.8002986,0.00009304855,0.00007210793,0.000454015,0.00001207478,0.00007959997,0.0003687415],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6171514,"threshold_uncertainty_score":0.3465105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01352822451318907,"score_gpt":0.2261568790805771,"score_spread":0.212628654567388,"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."}}