Optimal Production Scheduling for the Polyamide Fiber Plant Using Simulated Annealing

Article Preview

Abstract:

This paper addresses the problem of optimizing production schedules of multiproduct continuous manufacturing facilities where a wide range of products are produced in small quantities, resulting in frequent changeovers. A real-world scheduling problem from the polyamide fiber plant is investigated. The problem involves a sequencing of products. The problem is formulated as a mixed-integer linear programming (MILP) model. The mathematical model has a linear objective function to be maximized. A simulated annealing (SA) algorithm is proposed for this scheduling problem. The computational results show that a satisfactory solution can be obtained in reasonable computation time. Case study demonstrates the effectiveness and the applicability of the model and the proposed methods.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1079-1082

Citation:

Online since:

June 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] C.A. Floudas and X. Lin: Continuous-time vs. discrete-time approaches for scheduling of chemical processes: a review. Computers and Chemical Engineering Vol. 28, (2004) pp.2109-2129.

DOI: 10.1016/j.compchemeng.2004.05.002

Google Scholar

[2] M.A. Shaik, S.L. Janak and C.A. Floudas: Continuous-time models for short-term scheduling of multipurpose batch plants: A comparative study. Industrial and Engineering Chemistry Research Vol. 45, (2006) pp.6190-6209.

DOI: 10.1021/ie0601403

Google Scholar

[3] A. Alle and J.M. Pinto: Mixed-Integer Programming Models for the Scheduling and Operational Optimization of Multiproduct Continuous Plants, Ind. Eng. Chem. Res. Vol. 41, (2002), pp.2689-2704.

DOI: 10.1021/ie0106480

Google Scholar

[4] A Alle, L G. Papageorgiou and J M. Pinto: A mathematical programming approach for cyclic production and cleaning scheduling of multistage continuous plants, Computers and Chemical Engineering Vol. 28, (2004), pp.3-15.

DOI: 10.1016/s0098-1354(03)00171-6

Google Scholar

[5] D.J. ram, H. Sreenivas and K.G. Subramaniam: Parallel Simulated Annealing Algorithms, journal of parallel and distributed computing Vol. 37, (1996), 207-212.

DOI: 10.1006/jpdc.1996.0121

Google Scholar

[6] R.W. Eglese: Simulated annealing: a tool for operational research, European Journal of Operational Research Vol. 46 (1990), pp.271-281.

DOI: 10.1016/0377-2217(90)90001-r

Google Scholar

[7] S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi: Optimization by simulated annealing, Science Vol. 220 (1983), pp.671-680.

DOI: 10.1126/science.220.4598.671

Google Scholar