A Task Scheduling Procedure in Multimachines System for Special Type of Processing Time Function

This paper presents results of research on the problem of time-optimal tasks scheduling and resources allocation in multimachines system. We consider an multimachines system consisting of m parallel machines. This system can execute n independent tasks. The purpose of optimization is to find such a schedule of tasks on parallel machines and such an allocation of limited resources among machines that schedule length criterion is minimized. Because our problem belongs to the class of NP-complete problems we propose an heuristic algorithm, which employs some problem properties. Some results of executed computational experiments for basis of proposed heuristic algorithm and comparative analysis of heuristic algorithm and algorithm LPT are presented.