Advertisement

Journal of Intelligent Manufacturing

, Volume 30, Issue 1, pp 33–45 | Cite as

Makespan minimization for batching work and rework process on a single facility with an aging effect: a hybrid meta-heuristic algorithm for sustainable production management

  • A. BeynaghiEmail author
  • F. Moztarzadeh
  • A. Shahmardan
  • R. Alizadeh
  • J. Salimi
  • M. Mozafari
Article
  • 191 Downloads

Abstract

This paper takes into account a single facility that produces good quality as well as defective units in batches. In addition, units produced on the facility are inspected for quality in batches. Herein, after the inspection is completed, the defective units of the inspected batch are reworked. Each reworked unit has the required good quality. When the facility is related to reworking defective units, there is an aging effect in which the processing time of a defective unit depends on its position in a sequence. Subsequently, when reworking of all defective units in each batch is completed, a maintenance activity is required, after which the facility will be restored to its initial condition. In addition, it is assumed that the percentage of the defective units is the same in each batch. The objective is to find the number of batches and their (integer) size such that the makespan is minimized. The major contributions of this paper can be summarized in two aspects. Firstly, we propose a new reasonable model for an imperfect production of a single product, and secondly, to solve the proposed model, a hybrid meta-heuristic algorithm comprising genetic algorithm, variable neighborhood search and simulated annealing algorithms is developed. The experimental results confirms that the hybrid algorithm can be proposed to sustainably solve this problem.

Keywords

Batching Rework Aging effect Maintenance Hybrid meta-heuristic algorithm 

References

  1. Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society, 50(7), 711–720.Google Scholar
  2. Arab, A., Ismail, N., & Lee, L. S. (2013). Maintenance scheduling incorporating dynamics of production system and real-time information from workstations. Journal of Intelligent Manufacturing, 24(4), 695–705.Google Scholar
  3. Baptiste, P. (2000). Batching identical jobs. Mathematical Methods of Operations Research, 52(3), 355–367.Google Scholar
  4. Belmecheri, F., Prins, C., Yalaoui, F., & Amodeo, L. (2013). Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. Journal of Intelligent Manufacturing, 24(4), 775–789.Google Scholar
  5. Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188(2), 315–329.Google Scholar
  6. Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1–13.Google Scholar
  7. Damodaran, P., Vélez-Gallego, M. C., & Maya, J. (2011). A GRASP approach for makespan minimization on parallel batch processing machines. Journal of Intelligent Manufacturing, 22(5), 767–777.Google Scholar
  8. Fan, J., & Xu, D. (2010). Some single-machine scheduling problems with aging effect. In IEEE international conference on service operations and logistics and informatics (SOLI), (pp. 430–431). IEEE.Google Scholar
  9. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Boston: Addison-Wesley.Google Scholar
  10. Graves, G. H., & Lee, C. Y. (1999). Scheduling maintenance and semiresumable jobs on a single machine. Naval Research Logistics, 46(7), 845–863.Google Scholar
  11. Gribkovskaia, I. V., Kovalev, S., & Werner, F. (2010). Batching for work and rework processes on dedicated facilities to minimize the makespan. Omega, 38(6), 522–527.Google Scholar
  12. Hsu, C. J., Low, C., & Su, C. T. (2010). A single-machine scheduling problem with maintenance activities to minimize makespan. Applied Mathematics and Computation, 215(11), 3929–3935.Google Scholar
  13. Inderfurth, K., Janiak, A., Kovalyov, M. Y., & Werner, F. (2006). Batching work and rework processes with limited deterioration of reworkables. Computers and Operations Research, 33(6), 1595–1605.Google Scholar
  14. Jabbarizadeh, F., Zandieh, M., & Talebi, D. (2009). Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints. Computers and Industrial Engineering, 57(3), 949–957.Google Scholar
  15. Jolai, F., Amalnick, M. S., Alinaghian, M., Shakhsi-Niaei, M., & Omrani, H. (2011). A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines. Journal of Intelligent Manufacturing, 22(2), 247–261.Google Scholar
  16. Khatami, M., & Zegordi, S. H. (2014). Coordinative production and maintenance scheduling problem with flexible maintenance time intervals. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-014-1001-9.
  17. Kirkpatrick, S., Gelatt, C. D, Jr., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680.Google Scholar
  18. Kuo, W. H., & Yang, D. L. (2008). Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect. Journal of the Operational Research Society, 59(3), 416–420.Google Scholar
  19. Lai, P.-J., & Wu, H.-C. (2013). Using heuristic algorithms to solve the scheduling problems with job-dependent and machine-dependent learning effects. Journal of Intelligent Manufacturing, 26, 1–11.Google Scholar
  20. Li, X., Ishii, H., & Masuda, T. (2012). Single machine batch scheduling problem with fuzzy batch size. Computers & Industrial Engineering, 62(3), 688–692.Google Scholar
  21. Lindner, G., Flapper, S. D. P., & Buscher, U. (2001). An optimal lot and batch size policy for a single item produced and remanufactured on one machine. Magdeburg: FEMM, Otto-von-Guericke-Univ.Google Scholar
  22. Mladenovi’c, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24(11), 1097–1100.Google Scholar
  23. Mokhtari, H., & Noroozi, A. (2015). An efficient chaotic based PSO for earliness/tardiness optimization in a batch processing flow shop scheduling problem. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-015-1158-x.
  24. Mosheiov, G. (1994). Scheduling jobs under simple linear deterioration. Computers & Operations Research, 21(6), 653–659.Google Scholar
  25. Mosheiov, G. (2001). Scheduling problems with a learning effect. European Journal of Operational Research, 132(3), 687–693.Google Scholar
  26. Ojha, D., Sarker, B. R., & Biswas, P. (2007). An optimal batch size for an imperfect production system with quality assurance and rework. International Journal of Production Research, 45(14), 3191–3214.Google Scholar
  27. Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120(2), 228–249.Google Scholar
  28. Ramezani, P., Rabiee, M., & Jolai, F. (2013). No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: A hybrid meta-heuristic approach. Journal of Intelligent Manufacturing, 26, 1–14.Google Scholar
  29. Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121(1), 1–15.Google Scholar
  30. Solimanpur, M., & Kamran, M. A. (2010). Solving facilities location problem in the presence of alternative processing routes using a genetic algorithm. Computers & Industrial Engineering, 59(4), 830–839.Google Scholar
  31. Tayebi Araghi, M., Jolai, F., & Rabiee, M. (2014). Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach. International Journal of Computer Integrated Manufacturing, 27(8), 733–746.Google Scholar
  32. Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Amin, G. R., & Siadat, A. (2012). A cell formation problem considering machine utilization and alternative process routes by scatter search. Journal of Intelligent Manufacturing, 23(4), 1127–1139.Google Scholar
  33. Teunter, R. H., & Flapper, S. D. P. (2003). Lot-sizing for a single-stage single-product production system with rework of perishable production defectives. OR Spectrum, 25(1), 85–96.Google Scholar
  34. Tian, Z., Lin, D., & Wu, B. (2012). Condition based maintenance optimization considering multiple objectives. Journal of Intelligent Manufacturing, 23(2), 333–340.Google Scholar
  35. Toksarı, M. D., & Güner, E. (2010). Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs. Journal of Intelligent Manufacturing, 21(6), 843–851.Google Scholar
  36. Vahdani, B., Tavakkoli-Moghaddam, R., Zandieh, M., & Razmi, J. (2012). Vehicle routing scheduling using an enhanced hybrid optimization approach. Journal of Intelligent Manufacturing, 23(3), 759–774.Google Scholar
  37. Wu, C. C., Shiau, Y. R., Lee, L. H., & Lee, W. C. (2009). Scheduling deteriorating jobs to minimize the makespan on a single machine. International Journal of Advanced Manufacturing Technology, 44(11–12), 1230–1236.Google Scholar
  38. Xu, R., Chen, H., & Li, X. (2012). Makespan minimization on single batch-processing machine via ant colony optimization. Computers and Operations Research, 39(3), 582–593.Google Scholar
  39. Yang, S.-J., Yang, D.-L., & Cheng, T. C. E. (2010). Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Computers & Operations Research, 37(8), 1510–1514.Google Scholar
  40. Zhao, C. L., & Tang, H. Y. (2007). Single-machine scheduling problems with an aging effect. Journal of Applied Mathematics and Computing, 25(1–2), 305–314.Google Scholar
  41. Zhao, C. L., & Tang, H. Y. (2010). Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Applied Mathematical Modelling, 34(3), 837–841.Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • A. Beynaghi
    • 1
    • 2
    • 3
    Email author
  • F. Moztarzadeh
    • 1
    • 3
  • A. Shahmardan
    • 4
  • R. Alizadeh
    • 1
    • 2
    • 3
  • J. Salimi
    • 1
  • M. Mozafari
    • 5
  1. 1.Technology Foresight Group, Department of Management, Science and TechnologyAmirkabir University of TechnologyTehranIran
  2. 2.Office of SustainabilityAmirkabir University of TechnologyTehranIran
  3. 3.Futures Studies Research InstituteAmirkabir University of TechnologyTehranIran
  4. 4.Department of Industrial Engineering and Management SystemsAmirkabir University of TechnologyTehranIran
  5. 5.Bioengineering Research Group, Nanotechnology and Advanced Materials DepartmentMaterials and Energy Research Center (MERC)TehranIran

Personalised recommendations