Abstract
In this paper we consider the scheduling problem with machine cost and rejection penalties. For this problem, we are given a sequence of independent jobs, each being characterized by its processing time (size) and its penalty. No machine is initially provided, and when a job is revealed the algorithm has the option to purchase new machines. Right when a new job arrives, we have the following choices: (i) reject it, in which case we pay its penalty; (ii) non-preemptively process it on an existing machine, which contributes to the machine load; (iii) purchase a new machine, and assign it to this machine. The objective is to minimize the sum of the makespan, the cost for purchasing machines, and the total penalty of all rejected jobs. For the small job case, (where all jobs have sizes no greater than the cost for purchasing one machine, and which is the generalization of the Ski-Rental Problem) we present an optimal online algorithm with a competitive ratio of 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2001) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13:64–78
Dósa G, He Y (2004) Better on-line algorithms for scheduling with machine cost. SIAM J Comput 33:1035–1051
Dósa G, He Y (2006) Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Comput 76(1):149–164
Epstein L, Sgall J (2004) Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39:43–57
Graham RL (1966) Bounds for certain multiprocessor anomalies. Bell Syst Techn J 45:1563–1581
He Y, Min X (2000) On-line machine scheduling with rejection. Comput 65:1–12
Hoogeveen H, Skutella M, Woeginger GJ (2003) Preemptive scheduling with rejection. Math Program 94:361–374
Imreh C, Noga J (1999) Scheduling with machine cost. In: Proc. RANDOM-APPROX Conf, lecture notes in computer science, vol. 1671, Springer-Verlag, pp 168–176
Jiang YW, He Y (2005) Preemptive online algorithms for scheduling with machine cost. Acta Informatica 41:315–240
Nagy-György J, Imreh C (2006) On-line scheduling with machine cost and rejection. Working paper
Panwalker S, Liman SD (2002) Single operation earliness-tardiness scheduling with machine activation costs. IIE Trans 34:509–513
Raghavan P (1991) A statistical adversary for on-line algorithms. In: On-line algorithms, DIMACS, Series in Discrete Mathematics and Theoretical Computer Sc., AMS, Providence, RI/Assoc. for Comp. Mach. vol. 7, New York, pp. 79-83
Seiden S (2001) Preemptive multiprocessor scheduling with rejection. Theor Comput Sci 262:437–458
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dósa, G., He, Y. Scheduling with machine cost and rejection. J Comb Optim 12, 337–350 (2006). https://doi.org/10.1007/s10878-006-9003-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-9003-y