The following publications are possibly variants of this publication:
- 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]
- 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]
- Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline ConstraintsImed Kacem, Hans Kellerer. algorithmica, 80(12):3825-3843, 2018. [doi]
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability intervalHans Kellerer, Mikhail A. Kubzin, Vitaly A. Strusevich. eor, 199(1):111-116, 2009. [doi]
- 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]
- Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability IntervalGais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman. codit 2018: 757-762 [doi]