Skip to main content
SpringerLink
Log in

Online scheduling with immediate and reliable lead-time quotation

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

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\) and nonuniform weight of order, we prove an optimal strategy for the case with \(p=1\) and the nonexistence of competitive strategies for the case with \(p>1\). 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Borodin, A., & El-yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press.

    Google Scholar 

  • Chang, P., Hieh, J., & Liao, T. W. (2005). Evolving fuzzy rules for due date assignment problem in semiconductor manufacturing factory. Journal of Intelligent Manufacturing, 16(4–5), 549–557.

    Article  Google Scholar 

  • Charnsirisakskul, K., Griffin, P. M., & Keskinocak, P. (2004). Order selection and scheduling with leadtime flexibility. IIE Transactions, 36(7), 697–707.

    Article  Google Scholar 

  • Charnsirisakskul, K., Griffin, P. M., & Keskinocak, P. (2006). Pricing and scheduling decisions with leadtime flexibility. European Journal of Operational Research, 171(1), 153–169.

    Article  Google Scholar 

  • Ding, J. H., Ebenlendr, T., Sgall, J., Zhang, G. C. (2007). Online scheduling of equal-length jobs on parallel machines. 15th Annual European Symposium on Algorithms (ESA 2007), Eilat, Israel, pp. 427–438.

  • Ebenlendr, T., & Sgall, J. (2009). A lower bound for scheduling of unit jobs with immediate decision on parallel machines. 6th International Workshop on Approximation and Online Algorithms (WAOA 2008), Karlsruhe, Germany, pp. 43–52.

  • Fung, S. P. Y. (2010). Online preemptive scheduling with immediate decision or notification and penalties. 16th Annual International Computing and Combinatorics Conference (COCOON 2010), Nha Trang, Vietnam, pp. 389–398.

  • Goldwasser, M. H., & Kerbikov, B. (2003). Admission control with immediate notification. Journal of Scheduling, 6(3), 269–285.

    Article  Google Scholar 

  • Heinz, S., Krumke, S. O., Megow, N., Rambau, J., Tuchscherer, A., Vredeveld, T. (2006). The online target date assignment problem. 3th International Workshop on Approximation and Online Algorithms (WAOA 2005), Mallorca, Spain, pp. 230–243.

  • Hsu, S. Y., & Sha, D. Y. (2004). Due date assignment using artificial neural networks under different shop floor control strategies. International Journal of Production Research, 42(9), 1727–1745.

    Article  Google Scholar 

  • Kaminsky, P., & Kaya, O. (2005). Centralized versus decentralized scheduling and due date quotation in a make-to-order supply chain. Proceedings of the 2005 MSOM Conference, IL, USA, pp. 149–159.

  • Kaminsky, P., & Lee, Z. H. (2008). Effective on-line algorithms for reliable due date quotation and large-scale scheduling. Journal of Scheduling, 11(3), 187–204.

    Article  Google Scholar 

  • Keskinocak, P., Ravi, R., & Tayur, S. (2001). Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues. Management Science, 47(2), 264–279.

    Article  Google Scholar 

  • Poon, C. K., Zheng, F. F., & Xu, Y. F. (2007). On-demand bounded broadcast scheduling with tight deadlines. International Journal of Foundations of Computer Science, 18(2), 251–262.

    Article  Google Scholar 

  • Woeginger, G. J. (1994). On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130(1), 5–16.

    Article  Google Scholar 

Download references

Acknowledgments

The authors gratefully acknowledge the support of the NSF of China under Grants Nos. 71172189 and 61221063, the Program for New Century Excellent Talents in University (NCET-12-0824), the Program for Changjiang Scholars and Innovative Research Team in University (IRT1173), the Ministry of Education of Humanities and Social Science Project (12Yjc630284), and the Fundamental Research Funds for the Central Universities.

Author information

Authors and Affiliations

  1. Glorious Sun School of Business and Management, Donghua University, Shanghai , 200051, China

    Feifeng Zheng

  2. School of Management, Xi’an Jiaotong University, Shaanxi , 710049, China

    Yinfeng Xu

  3. School of Economics & Management, Tongji University, Shanghai , 200092, China

    Weimin Ma

  4. School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai , 200433, China

    E Zhang

Authors
  1. Feifeng Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinfeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weimin Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. E Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weimin Ma.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zheng, F., Xu, Y., Ma, W. et al. Online scheduling with immediate and reliable lead-time quotation. J Sched 17, 225–236 (2014). https://doi.org/10.1007/s10951-013-0363-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-013-0363-8

Keywords

Search

Navigation