Sign in
Back
Heuristic for Scheduling Intrees on m Machines with Non-availability Constraints
Conference proceeding

Heuristic for Scheduling Intrees on m Machines with Non-availability Constraints

Khaoula Ben Abdellafou, Hatem Hadda and Ouajdi Korbaa
INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA 2016), Vol.557, pp.384-393
Advances in Intelligent Systems and Computing
01/01/2017
DOI: https://doi.org/10.1007/978-3-319-53480-0_38

Abstract

Computer Science Computer Science, Artificial Intelligence Computer Science, Information Systems Computer Science, Theory & Methods Science & Technology Technology
This paper considers the problem of scheduling n tasks subject to intree-precedence constraints on m identical machines under non-availability constraints. The objective is to minimize the makespan. This problem is known to be NP-hard. We propose and test several heuristic variants based on different selection and dispatching rules.

Metrics

1 Record Views

Details