Online scheduling with immediate and reliable lead-time quotation

被引:0
|
作者
Feifeng Zheng
Yinfeng Xu
Weimin Ma
E Zhang
机构
[1] Donghua University,Glorious Sun School of Business and Management
[2] Xi’an Jiaotong University,School of Management
[3] Tongji University,School of Economics & Management
[4] Shanghai University of Finance and Economics,School of Information Management and Engineering
来源
Journal of Scheduling | 2014年 / 17卷
关键词
Scheduling; Lead-time quotation; Online strategy ; Competitive ratio;
D O I
暂无
中图分类号
学科分类号
摘要
This paper studies an online scheduling problem with immediate and reliable lead-time quotation. A manufacturer either accepts an order by quoting a reliable lead-time on its arrival or rejects it immediately. The objective is to maximize the total revenue of completed orders. Keskinocak et al. (Management Science 47(2):264–279, 2001) studied a linear revenue function in a discrete model with integer release time of order, and proposed a competitive strategy Q-FRAC. This paper investigates a relaxed revenue function in both discrete and continuous models where orders are released at integer and real time points, respectively. For the discrete model, we present a revised Q-FRAC strategy that is optimal in competitiveness for concave and linear revenue functions with unit length and uniform weight of order, improving the previous results in Keskinocak et al. (Management Science 47(2):264–279, 2001). For the scenario with uniform length p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p$$\end{document} and nonuniform weight of order, we prove an optimal strategy for the case with p=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p=1$$\end{document} and the nonexistence of competitive strategies for the case with p>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p>1$$\end{document}. For the continuous model, we present an optimal strategy in competitiveness for the case with uniform weight of order and linear revenue functions, and prove the nonexistence of competitive strategies for the other case with nonuniform weight of order.
引用
收藏
页码:225 / 236
页数:11
相关论文
共 50 条
  • [1] Online scheduling with immediate and reliable lead-time quotation
    Zheng, Feifeng
    Xu, Yinfeng
    Ma, Weimin
    Zhang, E.
    [J]. JOURNAL OF SCHEDULING, 2014, 17 (03) : 225 - 236
  • [2] Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
    Keskinocak, P
    Ravi, R
    Tayur, S
    [J]. MANAGEMENT SCIENCE, 2001, 47 (02) : 264 - 279
  • [3] Inventory positioning, scheduling and lead-time quotation in supply chains
    Kaminsky, Philip
    Kaya, Onur
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 114 (01) : 276 - 293
  • [4] Ordering, Pricing, and Lead-Time Quotation Under Lead-Time and Demand Uncertainty
    Wu, Zhengping
    Kazaz, Burak
    Webster, Scott
    Yang, Kum-Khiong
    [J]. PRODUCTION AND OPERATIONS MANAGEMENT, 2012, 21 (03) : 576 - 589
  • [5] Lead-time quotation when customers are sensitive to reputation
    Slotnick, Susan A.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (03) : 713 - 726
  • [6] Competitive analysis for make-to-order scheduling with reliable lead time quotation
    Zheng, Feifeng
    Zhang, E.
    Xu, Yinfeng
    Hong, Wei-Chiang
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 182 - 198
  • [7] Competitive analysis for make-to-order scheduling with reliable lead time quotation
    Feifeng Zheng
    E. Zhang
    Yinfeng Xu
    Wei-Chiang Hong
    [J]. Journal of Combinatorial Optimization, 2014, 27 : 182 - 198
  • [8] Coping with production time variability via dynamic lead-time quotation
    Gökçe Kahveciog̃lu
    Barış Balcıog̃lu
    [J]. OR Spectrum, 2016, 38 : 877 - 898
  • [9] Coping with production time variability via dynamic lead-time quotation
    Kahvecioglu, Gokce
    Balcioglu, Baris
    [J]. OR SPECTRUM, 2016, 38 (04) : 877 - 898
  • [10] An Optimal Policy for Joint Dynamic Price and Lead-Time Quotation
    Feng, Jiejian
    Liu, Liming
    Liu, Xiaoming
    [J]. OPERATIONS RESEARCH, 2011, 59 (06) : 1523 - 1527