Documents disponibles écrits par cet auteur

More on completion time algorithms for intermediate storage tanks in multiproduct batch process scheduling using matrix representation / Amir Shafeeq ; M. I. Abdul Mutalib ; K. A. Amminudin in Industrial & engineering chemistry research, Vol. 47 n°24 (Décembre 2008) 

Public ISBD [article]  in Industrial & engineering chemistry research > Vol. 47 n°24 (Décembre 2008) . - p. 9957–9970 Titre : More on completion time algorithms for intermediate storage tanks in multiproduct batch process scheduling using matrix representation Type de document : texte imprimé Auteurs : Amir Shafeeq, Auteur ; M. I. Abdul Mutalib, Auteur ; K. A. Amminudin, Auteur Année de publication : 2009 Article en page(s) : p. 9957–9970 Note générale : Industrial chemistry Langues : Anglais (eng) Mots-clés : Algorithms  for  Intermediate  Storage Résumé : In batch process scheduling, the introduction of intermediate storage tanks between process stages result in increasing the efficiency and productivity of the process. The main purpose of this is to minimize the process completion time, i.e. makespan. However, it is important to determine the right number and respective locations of the intermediate storage to ensure optimal investment and operational cost. The generally adopted transfer policies for handling intermediate storage tanks in batch processes are unlimited intermediate storage (UIS) and finite intermediate storage (FIS). In this work, new completion time algorithms for UIS and FIS transfer policies are proposed using matrix representation. The objective of the proposed approach is to calculate the makespan for all possible production sequences for given batch product recipes while at the same time determining the number and location of intermediate storage tanks required. With the assumptions that the intermediate storage could be used to store any intermediate product, the method is verified against the Gantt chart method and the results agreed well. A number of different product recipes are analyzed using a developed computer code. This enables the proposed algorithms to produce solution options for large size batch scheduling problems. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie800068j [article] More on completion time algorithms for intermediate storage tanks in multiproduct batch process scheduling using matrix representation [texte imprimé] / Amir Shafeeq, Auteur ; M. I. Abdul Mutalib, Auteur ; K. A. Amminudin, Auteur . - 2009 . - p. 9957–9970. Industrial chemistry Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 47 n°24 (Décembre 2008) . - p. 9957–9970 Mots-clés : Algorithms  for  Intermediate  Storage Résumé : In batch process scheduling, the introduction of intermediate storage tanks between process stages result in increasing the efficiency and productivity of the process. The main purpose of this is to minimize the process completion time, i.e. makespan. However, it is important to determine the right number and respective locations of the intermediate storage to ensure optimal investment and operational cost. The generally adopted transfer policies for handling intermediate storage tanks in batch processes are unlimited intermediate storage (UIS) and finite intermediate storage (FIS). In this work, new completion time algorithms for UIS and FIS transfer policies are proposed using matrix representation. The objective of the proposed approach is to calculate the makespan for all possible production sequences for given batch product recipes while at the same time determining the number and location of intermediate storage tanks required. With the assumptions that the intermediate storage could be used to store any intermediate product, the method is verified against the Gantt chart method and the results agreed well. A number of different product recipes are analyzed using a developed computer code. This enables the proposed algorithms to produce solution options for large size batch scheduling problems. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie800068j