A mixed integer programming model and improved genetic algorithm for order planning of iron-steel plants

International Journal of Information and Management Sciences

Volumn 19, Issue 3, 2008, Pages 413-435

  Zhang, Tao ^a   Zhang, Yue Jie ^b   Liu, Shi Xin ^c,d  

^a SHANGHAI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b FUDAN UNIVERSITY   (China)

^c NORTHEASTERN UNIVERSITY   (China)

^d NORTHEASTERN UNIVERSITY   (China)

Author keywords

3 mutation operator; Flexible Flow Shop (FFS).; Genetic Algorithm (GA); Mixed integer programming; Order Planning (OP)

Indexed keywords

ALGORITHMS; ANIMAL CELL CULTURE; GENETIC ALGORITHMS; INTEGER PROGRAMMING; IRON; MATHEMATICAL PROGRAMMING; NUMERICAL ANALYSIS; STEEL; STEEL METALLURGY; STEEL TESTING; STEELMAKING;

3-MUTATION OPERATOR; FLEXIBLE FLOW SHOP (FFS).; GENETIC ALGORITHM (GA); IMPROVED GENETIC ALGORITHM; MACHINE SYSTEMS; MIXED INTEGER PROGRAMMING; MIXED INTEGER PROGRAMMING MODEL; MIXED INTEGERS; ORDER PLANNING; ORDER PLANNING (OP); PRODUCTION PROCESSES; STEEL PLANT;

IRON AND STEEL PLANTS;

EID: 52649111727     PISSN: 10171819     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. Redwine, C. N. and Wismer, D. A., A mixed integer programming model for scheduling orders in a steel mill, Journal of Optimization Theory and Applications, Vol. 14, No. 3, pp.305-318, 1974.
2. Teng, X., The production structure model of the hot-milling set, the order distribution model and the optimum analysis of the steel tube plant, System Engineering theory and practice, No. 2, pp.40-48, 1985. (in Chinese)
3. Salvador, M. S., A solution to a special class of flow shop scheduling problem, Proceedings of Symposium of the Theory of Scheduling and Applications, Springer-Verlag, Berlin, pp.83-91, 1973.
4. Hunsucker, J. and Shah, J., Performance of priority rules in a due date flow shop, OMEGA, Int. J. Of Mgmt. Sci, Vol. 20, No. 1, 73-89, 1992.
5. Chang, S. C. and Liao D. Y., Scheduling flexible flow shops with no set-up effects, IEEE Transactions on Robotics and Automation, Vol. 10, No. 2, pp.112-122, 1994.
6. Lee, I., Sikora, R. and Michael, J. S., A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes, IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics., Vol. 27, No. 1, pp.36-54, 1997.
7. Linn, R. and Zhang, W., Hybrid flow shop scheduling: a survey, Computers and Industrial Engineering, Vol. 37, pp.57-61, 1999.
8. 4Sriskandarajah, C. and Sethi, S. P., Scheduling algorithms for flexible flowshops: Worst and average case performance, European Journal of Operational Research, Vol. 43, pp.143-160, 1989.
9. Wittrock, R. J., An adaptable scheduling algorithm for flexible flow lines, Operations Research, Vol. 36, pp.445-453, 1985.
10. Kochhar, S. and Morris, R. J. T., Heuristic methods for flexible flow line scheduling, Journal of Manufacturing Systems, Vol. 6, No. 4, pp.299-314, 1987.
11. Brah, S. A. and Hunsucker, J. L., Branch and bound algorithm for a flowshop with multiple processors, European Journal of Operational Research, Vol. 51, pp.88-99, 1991.