Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 498282, 5 pages
http://dx.doi.org/10.1155/2013/498282
Research Article

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

1School of Information Science and Engineering, Northeastern University, Shenyang 110819, China
2Shenyang Control Center of Petro-China Pipeline Company, Shenyang 110031, China
3Software College, Northeastern University, Shenyang 110819, China

Received 8 October 2013; Revised 14 December 2013; Accepted 20 December 2013

Academic Editor: Yuri Sotskov

Copyright © 2013 Huawei Yuan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. 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. View at Google Scholar · View at Scopus
  2. 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. View at Publisher · View at Google Scholar · View at Scopus
  3. 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. View at Publisher · View at Google Scholar · View at Scopus
  4. H. Röck, “Some new results in flow shop scheduling,” Zeitschrift für Operations Research A, vol. 28, no. 1, pp. 1–16, 1984. View at Publisher · View at Google Scholar · View at MathSciNet
  5. 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. View at Google Scholar · View at Scopus
  6. 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. View at Google Scholar
  7. 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. View at Publisher · View at Google Scholar · View at Scopus
  8. 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. View at Google Scholar
  9. 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. View at Publisher · View at Google Scholar
  10. 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. 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. View at Google Scholar