|
The S-graph framework is capable of efficiently solving batch process scheduling problems in chemical plants. S-graph is especially developed for the problems with non-intermediate storage (NIS) policy, which often appears in chemical productions, but it is also capable to solve problems with unlimited intermediate storage (UIS) policy.〔 ==Overview== S-graph representation has the advantage of exploiting problem-specific knowledge to develop efficient scheduling algorithms.〔 There are products, and a set of task, which have to be performed to produce a product. There are dependencies between the tasks, and every task has a set of equipments, that can perform the task. Different processing times can be set for the same task in different equipments. It is also possible to have more equipment units from the same type, or define changeover times between two task in one equipment. There are two types of the scheduling problems: *The number of batches to produce is set, and we try to minimize the makespan (processing time). *Every product has a revenue, and a time horizon 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. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「S-graph」の詳細全文を読む スポンサード リンク
|