Abstract
In this paper, we consider an interesting generalization of the classic job scheduling problem in which each job needs to compete not only for machines but also for other types of resources. The contentions among jobs for machines and for resources could interfere with each other, which complicates the problem dramatically. We present a family of approximation algorithms for solving several variants of the problem by using a generic algorithmic framework. Our algorithms achieve a constant approximation ratio (i.e., 3) when there is only one type of resources or certain dependency relation exists among multiple types of resources. When the r resources are unrelated, the approximation ratio of our algorithm becomes k+2, where k≤ r is a constant depending on the problem instance. As an application, we also show that our techniques can be easily applied to optical burst switching (OBS) networks to design more efficient wavelength scheduling algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Akcoglu, J. Aspnes, B. DasGupta, and M.-Yang Kao, “Opportunity cost algorithms for combinatorial auctions,” in Applied Optimization: Computational Methods in Decision-Making, Economics and Finance, Kluwer Academic Publishers, 2002, pp. 455–479.
S. Albers, “On randomized online scheduling,” in Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, ACM Press, 2002, pp. 134–143.
E.M. Arkin and E.B. Silverberg. “Scheduling jobs with fixed start and end times.” Discrete Applied Mathematics, vol. 18, pp. 1–8, 1987.
A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber, “A unified approach to approximating resource allocation and scheduling,” in Proceedings of the Thirty- Second Annual ACM Symposium on Theory of Computing, ACM Press, 2000, pp. 735–744.
P. Berman and B. DasGupta, “Improvements in throughout maximization for real-time scheduling,” in Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, ACM Press, 2000, pp. 680–687.
P. Berman, B. DasGupta, and S. Muthukrishnan, “Simple approximation algorithm for nonoverlapping local alignments,” in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 677–678, 2002.
J. Chang and C. Park, “Efficient channel scheduling algorithms in optical burst switching architecture,” IEEE Workshop in High Performance Switching and Routing, 2002.
S. Charcranoon, T. S. El-Bawab, H.C. Cankaya, and J.-D.Shin, “Group-scheduling for optical burst switched networks,” in GLOBECOM 2003, San Francisco, December 2003.
J. Chuzhoy, R. Ostrovsky, and Y. Rabani, “Approximation algorithms for the job interval selection problem and related scheduling problems,” in IEEE Symposium on Foundations of Computer Science, 2001, pp. 348–356.
B. DasGupta and M.A. Palis, “Online real-time preemptive scheduling of jobs with deadlines on multiple machines,” Journal of Scheduling, vol. 4, no. 6, pp. 297–312, 2001.
T. Erlebach and F.C.R. Spieksma, “Simple algorithms for a weighted interval selection problem,” Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), 2000, pp. 228–240.
R. Graham, “Bounds for certain multiprocessing anomalies,” Bell System Technical Journal, vol. 45, pp. 1563–1581, 1966.
L.A. Hall, “Approximation algorithms for scheduling,” in D.S. Hochbaum (ed.), Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1997.
D.S. Hochbaum and D.B. Shmoys, “Using dual approximation algorithms for scheduling problems: Practical and theoretical results,” Journal of the ACM, vol. 34, pp. 144–162, 1987.
H. Kise, T. Ibaraki, and H. Mine, “A solvable case of one machine scheduling problems with ready and due dates,” Operations Research, vol. 26, pp. 121–126, 1978.
S. Kontogiannis, “Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines,” in Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, ACM Press, 2002, pp. 124–133.
G. Koren and D. Shasha, “dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems,” SIAM Journal on Computing, vol. 24, no. 2, 1995, pp. 318–339.
R.J. Lipton and A. Tomkins, “Online interval scheduling,” In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete algorithms, ACM Press, 1994, pp. 302–311.
C. Qiao and M. Yoo, “Optical burst switching (obs)—a new paradigm for an optical internet,” Journal High Speed Networks, vol. 8, pp. 69–84, 1999.
M. Scharbrodt, T. Schickinger, and A. Steger, “A new average case analysis for completion time scheduling” in Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, ACM Press, 2002, pp. 170–178.
J. Turner, “Terabit burst switching progress report,” Technical report, Washington University at St. Louis, 1998.
J. Turner, “Terabit burst switching,” Journal High Speed Networks, vol 8, pp. 3–16, 1999.
Y. Xiong, M. Vandenhoute, and H.C. Cankaya, “Control architecture in optical burst-switched wdm networks,” IEEE Journal on Selected Areas in Communications, vol. 18, pp. 1838–1851, 2000.
J. Xu, C. Qiao, J. Li, and G. Xu, “Efficient channel scheduling algorithms in optical burst switched networks” in INFOCOM 2003, 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco, March 2003.
M. Yoo and C. Qiao, “A high speed protocol for bursty traffic in optical networks. SPIE’s All-Optical Communication Systems:Architecture, Control and Protocol Issues, vol. 3230, pp. 79–90, 1997.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported in part by an IBM faculty partnership award, and an IRCAF award from SUNY Buffalo.
Rights and permissions
About this article
Cite this article
Chen, Z., Singh, V. & Xu, J. Efficient Job Scheduling Algorithms with Multi-Type Contentions. J Comb Optim 10, 179–197 (2005). https://doi.org/10.1007/s10878-005-2272-z
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-2272-z