 The S-graph representation exploits problem-specific knowledge to develop efficient scheduling algorithms.In the scheduling problem, there are products, and a set of tasks, which have to be performed to produce a product.There are dependencies between the tasks, and every task has a set of needed equipment that can perform the task.