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

Authors:
Ivaylo Penev;Milena Karova;Stanislav Stoyanov
Affiliations:
Technical university -- Varna;Technical university - Varna;Computer systems and technologies
Venue:
Proceedings of the 13th International Conference on Computer Systems and Technologies
Year:
2012

Citing 3
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A genetic algorithm for resource-constrained scheduling

A genetic algorithm for resource-constrained scheduling
Probability and Statistics for Computer Scientists

Probability and Statistics for Computer Scientists

Quantified Score

Hi-index	0.00

Visualization

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.