Precedence Constraint Scheduling

from Wikipedia, the free encyclopedia

Precedence Constraint Scheduling (PCS) is one of the optimization problems in computer science . The aim of PCS is to create an optimal schedule (i.e. time schedule). A schedule can be thought of as a table. The schedule assigns each task a period in which it is processed. Only a limited number of tasks can be processed in each period. In addition, the tasks are interdependent, i. That is, some tasks cannot be completed until all of the tasks they have been given have been completed. A schedule is optimal when it only needs as many periods as is absolutely necessary.