{"id":"W2127943707","doi":"10.1287/opre.1080.0608","title":"Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":85,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kellogg's (Canada)","funders":"National Science Foundation","keywords":"Mathematical optimization; Regular polygon; Computer science; Dynamic pricing; Order (exchange); Scheduling (production processes); Asymptotically optimal algorithm; Lead time; Convex function; Concave function; Nonlinear pricing; Dynamic programming; Nonlinear system; Mathematics; Economics; Microeconomics; Operations management","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001222428,0.000140805,0.0001768141,0.0004396521,0.001145909,0.0009944375,0.0001823614,0.00008085543,0.0003766373],"category_scores_gemma":[0.0003696244,0.0001377146,0.00004364421,0.001034311,0.0002174182,0.00159514,0.00009782566,0.0003569457,0.001780918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001399217,"about_ca_system_score_gemma":0.00006095531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001656396,"about_ca_topic_score_gemma":0.0001791198,"domain_scores_codex":[0.9985141,0.00008979602,0.0002372695,0.0003642786,0.000411418,0.0003831232],"domain_scores_gemma":[0.9989161,0.0001311621,0.00003403327,0.0002662497,0.0006254721,0.00002694901],"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.0001155359,0.0001698724,0.0002638908,0.00003168209,0.00009474254,0.00002691338,0.0003031484,0.8049535,0.04390096,0.1257588,0.0004096438,0.0239713],"study_design_scores_gemma":[0.0003747563,0.0000197001,0.0007054131,0.00002815106,0.00003298232,0.000003716847,0.0005778585,0.994971,0.0001212841,0.001836675,0.001138667,0.0001897826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.970373,0.0001332824,0.01623322,0.003666741,0.00003879911,0.0003532778,0.000002486467,0.0001041815,0.009095004],"genre_scores_gemma":[0.9915346,0.00001857235,0.004455584,0.0006495859,0.0001578364,0.00002319777,0.00008699163,0.00002267451,0.003050947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1900175,"threshold_uncertainty_score":0.9989963,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02763905645098608,"score_gpt":0.3411861512873318,"score_spread":0.3135470948363457,"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."}}