Resource assignment in a DSS for project scheduling

From MaRDI portal





A heuristic procedure is developed for solving the following multiprocessor task scheduling problem: Given a set of tasks. For each task \(T\) there is a time window in which \(T\) must be processed. Furthermore, there is a set \(A(T)\) of alternatives for processing task \(T\). Each alternative \(\alpha\) corresponds with a set \(S(\alpha)\) of machines which are needed to process \(T\) during a time period of \(p(\alpha)\) time units. All machines are different and there is only one machine of each type. Finally, there are precedence constraints between the tasks. The problem is to assign some \(\alpha\in S(T)\) to each task and to find a feasible schedule for all tasks such that the makespan of the schedule is minimized. For the entire collection see [Zbl 0754.00017].











This page was built for publication: Resource assignment in a DSS for project scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035092)