14 citations · 14 across the 3 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 14 cited
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints
Imed Kacem, Hans Kellerer
In this paper, we consider four single-machine scheduling problems with release times, with the aim of minimizing the maximum lateness. In the first problem we have a common deadli…
cs.DS2017
Approximation Algorithms for the Open Shop Problem with Delivery Times
Imed Kacem, Christophe Rapine
In this paper we consider the open shop scheduling problem where the jobs have delivery times. The minimization criterion is the maximum lateness of the jobs. This problem is known…