Cover Image

New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix

Scheduling of batch processes involves various parameters such as batch process recipes, sequence of production and transfer policy for product intermediates. All these parameters directly or indirectly affect the makespan, i.e. completion time of a batch process. The scheduling approaches reported...

Full description

Saved in:
Bibliographic Details
Main Authors: Shafeeq , A., M.I., Abdul Mutalib, Amminudin , K.A., Muhammad , A.
Format: Article
Published: 2008
Subjects:
TP Chemical technology
Online Access:http://eprints.utp.edu.my/539/1/paper.pdf
http://eprints.utp.edu.my/539/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utp.eprints.539
record_format eprints
spelling my.utp.eprints.5392017-01-19T08:26:44Z New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix Shafeeq , A. M.I., Abdul Mutalib Amminudin , K.A. Muhammad , A. TP Chemical technology Scheduling of batch processes involves various parameters such as batch process recipes, sequence of production and transfer policy for product intermediates. All these parameters directly or indirectly affect the makespan, i.e. completion time of a batch process. The scheduling approaches reported in past literatures mostly refer to the use of complex mathematical models for determining makespan. These models require good understanding in formulating the problem using programming techniques to find the optimal solution. The current work proposes new completion time algorithms for multiproduct batch process with two commonly used transfer policies namely zero wait (ZW) and no intermediate storage (NIS). The batch process recipes are presented in the form of a matrix which is then used to solve for the completion time using developed algorithms. Rearrangement of the matrix rows reflects the changes in production sequences possible for the specified batch process recipes which then enable the makespan to be determined accordingly for the different sequences. Designer is then provided with the production sequence options with their corresponding makespan from which a selection could be made. © 2008 The Institution of Chemical Engineers. 2008 Article PeerReviewed application/pdf http://eprints.utp.edu.my/539/1/paper.pdf Shafeeq , A. and M.I., Abdul Mutalib and Amminudin , K.A. and Muhammad , A. (2008) New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix. Chemical Engineering Research and Design , 86 (10). pp. 1167-1181. ISSN 2638762 http://eprints.utp.edu.my/539/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
topic TP Chemical technology
spellingShingle TP Chemical technology
Shafeeq , A.
M.I., Abdul Mutalib
Amminudin , K.A.
Muhammad , A.
New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix
description Scheduling of batch processes involves various parameters such as batch process recipes, sequence of production and transfer policy for product intermediates. All these parameters directly or indirectly affect the makespan, i.e. completion time of a batch process. The scheduling approaches reported in past literatures mostly refer to the use of complex mathematical models for determining makespan. These models require good understanding in formulating the problem using programming techniques to find the optimal solution. The current work proposes new completion time algorithms for multiproduct batch process with two commonly used transfer policies namely zero wait (ZW) and no intermediate storage (NIS). The batch process recipes are presented in the form of a matrix which is then used to solve for the completion time using developed algorithms. Rearrangement of the matrix rows reflects the changes in production sequences possible for the specified batch process recipes which then enable the makespan to be determined accordingly for the different sequences. Designer is then provided with the production sequence options with their corresponding makespan from which a selection could be made. © 2008 The Institution of Chemical Engineers.
format Article
author Shafeeq , A.
M.I., Abdul Mutalib
Amminudin , K.A.
Muhammad , A.
author_facet Shafeeq , A.
M.I., Abdul Mutalib
Amminudin , K.A.
Muhammad , A.
author_sort Shafeeq , A.
title New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix
title_short New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix
title_full New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix
title_fullStr New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix
title_full_unstemmed New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix
title_sort new completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix
publishDate 2008
url http://eprints.utp.edu.my/539/1/paper.pdf
http://eprints.utp.edu.my/539/
_version_ 1738655075829547008
score 13.211869

Similar Items