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

Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

1Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
2School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
3Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran

Received 14 February 2014; Accepted 30 March 2014; Published 22 April 2014

Academic Editors: P. Agarwal, V. Bhatnagar, and Y. Zhang

Copyright © 2014 S. Molla-Alizadeh-Zavardehi 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. R. Uzsoy, C. Lee, and L. Martin-Vega, “A review of production planning and scheduling models in the semiconductor industry. Part I. System characteristics, performance evaluation and production planning,” IIE Transactions, vol. 24, pp. 47–60, 1992. View at Google Scholar
  2. R. Uzsoy, C. Y. Lee, and L. A. Martin-Vega, “Review of production planning and scheduling models in the semiconductor industry part II: shop-floor control,” IIE Transactions, vol. 26, no. 5, pp. 44–55, 1994. View at Google Scholar · View at Scopus
  3. Y. Ikura and M. Gimple, “Efficient scheduling algorithms for a single batch processing machine,” Operations Research Letters, vol. 5, no. 2, pp. 61–65, 1986. View at Google Scholar · View at Scopus
  4. C. Y. Lee, R. Uzsoy, and L. A. Martin-Vega, “Efficient algorithms for scheduling semiconductor burn-in operations,” Operations Research, vol. 40, no. 4, pp. 764–775, 1992. View at Google Scholar
  5. C. N. Potts and M. Y. Kovalyov, “Scheduling with batching: a review,” European Journal of Operational Research, vol. 120, no. 2, pp. 228–249, 2000. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Mathirajan and A. I. Sivakumar, “A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor,” International Journal of Advanced Manufacturing Technology, vol. 29, no. 9-10, pp. 990–1001, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. C. S. Wang and R. Uzsoy, “A genetic algorithm to minimize maximum lateness on a batch processing machine,” Computers and Operations Research, vol. 29, no. 12, pp. 1621–1640, 2002. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Melouk, P. Damodaran, and P.-Y. Chang, “Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing,” International Journal of Production Economics, vol. 87, no. 2, pp. 141–147, 2004. View at Publisher · View at Google Scholar · View at Scopus
  9. S. G. Koh, P. H. Koo, D. C. Kim, and W. S. Hur, “Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families,” International Journal of Production Economics, vol. 98, no. 1, pp. 81–96, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. M. Sevaux and S. Dauzère-Pérès, “Genetic algorithms to minimize the weighted number of late jobs on a single machine,” European Journal of Operational Research, vol. 151, no. 2, pp. 296–306, 2003. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Husseinzadeh Kashan, B. Karimi, and F. Jolai, “Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with nonidentical job sizes,” International Journal of Production Research, vol. 44, pp. 2337–2360, 2006. View at Google Scholar
  12. P. Damodaran, P. Kumar Manjeshwar, and K. Srihari, “Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms,” International Journal of Production Economics, vol. 103, no. 2, pp. 882–891, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. L. Mönch, R. Unbehaun, and Y. I. Choung, “Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint,” OR Spectrum, vol. 28, no. 2, pp. 177–198, 2006. View at Publisher · View at Google Scholar · View at Scopus
  14. F. D. Chou, P. C. Chang, and H. M. Wang, “A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem,” International Journal of Advanced Manufacturing Technology, vol. 31, no. 3-4, pp. 350–359, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. H. M. Wang, P. C. Chang, and F. D. Chou, “A hybrid forward/backward approach for single batch scheduling problems with non-identical job sizes,” Journal of the Chinese Institute of Industrial Engineers, vol. 24, no. 3, pp. 191–199, 2007. View at Google Scholar · View at Scopus
  16. A. H. Kashan and B. Karimi, “Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: an ant colony framework,” Journal of the Operational Research Society, vol. 59, no. 9, pp. 1269–1280, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. F. D. Chou and H. M. Wang, “Scheduling for a single semiconductor batch-processing machine to minimize total weighted tardiness,” Journal of the Chinese Institute of Industrial Engineers, vol. 25, no. 2, pp. 136–147, 2008. View at Google Scholar · View at Scopus
  18. M. Mathirajan, V. Bhargav, and V. Ramachandran, “Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates,” International Journal of Advanced Manufacturing Technology, vol. 48, no. 9-12, pp. 1133–1148, 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. H. M. Wang, “Solving single batch-processing machine problems using an iterated heuristic,” International Journal of Production Research, vol. 49, no. 14, pp. 4245–4261, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Husseinzadeh Kashan, B. Karimi, and F. Jolai, “An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes,” Engineering Applications of Artificial Intelligence, vol. 23, no. 6, pp. 911–922, 2010. View at Publisher · View at Google Scholar · View at Scopus
  21. H. Ishii, M. Tada, and T. Masuda, “Two scheduling problems with fuzzy due-dates,” Fuzzy Sets and Systems, vol. 46, no. 3, pp. 339–347, 1992. View at Google Scholar · View at Scopus
  22. K. K. Harikrishnan and H. Ishii, “Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date,” Fuzzy Optimization and Decision Making, vol. 4, no. 2, pp. 141–147, 2005. View at Publisher · View at Google Scholar · View at Scopus
  23. A. D. Yimer and K. Demirli, “Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines,” International Journal of Approximate Reasoning, vol. 50, no. 1, pp. 117–137, 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. B. Cheng, K. Li, and B. Chen, “Scheduling a single batch-processing machine with non-identical job sizes in fuzzy environment using an improved ant colony optimization,” Journal of Manufacturing Systems, vol. 29, no. 1, pp. 29–34, 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. Y. Zhang, S. Wang, G. Ji, and Z. Dong, “Genetic pattern search and its application to brain image classification,” Mathematical Problems in Engineering, vol. 2013, Article ID 580876, 8 pages, 2013. View at Publisher · View at Google Scholar
  26. Y. Zhang, L. Wu, and S. Wang, “Solving two-dimensional HP model by firefly algorithm and simplified energy function,” The Scientific World Journal, vol. 2013, Article ID 398141, 9 pages, 2013. View at Publisher · View at Google Scholar
  27. A. S. Wu, H. Yu, S. Jin, K.-C. Lin, and G. Schiavone, “An incremental genetic algorithm approach to multiprocessor scheduling,” IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 9, pp. 824–834, 2004. View at Publisher · View at Google Scholar · View at Scopus
  28. R. Tavakkoli-Moghaddam, A. Rahimi-Vahed, and A. H. Mirzaei, “A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness,” Information Sciences, vol. 177, no. 22, pp. 5072–5090, 2007. View at Publisher · View at Google Scholar · View at Scopus
  29. S. Balochian and E. Ebrahimi, “Parameter optimization via cuckoo optimization algorithm of fuzzy controller for liquid level control,” Journal of Engineering, vol. 2013, Article ID 982354, 7 pages, 2013. View at Publisher · View at Google Scholar
  30. Y. Celik and E. Ulker, “An improved marriage in honey bees optimization algorithm for single objective unconstrained optimization,” The Scientific World Journal, vol. 2013, Article ID 370172, 11 pages, 2013. View at Publisher · View at Google Scholar
  31. T. J. Choi, C. W. Ahn, and J. An, “An adaptive cauchy differential evolution algorithm for global numerical optimization,” The Scientific World Journal, vol. 2013, Article ID 969734, 12 pages, 2013. View at Publisher · View at Google Scholar
  32. Y. Zhou and H. Zheng, “A novel complex valued cuckoo search algorithm,” The Scientific World Journal, vol. 2013, Article ID 597803, 6 pages, 2013. View at Publisher · View at Google Scholar