research-article

Online nonpreemptive scheduling of equal-length jobs on two identical machines

Authors:

Michael H. Goldwasser,

Mark PedigoAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 5, Issue 1

Article No.: 2, Pages 1 - 18

https://doi.org/10.1145/1435375.1435377

Published: 12 December 2008 Publication History

Get Access

Abstract

We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature, this problem is denoted as P2 | p_j = p,r_j | Σ Ū_j. The problem is known to be polynomially solvable in an offline setting.

In an online variant of the problem, a job's existence and parameters are revealed to the scheduler only upon that job's release date. We present an online deterministic algorithm for the problem and prove that it is 3/2-competitive. A simple lower bound shows that this is the optimal deterministic competitiveness.

References

[1]

Baptiste, P., Brucker, P., Knust, S., and Timkovsky, V. G. 2004. Ten notes on equal-processing-time scheduling. 4OR: Quarterly J. Belgian, French and Italian Oper. Res. Soc. 2, 2 (July), 111--127.

Google Scholar

[2]

Baruah, S. K., Haritsa, J. R., and Sharma, N. 2001. On-line scheduling to maximize task completions. J. Combin. Math. Combin. Computing 39, 65--78.

Google Scholar

[3]

Borodin, A., and El-Yaniv, R. 1998. Online Computation and Competitive Analysis. Cambridge Univ. Press, New York.

Digital Library

Google Scholar

[4]

Chrobak, M., Jawor, W., Sgall, J., and Tichý, T. 2007. Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput. 36, 6, 1709--1728.

Digital Library

Google Scholar

[5]

Ding, J., and Zhang, G. 2006. Online scheduling with hard deadlines on parallel machines. In Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (Hong Kong, China). Lecture Notes in Computer Science, vol. 4041. Springer-Verlag, New York, 32--42.

Digital Library

Google Scholar

[6]

Goldman, S., Parwatikar, J., and Suri, S. 2000. On-line scheduling with hard deadlines. J. Algorithms 34, 2 (Feb.), 370--389.

Digital Library

Google Scholar

[7]

Goldwasser, M. H. 2003. Patience is a virtue: The effect of slack on competitiveness for admission control. J. Scheduling 6, 2 (Mar./Apr.), 183--211.

Digital Library

Google Scholar

[8]

Goldwasser, M. H., and Kerbikov, B. 2003. Admission control with immediate notification. J. Scheduling 6, 3 (May/June), 269--285.

Digital Library

Google Scholar

[9]

Jackson, J. R. 1955. Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles. Jan.

Google Scholar

[10]

Simons, B. B. 1983. Multiprocessor scheduling of unit length jobs with arbitrary release times and deadlines. SIAM J. Comput. 12, 294--299.

Crossref

Google Scholar

[11]

Simons, B. B., and Warmuth, M. K. 1989. A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM J. Comput. 18, 4, 690--710.

Digital Library

Google Scholar

Cited By

View all

Jamalabadi SSchwiegelshohn CSchwiegelshohn UScheideler CSpear M(2020)Commitment and Slack for Online Load MaximizationProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400271(339-348)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400271
Deng HZhao THou I(2019)Online Routing and Scheduling With Capacity Redundancy for Timely Delivery Guarantees in Multihop NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2019.291739327:3(1258-1271)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1109/TNET.2019.2917393
Moharir SSanghavi SShakkottai S(2016)Online load balancing under graph constraintsIEEE/ACM Transactions on Networking10.1109/TNET.2015.244259724:3(1690-1703)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2442597
Show More Cited By

Index Terms

Online nonpreemptive scheduling of equal-length jobs on two identical machines
1. Theory of computation

Recommendations

Online, non-preemptive scheduling of equal-length jobs on two identical machines
SWAT'06: Proceedings of the 10th Scandinavian conference on Algorithm Theory

We consider the non-preemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature,...
Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines

We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are given its release date when the job becomes available for processing. All jobs have equal processing requirements. Preemptions are allowed. The objective is ...
Scheduling preemptable position-dependent jobs on two parallel identical machines
Highlights
- We consider two-machine scheduling of jobs with position-dependent processing times.
Abstract
A problem of preemptive scheduling of jobs with position-dependent processing times on two parallel identical machines and the schedule length criterion is addressed. Jobs may be preempted but only restricted preemption of a single job ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 5, Issue 1

November 2008

281 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/1435375

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 December 2008

Accepted: 01 March 2008

Revised: 01 March 2008

Received: 01 May 2006

Published in TALG Volume 5, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

National Science Foundation

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
396
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jamalabadi SSchwiegelshohn CSchwiegelshohn UScheideler CSpear M(2020)Commitment and Slack for Online Load MaximizationProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400271(339-348)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400271
Deng HZhao THou I(2019)Online Routing and Scheduling With Capacity Redundancy for Timely Delivery Guarantees in Multihop NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2019.291739327:3(1258-1271)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1109/TNET.2019.2917393
Moharir SSanghavi SShakkottai S(2016)Online load balancing under graph constraintsIEEE/ACM Transactions on Networking10.1109/TNET.2015.244259724:3(1690-1703)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2442597
Bunde DGoldwasser M(2010)Dispatching equal-length jobs to parallel machines to maximize throughputProceedings of the 12th Scandinavian conference on Algorithm Theory10.1007/978-3-642-13731-0_33(346-358)Online publication date: 21-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13731-0_33

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations