Abstract
This paper is the first attempt to successfully design efficient approximation algorithms for the single-machine weighted flow-time minimization problem when jobs have different release dates and weights equal to their processing times under the assumption that one job is fixed (i.e., the machine is unavailable during a fixed interval corresponding to the fixed job). Our work is motivated by an interesting algorithmic application to the generation of valid inequalities in a branch-and-cut method. Our analysis shows that the trivial FIFO sequence can lead to an arbitrary large worst-case performance bound. Hence, we modify this sequence so that a new 2-approximation solution can be obtained for every instance and we prove the tightness of this bound. Then, we propose a fully polynomial-time approximation algorithm with efficient running time for the considered problem. Especially, the complexity of our algorithm is strongly polynomial.
Similar content being viewed by others
References
Adiri, I., Bruno, J., Frostig, E., & Rinnooy Kan, A. H. G. (1989). Single machine flow-time scheduling with a single breakdown. Acta Informatica, 26, 679–696.
Belouadah, H., Posner, M. E., & Potts, C. N. (1992). Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics, 36, 213–231.
Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., & Weglarz, J. (2007). Scheduling with limited processor availability. In Handbook on scheduling: from theory to applications. Chap. 11.
Breit, J. (2007). Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint. European Journal of Operational Research, 183, 516–524.
Gens, G. V., & Levner, E. V. (1981). Fast approximation algorithms for job sequencing with deadlines. Discrete Applied Mathematics, 3, 313–318.
He, Y., Zhong, W., & Gu, H. (2006). Improved algorithms for two single machine scheduling problems. Theoretical Computer Science, 363, 257–265.
Chen, W. J. (2006). Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. Journal of the Operational Research Society, 57, 410–415.
Kacem, I. (2007a). Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed nonavailability interval. Journal of Combinatorial Optimization. doi:10.1007/s10878-007-9102-4.
Kacem, I. (2007b). Lower bounds for tardiness minimization on a single machine with family setup times. International Journal of Operations Research, 4, 18–31.
Kacem, I. (2008). Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering, 54, 401–410.
Kacem, I., & Haouari, M. (2008). Approximation algorithms for single machine scheduling with one unavailability period. 4OR: A Quarterly Journal of Operations Research. doi:10.1007/s10288-008-0076-6.
Kellerer, H., & Pferschy, U. (2004). Improved dynamic programming in connection with an FPTAS for the knapsack problem. Journal of Combinatorial Optimization, 8, 5–11.
Kellerer, H., & Strusevich, V. A. (2008). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica. doi:10.1007/s00453-008-9248-1.
Kellerer, H., Kubzin, M. A., & Strusevich, V. A. (2008). Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. European Journal of Operational Research. doi:10.1016/j.ejor.2008.11.003.
Kovalyov, M. Y., & Kubiak, W. (1999). A fully polynomial approximation scheme for weighted earliness-tardiness problem. Operations Research, 47, 757–761.
Kubzin, M. A., & Strusevich, V. A. (2006). Planning machine maintenance in two machine shop scheduling. Operations Research, 54, 789–800.
Lee, C. Y. (2004). Machine scheduling with an availability constraint. In J. Y. T. Leung (Ed.), Handbook of scheduling: Algorithms, models, and performance analysis. Boca Raton: CRC Press. Chap. 22.
Lee, C. Y., & Liman, S. D. (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Informatica, 29, 375–382.
Ma, Y., Chu, C., & Zuo, C. (2009, in press). A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering. doi:10.1016/j.cie.2009.04.014.
Qi, X. (2007). A note on worst-case performance of heuristics for maintenance scheduling problems. Discrete Applied Mathematics, 155, 416–422.
Qi, X., Chen, T., & Tu, F. (1999). Scheduling the maintenance on a single machine. Journal of the Operational Research Society, 50, 1071–1078.
Sadfi, C., Penz, B., Rapine, C., Blażewicz, 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.
Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23, 116–127.
Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121(1), 1–15.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kacem, I., Kellerer, H. Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J Sched 14, 257–265 (2011). https://doi.org/10.1007/s10951-009-0146-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0146-4