By Topic

Timed Petri-net representation for short term scheduling of multiproduct batch plants

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tianlong Gu ; Sch. of Comput. Eng., Guilin Inst. of Electron. Technol., China ; Bahri, P.A.

Scheduling is one of the interesting research fields in batch chemical industries, which substantially differs from that in discrete manufacturing systems. One of the main differences between these two fields is the intermediate storage of materials, which appears in chemical processes. This situation prevents the direct applicability of some of the scheduling techniques (such as Petri nets) used for discrete manufacturing systems, in batch chemical plants. In this paper, a timed Petri nets-based formulation for scheduling of multiproduct batch chemical plants with unlimited intermediate storage policy is presented. To find the best schedule, a modified branch-and-bound and timed-place Petri net execution (MBBTE) solution algorithm is proposed, which will be examined through an illustrative example

Published in:

American Control Conference, 1999. Proceedings of the 1999  (Volume:6 )

Date of Conference:

1999