| 词条 | S-graph |
| 释义 |
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] OverviewThe 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:
References1. ^{{Cite journal |last=Holczinger |first=T. |author2=J Romero |author3=L Puigjaner |author4=F Friedler |title=Scheduling of Multipurpose Batch Processes with Multiple Batches of the Products |volume=30 |pages=305–312 |date=2002-12-02 |journal=Hungarian Journal for Industrial Chemistry}} 2. ^1 2 {{Cite journal |last=Romero |first=Javier |author2=Luis Puigjaner |author3=Tibor Holczinger |author4=Ferenc Friedler |title=Scheduling intermediate storage multipurpose batch plants using the S-graph |journal=American Institute of Chemical Engineers |volume=50 |issue=2 |pages=403–417 |date=2004-02-18}} External links
1 : Job scheduling |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。