首页> 外文期刊>Journal of combinatorial optimization >Competitive analysis for make-to-order scheduling with reliable lead time quotation
【24h】

Competitive analysis for make-to-order scheduling with reliable lead time quotation

机译:具有可靠提前期报价的按订单计划竞争分析

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

This paper makes extended studies on the discrete problem of online scheduling and reliable lead time quotation (discrete Q-SLTQ) introduced by Keskinocak et al. (Manag. Sci. 47(2):264-279, 2001). We first relax the assumption on revenue function from a linear decreasing function to any decreasing function. We present an online deterministic strategy which is optimal in competitiveness for concave revenue functions. The above results are further extended to the continuous Q-SLTQ model where orders are released at arbitrary time points. For the discrete Q-SLTQ problem, if orders are with nonuniform lengths, we prove the nonexistence of online strategies with bounded competitive ratios; otherwise if orders are with unit length but various weights, we present an optimal online strategy.
机译:本文对Keskinocak等人提出的在线调度离散问题和可靠的提前期报价(离散Q-SLTQ)进行了深入研究。 (Manag.Sci.47(2):264-279,2001)。首先,我们将收入函数的假设从线性递减函数放宽到任何递减函数。我们提出了一种在线确定性策略,该策略在降低收入功能方面具有最佳竞争力。以上结果进一步扩展到了连续Q-SLTQ模型,该模型在任意时间点下达订单。对于离散Q-SLTQ问题,如果定单的长度不均匀,则证明存在竞争率有限的在线策略不存在;否则,如果订单具有单位长度但权重不同,我们将提供最佳的在线策略。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号