Approximation Schemes for Scheduling with Availability Constraints
We investigate the problems of scheduling n weighted jobs to m identical machines with availability constraints. We consider two different models of availability constraints: the preventive model where the unavailability is due to preventive machine maintenance, and the fixed job model where the unavailability is due to a priori assignment of some of the n jobs to certain machines at certain times. Both models have applications such as turnaround scheduling or overlay computing. In both models, the objective is to minimize the total weighted completion time. We assume that m is a constant, and the jobs are non-resumable. For the preventive model, it has been shown that there is no approximation algorithm if all machines have unavailable intervals even when w i = p i for all jobs. In this paper, we assume there is one machine permanently available and the processing time of each job is equal to its weight for all jobs. We develop the first PTAS when there are constant number of unavailable intervals. One main feature of our algorithm is that the classification of large and small jobs is with respect to each individual interval, thus not fixed. This classification allows us (1) to enumerate the assignments of large jobs efficiently; (2) and to move small jobs around without increasing the objective value too much, and thus derive our PTAS. Then we show that there is no FPTAS in this case unless P = NP.
For fixed job model, we first show that if job weights are arbitrary then there is no constant approximation for a single machine with 2 fixed jobs or for two machines with one fixed job on each machine, unless P = NP . As the preventive model, we assume that the weight of a job is the same as its processing time for all jobs. We show that the PTAS for the preventive model can be extended to solve this problem when the number of fixed jobs and the number of machines are both constants.
KeywordsSchedule Problem Completion Time Single Machine Feasible Schedule Identical Machine
Unable to display preview. Download preview PDF.
- 3.Cieliebak, M., Eidenbenz, S., Pagourtzis, A., Schlude, K.: Equal Sum Subsets: Complexity of Variations. Technical Report 370, CS, ETHZ (2002)Google Scholar
- 4.Diedrich, F., Jansen, K.: Improved Approximation Algorithms for Scheduling with Fixed Jobs. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 675–684 (2009)Google Scholar
- 5.Fu, B., Huo, Y., Zhao, H.: Makespan Minimization with Machine Availability Constraints. Discrete Mathematics, Algorithms and Applications (to appear, 2009)Google Scholar
- 7.Kacem, I., Mahjoub, R.: 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–1712Google Scholar
- 8.Kaspi, M., Montreuil, B. (1988). On the Scheduling of Identical Parallel Processes with Arbitrary Initial Processor Available TImes, Reserach Report 88-12, School of Industrial Engineering, Purdue University (1988)Google Scholar
- 9.Kellerer, H., Strusevish, V.A.: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica (to appear)Google Scholar
- 14.Lee, C.Y.: Machine scheduling with availability constraints. In: Leung, J.Y.-T. (ed.) Handboof of Scheduing, pp. 22.1–22.13. CRC Press, Boca Raton (2004)Google Scholar
- 16.Liman, S.: Scheduling with Capacities and Due-Dates, Ph.D. Dissertation, Industrial and Systems Engineering Department, University of Florida (1991)Google Scholar
- 18.Saidy, H., Taghvi-Fard, M.: Study of Scheduling Problems with Machine Availability Constraint. Journal of Industrial and Systems Engineering 1(4), 360–383 (2008)Google Scholar