Online scheduling with immediate and reliable lead-time quotation
- 309 Downloads
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.
KeywordsScheduling Lead-time quotation Online strategy Competitive ratio
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.
- Borodin, A., & El-yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press.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. Google Scholar
- 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.Google Scholar
- 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.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.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.Google Scholar