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

No-Wait Flexible Flow Shop Scheduling with Due Windows

Department of Business Administration, Fu Jen Catholic University, New Taipei City 24205, Taiwan

Received 12 January 2015; Accepted 19 February 2015

Academic Editor: Yunqiang Yin

Copyright © 2015 Rong-Hwa Huang 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. T. C. E. Cheng, S.-J. Yang, and D.-L. Yang, “Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity,” International Journal of Production Economics, vol. 135, no. 1, pp. 154–161, 2012. View at Publisher · View at Google Scholar · View at Scopus
  2. W. K. Yeung, C. Oǧuz, and T. C. E. Cheng, “Two-stage flowshop earliness and tardiness machine scheduling involving a common due window,” International Journal of Production Economics, vol. 90, no. 3, pp. 421–434, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. R. H. Huang, C. L. Yang, and W. C. Cheng, “Flexible job shop scheduling with due window—a two-pheromone ant colony approach,” International Journal of Production Economics, vol. 141, no. 2, pp. 685–697, 2013. View at Publisher · View at Google Scholar · View at Scopus
  4. Z. L. Chen and C. Y. Lee, “Parallel machine scheduling with a common due window,” European Journal of Operational Research, vol. 136, no. 3, pp. 512–527, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. T. Aldowaisan, “A new heuristic and dominance relations for no-wait flowshops with setups,” Computers and Operations Research, vol. 28, no. 6, pp. 563–584, 2001. View at Publisher · View at Google Scholar · View at Scopus
  6. C. J. Schuster and J. M. Framinan, “Approximative procedures for no-wait job shop scheduling,” Operations Research Letters, vol. 31, no. 4, pp. 308–318, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. S. J. Shyu, B. M. T. Lin, and P. Y. Yin, “Application of ant colony optimization for no-wait flow shop scheduling problem to minimize the total completion time,” Computers and Industrial Engineering, vol. 47, no. 2-3, pp. 181–193, 2004. View at Publisher · View at Google Scholar · View at Scopus
  8. X. Wang and T. C. E. Cheng, “A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups,” Computers and Operations Research, vol. 33, no. 5, pp. 1326–1344, 2006. View at Publisher · View at Google Scholar · View at Scopus
  9. L.-H. Su and Y.-Y. Lee, “The two-machine flow shop no-wait scheduling problem with a single server to minimize the total completion time,” Computers & Operations Research, vol. 35, no. 9, pp. 2952–2963, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. M. J. Pereira Lopes and J. M. V. de Carvalho, “A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times,” European Journal of Operational Research, vol. 176, no. 3, pp. 1508–1527, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. D. Biskup, J. Herrmann, and J. N. D. Gupta, “Scheduling identical parallel machines to minimize total tardiness,” International Journal of Production Economics, vol. 115, no. 1, pp. 134–142, 2008. View at Publisher · View at Google Scholar · View at Scopus
  12. M. R. de Paula, G. R. Mateus, and M. G. Ravetti, “A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times,” Computers & Operations Research, vol. 37, no. 5, pp. 938–949, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. B. Mor and G. Mosheiov, “Parallel machine scheduling problems with common flow-allowance,” International Journal of Production Economics, vol. 139, no. 2, pp. 623–633, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. H. J. Paul, C. Bierwirth, and H. Kopfer, “A heuristic scheduling procedure for multi-item hoist production lines,” International Journal of Production Economics, vol. 105, no. 1, pp. 54–69, 2007. View at Publisher · View at Google Scholar · View at Scopus
  15. R. Kumar, M. K. Tiwari, and R. Shankar, “Scheduling of flexible manufacturing systems: an ant colony optimization approach,” Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, vol. 217, no. 10, pp. 1443–1453, 2003. View at Publisher · View at Google Scholar · View at Scopus
  16. W. X. Zheng, H. Nagasawa, and N. Nishiyama, “Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties,” International Journal of Production Research, vol. 31, no. 7, pp. 1611–1620, 1993. View at Publisher · View at Google Scholar · View at Scopus