Advertisement

Journal of Scheduling

, Volume 17, Issue 2, pp 161–172 | Cite as

Minimizing total weighted completion time with an unexpected machine unavailable interval

  • Yumei Huo
  • Boris Reznichenko
  • Hairong Zhao
Article

Abstract

In the past two decades, scheduling with machine availability constraints has received considerable attention. Until recently most research has focused on the setting where all machine unavailability information is known at the beginning of the scheduling horizon. In reality, this is not practical in some cases. The machine may become unavailable to process jobs due to a machine breakdown or an occurrence of an emergent job that has to be processed immediately. In both cases, the start time of the unavailable interval is unknown beforehand, and the length of the interval may not be known until the end of the interval. In this article, we consider the situation in which the scheduler has to make scheduling decisions without any knowledge of the machine unavailable intervals. Of particular interest is the problem of minimizing total weighted completion time. When there are two or more unavailable intervals on a single machine, Fu et al. (2009) have shown that the problem is exponentially inapproximable even when jobs’ weights are equal to their processing times and one has full knowledge of unavailability. So in this paper we consider the scheduling problem on a single machine with a single unavailable period. And, we assume that every job has a weight proportional to its processing time. Based on whether the unavailable interval is due to a breakdown or an emergent job, we have the breakdown model and the emergent job model. First we show that no \(\tfrac{\sqrt{5}+1}{2}\)-competitive online algorithm exists for the breakdown model, and no \(\tfrac{11-\sqrt{2}}{7}\)-competitive online algorithm exists for the emergent job model. Next, we show that the simple LPT rule can give a 2- and a \(\tfrac{9}{5}\)-competitive ratio for the breakdown model and the emergent job model, respectively. Further, we show that the ratios are tight by examples. For the offline case, we show that the First Fit LPT (FF-LPT) rule can give a tight approximation ratio of 2 and 4/3 for the breakdown model and the emergent job model, respectively. Finally, our experimental results show that, in practice, both LPT and FF-LPT perform very well and the performance improves when the number of jobs \(n\) increases. In both models, when \(n \ge 50\), the worst case error ratio is much better than the theoretical bounds.

Keywords

Unexpected machine unavailability Breakdown model  Emergent job model Total weighted completion time Competitive ratio Approximation algorithm 

Notes

Acknowledgments

This work is supported by a PSC-CUNY Research Award.

References

  1. Adiri, I., Bruno, J., Frostig, E., & Rinnooy Kan, A. H. G. (1989). Single machine flowtime scheduling with a single breakdown. Acta Informatica, 26, 679–96.CrossRefGoogle Scholar
  2. Arkin, R., & Roundy, R. (1991). Weighted tardiness scheduling on parallel machines with proportional weights. Operations Research, 39, 64–81.CrossRefGoogle Scholar
  3. Breit, J. (2007). Improved approximation for non-preemptive single machine flowtime scheduling with an availability constraint. European Journal of Operational Research, 183(3), 516–524.CrossRefGoogle Scholar
  4. Diedrich, F. & Jansen, K. (2009). Improved approximation algorithms for scheduling with fixed jobs. In Proceeding of the twentieth annual ACM-SIAM symposium on discrete algorithms (pp. 675–684).Google Scholar
  5. Diedrich, F., & Schwarz, U. M. (2007). A framework for scheduling with online availability. In Proceedings of parallel processing, LNCS. (Vol. 4641, pp. 205–213).Google Scholar
  6. Fu, B., Huo, Y., & Zhao, H. (2009). Exponential inapproximability and FPTAS for scheduling with availability constraints. Theoretical Computer Science, 410, 2663–2674.CrossRefGoogle Scholar
  7. Fu, B., Huo, Y., & Zhao, H. (2011). Approximation schemes for parallel machine scheduling with availability constraints. Discrete Applied Mathematics, 159(15), 1555–1565.CrossRefGoogle Scholar
  8. He, Y., Zhong, W., & Gu, H. (2006). Improved algorithms for two single machine scheduling problems. Theoretical Computer Science, 363, 257–265.CrossRefGoogle Scholar
  9. Kacem, I. (2008). Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering, 54, 401–410.CrossRefGoogle Scholar
  10. Kacem, I., & Chu, C. (2008). Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. European Journal of Operational Research, 187(3), 1080–1089.CrossRefGoogle Scholar
  11. Kacem, I., & Mahjoub, R. (2009). Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering, 56(4), 1708–1712.CrossRefGoogle Scholar
  12. Kacem, I., & Kellerer, H. (2011). Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. Journal of Scheduling, 14(3), 257–265.CrossRefGoogle Scholar
  13. Kellerer, H., & Strusevich, V. A. (2010). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57(4), 769–795.CrossRefGoogle Scholar
  14. Lee, C. Y. (1996). Machine scheduling with an availability constraints. Journal of Global Optimization, 9, 363–382.CrossRefGoogle Scholar
  15. Lee, C. Y., & Liman, S. D. (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Informatica, 29(4), 375–382.CrossRefGoogle Scholar
  16. Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58(2), 199–211.CrossRefGoogle Scholar
  17. Sadfi, C., Penz, B., Rapine, C., Blazewicz, J., & Formanowicz, P. (2005). An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research, 161, 3–10.CrossRefGoogle Scholar
  18. Scharbrodt, M., Steger, A., & Weisser, H. (1999). Approximability of scheduling with fixed jobs. Journal of Scheduling, 2, 267–284.Google Scholar
  19. Tan, Z., & He, Y. (2002). Optimal online algorithm for scheduling on two identical machines with machine availability constraints. Information Processing Letters, 83, 323–329.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Computer Science,College of Staten IslandCity University of New YorkStaten IslandUSA
  2. 2.Department of Mathematics, Computer Science & StatisticsPurdue University CalumetHammondUSA

Personalised recommendations