ICSEE 2012: Intelligent Computing for Sustainable Energy and Environment pp 322-332 | Cite as
Research on Zero-Wait Scheduling Problems in Multiproduct Processes with Due Dates
Abstract
Production scheduling is an important aspect of batch process operations to achieve high productivity and operability. In this paper, we considered a zero-wait multiproduct scheduling with due dates under uncertainty, where the total weighted earliness/tardiness penalty is to be minimized. The imprecise processing time is expressed with the triangle fuzzy variable and the model has been established based on fuzzy cut-set theory. A new improved shuffled frog-leaping algorithm (ISFLA) is introduced to search optimal objective for the given problem, which has a new updating rule in memeplexes. In order to enhance the ability to search the global optimum, the strategy of Forced Moving of the worst frog in each sub-memeplex is proposed to increase the diversity. Simulated results demonstrate that ISFLA has outperformed the conventional SFLA, which is effective and robust in solving the zero-wait scheduling with due-date window.
Keywords
zero-wait uncertainty SFLA forced movingPreview
Unable to display preview. Download preview PDF.
References
- 1.Mokeddem, D., Khellaf, A.: Multicriteria Optimization of Multiproduct Batch Chemical Process Using Genetic Algorithm. J. Food Process Eng. 33, 979–991 (2010)CrossRefGoogle Scholar
- 2.Kim, M., Jung, J.H., Lee, I.B.: Optimal Scheduling of Multiproduct Batch Processes for Various Intermediate Storage Policies. Ind. Eng. Chem. Res. 35, 4058–4066 (1996)CrossRefGoogle Scholar
- 3.Lee, D.S., Vassiliadis, V.S., Park, J.M.: List-based Threshold-accepting Algorithm for Zero-wait Scheduling of Multiproduct Batch Plants. Ind. Eng. Chem. Res. 41, 6579–6588 (2002)CrossRefGoogle Scholar
- 4.Papadimitriou, C.H., Kanellakis, P.C.: Flowshop Scheduling with Limited Temporary Storage. In: Proc. 16th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, pp. 214–223 (1978)Google Scholar
- 5.Ryu, J.H., Lee, H.K., Lee, I.B.: Optimal Scheduling for a Multiproduct Batch Process with Minimization of Penalty on Due Date Period. Ind. Eng. Chem. Res. 40, 228–233 (2001)CrossRefGoogle Scholar
- 6.Cafaro, D.C., Cerda, J.: Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates. Comput. Chem. Eng. 32, 728–753 (2008)CrossRefGoogle Scholar
- 7.Subbiaha, S., Tometzkia, T., Panekb, S., Engell, S.: Multi-product Batch Scheduling with Intermediate Due Dates Using Priced Timed Automata Models. Comput. Chem. Eng. 33, 1661–1676 (2009)CrossRefGoogle Scholar
- 8.Reddi, S.S., Ramamoorthy, C.V.: On the Flow-shop Sequencing Problem with No Wait In the Process. Opl. Res. Q. 23, 323–331 (1972)MATHCrossRefGoogle Scholar
- 9.Eusuff, M., Lansey, K., Pasha, F.: Shuffled Frog-leaping Algorithm: A Memetic Meta-heuristic for Discrete Optimization. Eng. Optim. 38, 129–154 (2006)MathSciNetCrossRefGoogle Scholar