skip to main content
10.1145/2383276.2383294acmotherconferencesArticle/Chapter ViewAbstractPublication PagescompsystechConference Proceedingsconference-collections
research-article

Heuristic algorithms for a particular case of resource-constrained job-scheduling problem

Published: 22 June 2012 Publication History

Abstract

The paper presents two heuristic algorithms for scheduling jobs, using constrained common resource into an environment, consisted of identical connected computers. The particular case with equal or greater number of computers than the number of jobs is explored. The results, obtained by the proposed heuristic algorithms are compared to the exact solution, produced by classical branch and bound algorithm. The solutions, produced by all algorithms are proved to be statistically close. The proposed algorithms could be applied to schedule jobs for example in a real portfolio management system.

References

[1]
Baron, M. Probability and Statistics for Computer Scientists, ISBN: 1584886412, Chapman & Hall, 2006.
[2]
Dorndorf, U., W. Pesch, T. Phan-Huy. A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints.
[3]
Garey, M., D. Johnson. Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman. 1979.
[4]
Hartmann, S., D. Briskorn. A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, vol. 207, iss. 1, pp. 1--14, 2010.
[5]
Penev, I. Realization of Portfolio Management System in a Distributed Computing Environment. Proceedings of Fifth International Scientific Conference Computer Science'2009, ISBN: 978-954-438-853-9, pp. 291 ÷ 296.
[6]
Wall, M., B., A Genetic Algorithm for Resource-Constrained Scheduling, partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mechanical Engineering, Massachusetts Institute of Technology, 1996.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
CompSysTech '12: Proceedings of the 13th International Conference on Computer Systems and Technologies
June 2012
440 pages
ISBN:9781450311939
DOI:10.1145/2383276
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: 22 June 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. genetic algorithm
  2. heuristics
  3. job-scheduling
  4. resource constraints

Qualifiers

  • Research-article

Conference

CompSysTech'12

Acceptance Rates

Overall Acceptance Rate 241 of 492 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 69
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media