Scheduling a Continuous Casting Batch Machine with Flexible Jobs to Minimize Setup Costs

Abstract:

The continuous casting batch machine scheduling with flexible jobs is proposed based on its character. The original problem is firstly preprocessed based on rule, and then the optimization model with minimizing setup costs is proposed. To improve the efficiency of local search, the Particle Swarm Optimization (PSO) is introduced, and then the PSO and heuristic strategy are embedded into the Iterated Local Search (ILS) to solve the problem. The solution space is divided into many subspaces based on the charge information, and then the subspaces are integrated after local search. The maximum number of iteration is introduced as stopping condition. Then, the proposed algorithm and ILS are compared, and the changing of learning factors, number of generation, and the maximum number of iteration are also tested respectively. Finally, the simulation results show that the proposed algorithm can solve the problem efficiently.

• Periodical: Applied Mechanics and Materials (Volumes 182-183)
• Pages: 406-410
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.182-183.406
• Online since: June 2012
• Authors: Hong Yu Dong
• Keywords: Batch Scheduling, Continuous Casting Machine, Flexible Jobs, Iterated Local Search, Particle Swarm Optimization Algorithm (PSO)

References

[1] Balakrishinan, A. and Geumes J. Production planning with flexible product specifications: An application to specialty steel manufacturing [J]. Operations Research, 2003, 51(1), 94-112.

DOI: 10.1287/opre.51.1.94.12791

[2] Box R.E. and Herbe D.G. A scheduling model for LTV steel's Cleveland works' twin strand continuous slab caster [J]. Interfaces, 1988, 18(1): 42-56.

DOI: 10.1287/inte.18.1.42

[3] Shi Y. and Eberhart R. C. A modified particle swarm optimizer [A]. Proceeding of IEEE World Congress on Computational Intelligence[C]. New York, NY, USA: IEEE, 1998. 69-73.

DOI: 10.1109/icec.1998.699146

[4] Lourenco H. R., Martin O, Stutzle T. Iterated local search [M]. Glover F, Kochenberger G. Handbook of Metaheuristics. Boston: Kluwer Academic Publishers, (2003).

[5] Stutzle T. Iterated local search for the quadratic assignment problem [J]. European Journal of Operational Research, 2006, 174(3): 1519-1539.

DOI: 10.1016/j.ejor.2005.01.066

[6] Panwalkar S S, Iskander W. A Survey of Scheduling Rules [J]. Operations Research, 1977, 25(1): 45-61.

DOI: 10.1287/opre.25.1.45

[7] Dong, H.Y., et al. On the integrated charge planning with flexible jobs in primary steelmaking processes [J]. International Journal of Production Research, 2010, 48(21), 6499-6535.

DOI: 10.1080/00207540903246656

[8] Dong H. Y., et al. Improved variable neighborhood search for integrated tundish planning in primary steelmaking processes [J]. Submitted to International Journal of Production Research (2011).

[9] Graham R.L., Lawler E.L., Lenstra J.K., et al. Optimization and approximation in deterministic sequencing and scheduling: a survey [J]. Annals of Discrete Math., 1979, 5: 287-326.

DOI: 10.1016/s0167-5060(08)70356-x

[10] Huang M., and Dong, H.Y., et al., Integrative simulation system of production planning of steel making, continuous casting and hot rolling [P]. C.N. Patent 200, 910, 012, 258. 2 (2009).