Journal of Applied Mathematics

Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production

Huawei Yuan, Yuanwei Jing, Jinping Huang, and Tao Ren

Full-text: Open access

Abstract

This paper considers the m-machine flow shop scheduling problem with the no-wait constraint to minimize total completion time which is the typical model in steel production. First, the asymptotic optimality of the Shortest Processing Time (SPT) first rule is proven for this problem. To further evaluate the performance of the algorithm, a new lower bound with performance guarantee is designed. At the end of the paper, numerical simulations show the effectiveness of the proposed algorithm and lower bound.

Article information

Source
J. Appl. Math., Volume 2013 (2013), Article ID 498282, 5 pages.

Dates
First available in Project Euclid: 14 March 2014

Permanent link to this document
https://projecteuclid.org/euclid.jam/1394808339

Digital Object Identifier
doi:10.1155/2013/498282

Mathematical Reviews number (MathSciNet)
MR3147907

Zentralblatt MATH identifier
06950709

Citation

Yuan, Huawei; Jing, Yuanwei; Huang, Jinping; Ren, Tao. Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production. J. Appl. Math. 2013 (2013), Article ID 498282, 5 pages. doi:10.1155/2013/498282. https://projecteuclid.org/euclid.jam/1394808339


Export citation

References

  • Y. N. Sotskov, T. Tautenhahn, and F. Werner, “Heuristics for permutation flow shop scheduling with batch setup times,” OR Spectrum, vol. 18, no. 2, pp. 67–80, 1996.
  • Y. N. Sotskov, A. Allahverdi, and T.-C. Lai, “Flowshop scheduling problem to minimize total completion time with random and bounded processing times,” Journal of the Operational Research Society, vol. 55, no. 3, pp. 277–286, 2004.
  • R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979.
  • H. Röck, “Some new results in flow shop scheduling,” Zeitschrift für Operations Research A, vol. 28, no. 1, pp. 1–16, 1984.
  • A. Allahverdi and T. Aldowaisan, “Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times,” Journal of the Operational Research Society, vol. 52, no. 4, pp. 449–462, 2001.
  • A. Allahverdi and T. Aldowaisan, “No-wait and separate setup three-machine flowshop with total completion time criterion,” International Transactions in Operational Research, vol. 7, pp. 245–264, 2000.
  • T. Aldowaisan and A. Allahverdi, “New heuristics for m-machine no-wait flowshop to minimize total completion time,” Omega, vol. 32, no. 5, pp. 345–352, 2004.
  • K. Gao, Q. Pan, P. N. Suganthan, and J. Li, “Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization,” The International Journal of Advanced Manufacturing Technology, 66, pp. 1563–1572, 2013.
  • A. Allahverdi and H. Aydilek, “Algorithms for no-wait flowshops with total completion time subject to makespan,” The International Journal of Advanced Manufacturing Technology, vol. 68, no. 9, pp. 2237–2251, 2013.
  • N. G. Hall and C. Sriskandarajah, “A survey of machine scheduling problems with blocking and no-wait in process,” Operations Research, vol. 44, no. 3, pp. 510–525, 1996.
  • D. Bai and T. Ren, “New approximation algorithms for flow shop total completion time problem,” Engineering Optimization, vol. 45, no. 9, pp. 1091–1105, 2013. \endinput