CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Optimal Scheduling of Flowshop Batch Process for Zero-Wait and No Intermediate Storage Transfer Policy

by H. Abdel Samad, H. Moselhy, S. Aly, M. E. Awad
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 95 - Number 9
Year of Publication: 2014
Authors: H. Abdel Samad, H. Moselhy, S. Aly, M. E. Awad
10.5120/16622-6474

H. Abdel Samad, H. Moselhy, S. Aly, M. E. Awad . Optimal Scheduling of Flowshop Batch Process for Zero-Wait and No Intermediate Storage Transfer Policy. International Journal of Computer Applications. 95, 9 ( June 2014), 18-24. DOI=10.5120/16622-6474

@article{ 10.5120/16622-6474,
author = { H. Abdel Samad, H. Moselhy, S. Aly, M. E. Awad },
title = { Optimal Scheduling of Flowshop Batch Process for Zero-Wait and No Intermediate Storage Transfer Policy },
journal = { International Journal of Computer Applications },
issue_date = { June 2014 },
volume = { 95 },
number = { 9 },
month = { June },
year = { 2014 },
issn = { 0975-8887 },
pages = { 18-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume95/number9/16622-6474/ },
doi = { 10.5120/16622-6474 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:19:00.340301+05:30
%A H. Abdel Samad
%A H. Moselhy
%A S. Aly
%A M. E. Awad
%T Optimal Scheduling of Flowshop Batch Process for Zero-Wait and No Intermediate Storage Transfer Policy
%J International Journal of Computer Applications
%@ 0975-8887
%V 95
%N 9
%P 18-24
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The scheduling zero-wait (ZW) and no intermediate storage transfer (NIS) policy of multi-product batch processes in order to produce a number of low volume high value-added chemical products because of its economic impact. It involves various parameters such as makespan (completion time) which is recognized as one of the important design parameter as it helps to decide for the best scheduling design and normally used as the main parameter for selecting the optimal production sequence which involves various parameters such as batch process recipes, sequence of production and transfer policy for product intermediates. In this paper, we present a development, solution and computational performance evaluation of optimal scheduling for multiproduct batch process with two commonly used transfer policies namely zero wait (ZW) and no intermediate storage (NIS) by using computer program language software (Java) which simplify and improve the determination of Makespan and select the optimum sequence due to the minimum Makespan.

References
  1. Biegler, L. T. , Grossmann, I. E. and Westberg, A. W. , (1997). Systematic Methods of Chemical Process Design. (Prentice-Hall).
  2. Birewar, D. B. and Grossmann, I. E. , 1989, "Efficient optimization algorithms for zero-wait scheduling of multiproduct batch plants". Ind Eng Chem Res, 28(9): 1333–1345.
  3. Burkard, R. E. , Fortuna, T. C. and Hurkens, A. J. , 2002, "Makespan minimization for chemical batch processes using non-uniform time grids". Comput Chem Eng, 26(9): 1321–1332.
  4. Das, H. , Cummings, P. T. and Le Van, M. D. , 1990, "Scheduling of serial multiproduct batch processes via simulated annealing". Comput Chem Eng, 14(12): 1351–1362.
  5. Dupont, L. and Dhaenens-Flipo, C. , 2002," Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure". Comp Oper Res, 29: 807–819.
  6. Edgar, T. F. , Himmelblau, D. M. and Lasdon, L. S. , (2001). Optimization of Chemical Processes (2nd edition). (McGraw Hill).
  7. Grossmann, I. and Morari, M. , Morari, M. (eds). (CACHE Corporation, Austin, TX)
  8. Jung, J. , Lee, H. , Yang, D. and Lee, I. , 1994, "Completion times and optimal scheduling for serial multi-product processes with transfer and set-up times in zero-wait policy". Comput Chem Eng, 18(6): 537–544.
  9. Jun-Hyung Ryu and Efstratios N. Pistikopoulos (2007) "A novel approach to scheduling of zero wait batch processes under processing time variations". Computers and Chemical Engineering, 31: 101–106.
  10. Kim, M. , Jung, J. H. and Lee, I. B. , 1996, "Optimal scheduling of multiproduct batch processes for various intermediate storage policies". Ind Eng Chem Res, 35(11): 4058–4066.
  11. Ku, H. M. and Karimi, I. A. , 1988," Scheduling in serial multiproduct batch processes with finite interstage storage: a mixed integer linear program formulation". Ind Eng Chem Res, 27(10):1840–1848.
  12. Ku, H. M. and Karimi, I. A. , 1990, "Completion time algorithms for serial multiproduct batch processes with shared storage". Comput Chem Eng, 14(1): 49–69.
  13. Ku, H. M. and Karimi, I. A. , 1992, Multiproduct batch plant scheduling, in CACHE Process Design Case Studies,
  14. L. Dupont and C. Dhaenens-Flipo (2002) "Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure". Computers and Operations Research, 29: 807–819.
  15. Lee, D. S. , Vassiliadis Vassilios, S. and Park, J. M. , 2002, "List-based threshold-accepting algorithm for zero-wait scheduling of multiproduct batch plants". Ind Eng Chem Res, 41(25): 6579–6588.
  16. Ming-Gang Dong and Ning Wang (2012), "A novel hybrid differential evolution approach to scheduling of large scale zero wait batch process with setup times". Comput Chem Eng, 45:72-83.
  17. Moon, S. , Park, S. and Lee, W. K. , 1996, "New MILP models for scheduling of multiproduct batch plants under zero-wait policy". Ind Eng Chem Res, 35(10): 3458–3469.
Index Terms

Computer Science
Information Sciences

Keywords

Scheduling Batch processes Makespan Production Sequence Zero Wait No Intermediate Storage.

Powered by PhDFocusTM