×

On the integrated charge planning with flexible jobs in primary steelmaking processes. (English) Zbl 1197.90203

Summary: The integrated charge planning (ICP) problem based on flexible jobs in an integrated steel plant is extremely difficult and valuable. The purpose of this paper is to improve the efficiency and feasibility of planning by minimising the number of charges, minimising the total production costs and maximising the total throughput, considering the hard constraints and soft constraints. A multi-objective mathematical programming model for the problem is formulated, and it is shown that the problem is NP-hard. Two new meta-heuristics are designed, one is guided variable neighbourhood search (GVNS) combined with harmony search, and the other is GVNS combined with simulated annealing. Compared with enumeration algorithm, tabu search, variable neighbourhood search (VNS), harmony search, extend next fit decreasing (ENFD) and skewed VNS (SVNS), variable neighbourhood descent (VND), the numerical results by actual production data have shown that the proposed model and GVNHS are feasible and effective for ICP.

MSC:

90B35 Deterministic scheduling theory in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1287/opre.51.1.94.12791 · Zbl 1163.90448 · doi:10.1287/opre.51.1.94.12791
[2] Box RE, Interface 18 pp 42– (1988)
[3] Bridgman PW, Dimensional analysis (1922)
[4] DOI: 10.1016/j.ejor.2004.07.061 · Zbl 1087.90061 · doi:10.1016/j.ejor.2004.07.061
[5] DOI: 10.1080/095372800232090 · doi:10.1080/095372800232090
[6] DOI: 10.1016/S0377-2217(77)81007-2 · Zbl 0375.90079 · doi:10.1016/S0377-2217(77)81007-2
[7] DOI: 10.1287/mnsc.1.2.138 · Zbl 0995.90590 · doi:10.1287/mnsc.1.2.138
[8] DOI: 10.1080/00207540600988048 · Zbl 1153.90417 · doi:10.1080/00207540600988048
[9] DOI: 10.1002/1099-1425(200007/08)3:4<185::AID-JOS42>3.0.CO;2-G · Zbl 0962.90016 · doi:10.1002/1099-1425(200007/08)3:4<185::AID-JOS42>3.0.CO;2-G
[10] DOI: 10.1147/rd.513.0345 · Zbl 05420615 · doi:10.1147/rd.513.0345
[11] Garey MR, Computers and intractability: A guide to the theory of NP-completeness (1979) · Zbl 0411.68039
[12] DOI: 10.1007/978-3-540-77465-5_6 · doi:10.1007/978-3-540-77465-5_6
[13] DOI: 10.1177/003754970107600201 · doi:10.1177/003754970107600201
[14] Glover F, ORSA Journal on Computing 2 pp 4– (1991)
[15] DOI: 10.1023/A:1011336210885 · Zbl 1041.68623 · doi:10.1023/A:1011336210885
[16] DOI: 10.1126/science.220.4598.671 · Zbl 1225.90162 · doi:10.1126/science.220.4598.671
[17] DOI: 10.1016/0166-3615(92)90069-Y · doi:10.1016/0166-3615(92)90069-Y
[18] DOI: 10.1016/j.cor.2005.10.010 · Zbl 1141.90429 · doi:10.1016/j.cor.2005.10.010
[19] DOI: 10.1147/rd.402.0231 · doi:10.1147/rd.402.0231
[20] DOI: 10.1016/j.cie.2007.01.004 · doi:10.1016/j.cie.2007.01.004
[21] DOI: 10.1016/j.ijpe.2004.10.002 · doi:10.1016/j.ijpe.2004.10.002
[22] DOI: 10.1016/S0377-2217(97)00277-4 · Zbl 0991.90060 · doi:10.1016/S0377-2217(97)00277-4
[23] DOI: 10.1007/s00158-003-0368-6 · Zbl 1243.90199 · doi:10.1007/s00158-003-0368-6
[24] DOI: 10.1016/S0305-0548(97)00031-2 · Zbl 0889.90119 · doi:10.1016/S0305-0548(97)00031-2
[25] DOI: 10.1016/S0377-2217(00)00100-4 · Zbl 0981.90063 · doi:10.1016/S0377-2217(00)00100-4
[26] DOI: 10.1016/S0377-2217(02)00831-7 · Zbl 1053.90056 · doi:10.1016/S0377-2217(02)00831-7
[27] DOI: 10.1016/j.amc.2007.09.004 · Zbl 1146.90091 · doi:10.1016/j.amc.2007.09.004
[28] DOI: 10.1287/opre.25.1.45 · Zbl 0369.90054 · doi:10.1287/opre.25.1.45
[29] DOI: 10.1016/j.omega.2007.11.002 · doi:10.1016/j.omega.2007.11.002
[30] DOI: 10.1016/S0377-2217(00)00240-X · Zbl 0988.90503 · doi:10.1016/S0377-2217(00)00240-X
[31] DOI: 10.1016/S0377-2217(99)00041-7 · Zbl 0955.90035 · doi:10.1016/S0377-2217(99)00041-7
[32] DOI: 10.1080/00207540110073000 · Zbl 1175.90150 · doi:10.1080/00207540110073000
[33] Xing WX, IIE Transactions 34 pp 991– (2002)
[34] DOI: 10.1007/BF00934871 · Zbl 0362.90111 · doi:10.1007/BF00934871
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.