S-graph
 | The topic of this article may not meet Wikipedia's general notability guideline. (April 2014) |
The S-graph framework is an approach to solving batch process scheduling problems in chemical plants.[1][2] S-graph is suited for the problems with a non-intermediate storage (NIS) policy, which often appears in chemical productions, but it is also capable of solving problems with an unlimited intermediate storage (UIS) policy.[2]
Overview
[edit]The S-graph representation exploits problem-specific knowledge to develop efficient scheduling algorithms.[2] 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. Different processing times can be set for the same task in different equipment types. It is possible to have more pieces of equipment of the same type, or define changeover times between two tasks performed on a single piece of equipment.
There are two types of the scheduling problems that can be handled:
- The number of product batches to produce is set, and the goal is to minimize the makespan (processing time).
- Every product has an associated revenue, and a time horizon for production is set. The objective is to maximize the revenue in this fixed time horizon. S-graph framework also contains combinatoric algorithms to solve both of these problems.
References
[edit]- ^ Holczinger, T.; J Romero; L Puigjaner; F Friedler (2002-12-02). "Scheduling of Multipurpose Batch Processes with Multiple Batches of the Products". Hungarian Journal for Industrial Chemistry. 30: 305–312.
- ^ a b c Romero, Javier; Luis Puigjaner; Tibor Holczinger; Ferenc Friedler (2004-02-18). "Scheduling intermediate storage multipurpose batch plants using the S-graph". AIChE Journal. 50 (2): 403–417. doi:10.1002/aic.10036.