{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002275143,0.0009606832,0.001414082,0.0005083663,0.0008564742,0.002088393,0.001313509,0.001065874,0.002412724],"category_scores_gemma":[0.009932638,0.0007643372,0.0003775143,0.0008457711,0.001395128,0.001855696,0.00109258,0.001234194,0.00041386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002922809,"about_ca_system_score_gemma":0.002954555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007558436,"about_ca_topic_score_gemma":0.004904056,"domain_scores_codex":[0.9986765,0.0004740727,0.0000501627,0.0001780839,0.0002144982,0.0004067011],"domain_scores_gemma":[0.995205,0.002972485,0.0005889371,0.0003002414,0.0004746041,0.000458764],"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.0001805648,0.00004671845,0.0002976797,0.00002860039,0.000009310352,0.00005020429,0.00004899573,0.9776117,0.000928881,0.01576458,0.000543353,0.004489409],"study_design_scores_gemma":[0.00002432342,0.00002901758,0.00008589503,0.000002887019,0.000004754958,0.00001019635,0.00002453342,0.9899234,0.0004573724,0.009278385,0.0001506436,0.000008537021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.353332,0.0008040617,0.6318455,0.00119462,0.0001694803,0.000126214,0.0002155906,0.0005652151,0.0117473],"genre_scores_gemma":[0.9784759,0.0001418466,0.01943813,0.00005649379,0.0000239459,0.00002914337,0.00003721668,0.00004726575,0.001750079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007558436,"threshold_uncertainty_score":0.0212065,"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."}}