A scheduling system to achieve just-in-time production and minimum changeover counts in a polymerization plant

Kazuhiro Takeda, Akihito Tanaka, Yoshifumi Tsuge, Hisayoshi Matsuyama

Research output: Contribution to journalArticle

Abstract

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. 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.

Original languageEnglish
Pages (from-to)1135-1139
Number of pages5
JournalJOURNAL OF CHEMICAL ENGINEERING OF JAPAN
Volume37
Issue number9
DOIs
Publication statusPublished - Sep 1 2004

Fingerprint

Just in time production
Scheduling
Polymerization
Scheduling algorithms
Costs

All Science Journal Classification (ASJC) codes

  • Chemistry(all)
  • Chemical Engineering(all)

Cite this

A scheduling system to achieve just-in-time production and minimum changeover counts in a polymerization plant. / Takeda, Kazuhiro; Tanaka, Akihito; Tsuge, Yoshifumi; Matsuyama, Hisayoshi.

In: JOURNAL OF CHEMICAL ENGINEERING OF JAPAN, Vol. 37, No. 9, 01.09.2004, p. 1135-1139.

Research output: Contribution to journalArticle

@article{c8fafc2f31934593bb2f17cd3482f0a0,
title = "A scheduling system to achieve just-in-time production and minimum changeover counts in a polymerization plant",
abstract = "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. 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.",
author = "Kazuhiro Takeda and Akihito Tanaka and Yoshifumi Tsuge and Hisayoshi Matsuyama",
year = "2004",
month = "9",
day = "1",
doi = "10.1252/jcej.37.1135",
language = "English",
volume = "37",
pages = "1135--1139",
journal = "Journal of Chemical Engineering of Japan",
issn = "0021-9592",
publisher = "Society of Chemical Engineers, Japan",
number = "9",

}

TY - JOUR

T1 - A scheduling system to achieve just-in-time production and minimum changeover counts in a polymerization plant

AU - Takeda, Kazuhiro

AU - Tanaka, Akihito

AU - Tsuge, Yoshifumi

AU - Matsuyama, Hisayoshi

PY - 2004/9/1

Y1 - 2004/9/1

N2 - 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. 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.

AB - 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. 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.

UR - http://www.scopus.com/inward/record.url?scp=8744295826&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=8744295826&partnerID=8YFLogxK

U2 - 10.1252/jcej.37.1135

DO - 10.1252/jcej.37.1135

M3 - Article

AN - SCOPUS:8744295826

VL - 37

SP - 1135

EP - 1139

JO - Journal of Chemical Engineering of Japan

JF - Journal of Chemical Engineering of Japan

SN - 0021-9592

IS - 9

ER -