A Scheduling System to Achieve Just-In-Time Production and Minimum Changeover Counts in a Polymerization Plant

この論文にアクセスする

この論文をさがす

著者

抄録

The operation of a polymerization plant is usually scheduled by being divided into blocks: a production block, a store block, and so on, with the operations of each block usually scheduled by experts. The production block is scheduled to minimize production costs. However, it is difficult to manually schedule the store block, because of the following features. (1) The products must be treated as continuums. (2) The products are concurrently handled by two or more machines for long periods. (3) The capacities of product queues have an upper bound. (4) Operations are not necessarily started when they can be. (5) The store block constitutes a very large system.<BR>This paper proposes a scheduling system to concurrently achieve “Just-In-Time” (JIT) production in the store block and to minimize changeover counts in the production block. The proposed system calculates the latest finish times for receiving using a pull type algorithm to achieve JIT production. The latest finish times and all combinations of sequences of orders in the production block are examined by a push type scheduling algorithm under restriction conditions of features (2) and (3). To schedule a very large system, an algorithm based on the branch and bound technique is employed. The effectiveness of the proposed system is assessed via numerical studies.

収録刊行物

  • Journal of chemical engineering of Japan

    Journal of chemical engineering of Japan 37(9), 1135-1139, 2004-09-01

    公益社団法人 化学工学会

参考文献:  9件中 1-9件 を表示

各種コード

  • NII論文ID(NAID)
    10013576836
  • NII書誌ID(NCID)
    AA00709658
  • 本文言語コード
    ENG
  • 資料種別
    ART
  • ISSN
    00219592
  • NDL 記事登録ID
    7091388
  • NDL 雑誌分類
    ZP1(科学技術--化学・化学工業)
  • NDL 請求記号
    Z53-R395
  • データ提供元
    CJP書誌  NDL  J-STAGE 
ページトップへ