Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 979238, 7 pages
http://dx.doi.org/10.1155/2014/979238
Research Article

Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates

1Software College, Northeastern University, Shenyang 110819, China
2School of Business Administration, Northeastern University, Shenyang 110819, China

Received 31 August 2013; Accepted 30 October 2013; Published 9 February 2014

Academic Editors: P. A. D. Castro, B. Liu, X.-l. Luo, and Y. Shi

Copyright © 2014 Tao Ren 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. 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 Google Scholar · View at Scopus
  2. 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
  3. H. Röck, “Some new results in flow shop scheduling,” Zeitschrift für Operations Research, vol. 28, pp. 1–16, 1984. View at Google Scholar
  4. J.-B. Wang, F. Shan, B. Jiang, and L.-Y. Wang, “Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time,” Applied Mathematics and Computation, vol. 182, pp. 947–954, 2006. View at Google Scholar
  5. L.-H. Su and Y.-Y. Lee, “The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time,” Computers and Operations Research, vol. 35, no. 9, pp. 2952–2963, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. R.-H. Huang, C.-L. Yang, and Y.-C. Huang, “No-wait two-stage multiprocessor flow shop scheduling with unit setup,” International Journal of Advanced Manufacturing Technology, vol. 44, no. 9-10, pp. 921–927, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. J. M. Framinan, M. S. Nagano, and J. V. Moccellin, “An efficient heuristic for total flowtime minimisation in no-wait flowshops,” International Journal of Advanced Manufacturing Technology, vol. 46, no. 9–12, pp. 1049–1057, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. X. Zhao and J. Tang, “No-wait flow shop scheduling based on artificial immune system,” in Proceedings of the IEEE International Conference on Advanced Computer Control (ICACC '10), pp. 436–440, March 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. B. Qian, H. B. Zhou, R. Hu, and F. H. Xiang, “Hybrid differential evolution optimization for no-wait flow-shop scheduling with sequence-dependent setup times and release dates,” in Advanced Intelligent Computing, vol. 6838 of Lecture Notes in Computer Science, pp. 600–611, 2011. View at Google Scholar
  10. H. Liu, M. Queyranne, and D. Simchi-Levi, “On the asymptotic optimality of algorithms for the flow shop problem with release dates,” Naval Research Logistics, vol. 52, no. 3, pp. 232–242, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Kaminsky and D. Simchi-Levi, “Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates,” Operations Research Letters, vol. 29, pp. 141–148, 2001. View at Google Scholar
  12. C. H. Xia, J. G. Shanthikumar, and P. W. Glynn, “On the asymptotic optimality of the SPT rule for the flow shop average completion time problem,” Operations Research, vol. 48, no. 4, pp. 615–622, 2000. View at Google Scholar · View at Scopus
  13. D. Bai and T. Ren, “New approximation algorithms for flow shop total completion time problem,” Engineering Optimization, vol. 45, pp. 1091–1105, 2013. View at Google Scholar