<th id="5nh9l"></th><strike id="5nh9l"></strike><th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th><strike id="5nh9l"></strike>
<progress id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"><noframes id="5nh9l">
<th id="5nh9l"></th> <strike id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>
<progress id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span><strike id="5nh9l"><noframes id="5nh9l"><strike id="5nh9l"></strike>
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"></span><span id="5nh9l"><video id="5nh9l"></video></span>
<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th>
<progress id="5nh9l"><noframes id="5nh9l">
Volume 32 Issue 7
Aug.  2021
Turn off MathJax
Article Contents
WANG Hong-bing, XU An-jun, YAO Lin, TIAN Nai-yuan. Modeling of steelmaking continue-casting manufacturing flow using colored Petri nets and solution of optimized scheduling[J]. Chinese Journal of Engineering, 2010, 32(7): 938-945. doi: 10.13374/j.issn1001-053x.2010.07.018
Citation: WANG Hong-bing, XU An-jun, YAO Lin, TIAN Nai-yuan. Modeling of steelmaking continue-casting manufacturing flow using colored Petri nets and solution of optimized scheduling[J]. Chinese Journal of Engineering, 2010, 32(7): 938-945. doi: 10.13374/j.issn1001-053x.2010.07.018

Modeling of steelmaking continue-casting manufacturing flow using colored Petri nets and solution of optimized scheduling

doi: 10.13374/j.issn1001-053x.2010.07.018
  • Received Date: 2009-09-21
  • The manufacturing flow between steel-making and continuous-casting, which is a complex multistage and multi-product production process, was modeled using colored Petri nets. The model had characteristics of graphic representation and easily analyzing the model properties and model performance. Two important modeling problems were discussed:different guard functions were placed in different transport transitions to implement route selection, and the input and output function of a single procedure transition was programmed to realize different processing time for different products. The bounded constraints were verified and the solution method to get the best makespan was proposed based on occurrence graphs. The effective method was shown by an applied instance.

     

  • loading
  • 加載中

Catalog

    通訊作者: 陳斌, bchen63@163.com
    • 1. 

      沈陽化工大學材料科學與工程學院 沈陽 110142

    1. 本站搜索
    2. 百度學術搜索
    3. 萬方數據庫搜索
    4. CNKI搜索
    Article views (140) PDF downloads(2) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    <th id="5nh9l"></th><strike id="5nh9l"></strike><th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th><strike id="5nh9l"></strike>
    <progress id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"><noframes id="5nh9l">
    <th id="5nh9l"></th> <strike id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>
    <progress id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span><strike id="5nh9l"><noframes id="5nh9l"><strike id="5nh9l"></strike>
    <span id="5nh9l"><noframes id="5nh9l">
    <span id="5nh9l"><noframes id="5nh9l">
    <span id="5nh9l"></span><span id="5nh9l"><video id="5nh9l"></video></span>
    <th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th>
    <progress id="5nh9l"><noframes id="5nh9l">
    259luxu-164