The following publications are possibly variants of this publication:
- Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability intervalImed Kacem, Ali Ridha Mahjoub. candie, 56(4):1708-1712, 2009. [doi]
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release datesImed Kacem, Hans Kellerer. scheduling, 14(3):257-265, 2011. [doi]
- Erratum to "Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval" [Comput. Ind. Eng. 56(2009) 1708-1712]I. Kacem. candie, 61(4):1351, 2011. [doi]
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability intervalImed Kacem. jco, 17(2):117-133, 2009. [doi]
- Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximabilityImed Kacem, Vangelis Th. Paschos. disopt, 10(1):61-68, 2013. [doi]
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability intervalImed Kacem, Hans Kellerer, Maryam Seifaddini. jco, 32(3):970-981, 2016. [doi]
- Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability IntervalImed Kacem, Hans Kellerer. iccl2 2018: 417-427 [doi]
- Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability IntervalImed Kacem, Hans Kellerer, Maryam Seifaddini. iscopt 2014: 305-314 [doi]
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervalsImed Kacem, Hans Kellerer, Yann Lanuel. jco, 30(3):403-412, 2015. [doi]