Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 546810, 6 pages
http://dx.doi.org/10.1155/2013/546810
Research Article

A Branch-and-Bound Algorithm for Minimizing the Energy Consumption in the PFS Problem

1School of Management, Guangdong University of Technology, Longdong Campus 161 Yinglong Road , Guangzhou 510520, China
2Department of Mechatronics Engineering, Guangdong University of Technology, 100 Waihuan Xi Road, Higher Education Mega Center, Guangzhou 510006, China
3Department of Industrial and Manufacturing Systems Engineering, The University of Hong Kong, Pokfulam, Hong Kong

Received 22 November 2012; Accepted 24 January 2013

Academic Editor: Wei-Chiang Hong

Copyright © 2013 Guo-Sheng Liu 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. “Statistical review of world energy,” Tech. Rep., BP corporation, 2012.
  2. “International energy outlook 2009: World energy and economic outlook,” Tech. Rep., U.S. Energy Information Administration, 2009.
  3. E. A. Abdelaziz, R. Saidur, and S. Mekhilef, “A review on energy saving strategies in industrial sector,” Renewable and Sustainable Energy Reviews, vol. 15, no. 1, pp. 150–168, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, 2nd edition, 2000. View at Zentralblatt MATH · View at MathSciNet
  5. C. N. Potts and V. A. Strusevich, “Fifty years of scheduling: a survey of milestones,” Journal of the Operational Research Society, vol. 60, supplement 1, pp. S41–S68, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. S. M. Johnson, “Optimal two- and three-stage production schedules with setup times,” Naval Research Logistics Quarterly, vol. 1, pp. 61–68, 1954. View at Google Scholar
  7. W.-C. Lee, C.-C. Wu, Y.-H. Chung, and H.-C. Liu, “Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates,” Computers and Operations Research, vol. 36, no. 6, pp. 2111–2121, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. W.-C. Lee and Y.-H. Chung, “Permutation flowshop scheduling to minimize the total tardiness with learning effects,” International Journal of Production Economics, vol. 141, pp. 327–334, 2013. View at Google Scholar
  9. G. C. Mouzon and M. B. Yildirim, “A framework to minimize total energy consumption and total tardiness on a single machine,” in Proceedings of the 4th Annual Symposium on Graduate Research and Scholarly Projects (GRASP '08), Wichita State University, 2008.
  10. X. Liu, F. Zou, and X. Zhang, “Mathematical model and genetic optimization for hybrid flow shop scheduling problem based on energy consumption,” in Proceedings of the Chinese Control and Decision Conference (CCDC '08), pp. 1002–1007, July 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. K. Fang, N. Uhana, F. Zhao, and J. W. Sutherland, “A new approach to scheduling in manufacturing for power consumption and carbon foot- print reduction,” Journal of Manufacturing Systems, vol. 30, pp. 234–240, 2011. View at Google Scholar
  12. G. B. McMahon and P. G. Burton, “Flow-shop scheduling with the branch- and-bound method,” Operation Research, vol. 15, pp. 473–481, 1967. View at Google Scholar
  13. C. T. Ng, J.-B. Wang, T. C. E. Cheng, and L. L. Liu, “A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs,” Computers and Operations Research, vol. 37, no. 1, pp. 83–90, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. J. Carlier, “Or-library,” http://people.brunel.ac.uk/~mastjjb/jeb/info.html.