Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times

Hak Jung Jae, In Beum Lee, Dae Ryook Yang, Soo Chang Kun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Simple recurrence relations for calculating completion times of various storage polices (unlimited intermediate storages(UIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW)) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had already been developed as a mixed integer linear programming (MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming (MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computational times.

Original languageEnglish
Title of host publicationInstitution of Chemical Engineers Symposium Series
Place of PublicationRugby, United Kingdom
PublisherPubl by Inst of Chemical Engineers
Pages79-86
Number of pages8
Edition133
ISBN (Print)0852953216
Publication statusPublished - 1994 Jan 1
Externally publishedYes
EventProceedings of the 4th European Symposium on Computer Aided Process Engineering - Dublin, Ireland
Duration: 1994 Mar 281994 Mar 30

Other

OtherProceedings of the 4th European Symposium on Computer Aided Process Engineering
CityDublin, Ireland
Period94/3/2894/3/30

Fingerprint

Law enforcement
Scheduling
Nonlinear programming
Linear programming
Chemical reactions
Processing

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Engineering(all)

Cite this

Jae, H. J., Lee, I. B., Yang, D. R., & Kun, S. C. (1994). Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times. In Institution of Chemical Engineers Symposium Series (133 ed., pp. 79-86). Rugby, United Kingdom: Publ by Inst of Chemical Engineers.

Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times. / Jae, Hak Jung; Lee, In Beum; Yang, Dae Ryook; Kun, Soo Chang.

Institution of Chemical Engineers Symposium Series. 133. ed. Rugby, United Kingdom : Publ by Inst of Chemical Engineers, 1994. p. 79-86.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jae, HJ, Lee, IB, Yang, DR & Kun, SC 1994, Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times. in Institution of Chemical Engineers Symposium Series. 133 edn, Publ by Inst of Chemical Engineers, Rugby, United Kingdom, pp. 79-86, Proceedings of the 4th European Symposium on Computer Aided Process Engineering, Dublin, Ireland, 94/3/28.
Jae HJ, Lee IB, Yang DR, Kun SC. Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times. In Institution of Chemical Engineers Symposium Series. 133 ed. Rugby, United Kingdom: Publ by Inst of Chemical Engineers. 1994. p. 79-86
Jae, Hak Jung ; Lee, In Beum ; Yang, Dae Ryook ; Kun, Soo Chang. / Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times. Institution of Chemical Engineers Symposium Series. 133. ed. Rugby, United Kingdom : Publ by Inst of Chemical Engineers, 1994. pp. 79-86
@inproceedings{ce685963386e4513aa15fe108d61dac1,
title = "Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times",
abstract = "Simple recurrence relations for calculating completion times of various storage polices (unlimited intermediate storages(UIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW)) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had already been developed as a mixed integer linear programming (MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming (MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computational times.",
author = "Jae, {Hak Jung} and Lee, {In Beum} and Yang, {Dae Ryook} and Kun, {Soo Chang}",
year = "1994",
month = "1",
day = "1",
language = "English",
isbn = "0852953216",
pages = "79--86",
booktitle = "Institution of Chemical Engineers Symposium Series",
publisher = "Publ by Inst of Chemical Engineers",
edition = "133",

}

TY - GEN

T1 - Optimal scheduling for serial multi-product batch process with various storage policies under consideration of non-zero transfer times and set-up times

AU - Jae, Hak Jung

AU - Lee, In Beum

AU - Yang, Dae Ryook

AU - Kun, Soo Chang

PY - 1994/1/1

Y1 - 1994/1/1

N2 - Simple recurrence relations for calculating completion times of various storage polices (unlimited intermediate storages(UIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW)) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had already been developed as a mixed integer linear programming (MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming (MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computational times.

AB - Simple recurrence relations for calculating completion times of various storage polices (unlimited intermediate storages(UIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW)) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had already been developed as a mixed integer linear programming (MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming (MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computational times.

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

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

M3 - Conference contribution

SN - 0852953216

SP - 79

EP - 86

BT - Institution of Chemical Engineers Symposium Series

PB - Publ by Inst of Chemical Engineers

CY - Rugby, United Kingdom

ER -