Call for Paper - November 2020 Edition
IJCA solicits original research papers for the November 2020 Edition. Last date of manuscript submission is October 20, 2020. Read More

Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Rahmanidoust Mohammad, Zheng Jianguo, Rabiee Meysam
10.5120/ijca2017914789

Rahmanidoust Mohammad, Zheng Jianguo and Rabiee Meysam. Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness. International Journal of Computer Applications 169(7):30-37, July 2017. BibTeX

@article{10.5120/ijca2017914789,
	author = {Rahmanidoust Mohammad and Zheng Jianguo and Rabiee Meysam},
	title = {Simultaneous Considering of Machine Availability Constraint, Sequence Dependent Setup Time and Ready Time in a No-wait Hybrid Flow Shop Scheduling Problem to Minimize Mean Tardiness},
	journal = {International Journal of Computer Applications},
	issue_date = {July 2017},
	volume = {169},
	number = {7},
	month = {Jul},
	year = {2017},
	issn = {0975-8887},
	pages = {30-37},
	numpages = {8},
	url = {http://www.ijcaonline.org/archives/volume169/number7/27997-2017914789},
	doi = {10.5120/ijca2017914789},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to other solution approaches reported on the literature. For this purpose, we draw an analogy between the results obtained from algorithms applied to some random case study. To achieve reliable results, Taguchi approach is used to define robust parameters' values for our proposed algorithm. The superiority and effectiveness of our proposed algorithm is inferred from all the results obtained in various situations.

References

  1. Ruiz, R. and Vazquez-Rodriguez, J. A., 2010. The hybrid flow shop scheduling problem. European Journal of Operational Research, 205, 1–18.
  2. Shafaei, R., Rabiee, M. and Mirzaeyan, M. An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop, Int. J. Comput. Integr. Manuf., 24(10), pp. 888?99 (2011).
  3. Shafaei, R., Moradinasab, N., & Rabiee, M. (2011b). Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines. International Journal of Management Science and Engineering Management, 6(6), 421-430.
  4. Shafaei, R., Rabiee, M., & Mazinani, M. (2012). Minimization of maximum tardiness in a no-wait two stage flexible flow shop. International Journal of Artificial Intelligence? 8(S12), 166-181.
  5. Rabiee, M., Zandieh, M., & Jafarian, A. (2012a). Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust meta-heuristics. International Journal of Production Research, 50(24), 7428-7446.
  6. Rabiee, M., Zandieh, M., & Ramezani, P. (2012b). Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches. International Journal of Production Research, 50(24), 7327-7342.
  7. Moradinasab, N., Shafaei, R., Rabiee, M., & Ramezani, P. (2013). No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms. Journal of Experimental & Theoretical Artificial Intelligence, 25(2), 207-225.
  8. Rabiee, M., Rad, R. S., Mazinani, M., & Shafaei, R. (2014). An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. The International Journal of Advanced Manufacturing Technology, 71(5-8), 1229-1245.
  9. Asefi, H., Jolai, F., Rabiee, M., & Araghi, M. T. (2014). A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem. The International Journal of Advanced Manufacturing Technology, 75(5-8), 1017-1033.
  10. Jolai, F., Tavakkoli-Moghaddam, R., Rabiee, M., & Gheisariha, E. (2014). An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem. Scientia Iranica. Transaction E, Industrial Engineering, 21(3), 1007.
  11. Samarghandi, H., & ElMekkawy, T. Y. (2014). Solving the no-wait flow-shop problem with sequence-dependent set-up times. International Journal of Computer Integrated Manufacturing, 27(3), 213-228.
  12. Fattahi, P., Azizi, V., & Jabbari, M. (2015). Lot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors. International Journal of Engineering TRANSACTIONS A: Basics, 28, 1031-1039.
  13. Azizi, V., Jabbari, M., & Kheirkhah, A. (2016). M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan. International Journal of Industrial Engineering Computations, 7(2), 309-322.
  14. Joo, C. M., & Kim, B. S. (2015). Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Computers & Industrial Engineering, 85, 102-109.
  15. Rabiee, M., Jolai, F., Asefi, H., Fattahi, P., & Lim, S. (2016). A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness. International Journal of Computer Integrated Manufacturing, 29(9), 1007-1024.
  16. Marichelvam, M. K., Tosun, ?, & Geetha, M. (2017). Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time. Applied Soft Computing, 55, 82-92.
  17. Guo, Z., Shi, L., Chen, L., & Liang, Y. (2017). A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing. Omega, 66, 327-343.
  18. Fanjul-Peyro, L., Perea, F., & Ruiz, R. (2017). MIP models and mataheuristics for the unrelated parallel machine scheduling problem with additional resources. European Journal of Operational Research.
  19. Ruiz, R. and Allahverdi, A. ‘‘No-wait flowshop with separate setup times to minimize maximum lateness’’, Int. J. Adv. Manuf. Technol., 35(5), pp. 551–565 (2007).
  20. Huang R. H., Yang C. L. and Huang Y. C., 2009. No-wait two-stage multiprocessor flow shop scheduling with unit setup. International Journal of Advanced Manufacturing Technology, 44:921–927.
  21. Tasgetiren M. F., Pan Q. K., Suganthan P.N. and Liang Y. C., 2007. A Discrete Differential Evolution Algorithm for the No-Wait Flow shop Scheduling Problem with Total Flow time Criterion. Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling.
  22. Liu Z., Xie J., Li J. and Dong J., 2003. A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage, Tsinghua Science and Technology, 8, 43-48.
  23. Xie J., Xing W., Liu Z. and Dong J., 2004. Minimum Deviation Algorithm for Two-Stage No-Wait Flowshops with Parallel Machines. Computer and Mathematics with Application, 47, 1857-1863.
  24. Jolai F., Sheikh S., Rabbani M. and Karimi B., 2009. A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. International Journal of Advanced Manufacturing Technology, 42:523–532.
  25. Jolai, F., Rabiee, M., & Asefi, H. (2012). A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times. International Journal of Production Research, 50(24), 7447-7466.
  26. 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. J Int Manuf 1–14.
  27. Ángel-Bello, F., Álvarez, A., Pacheco, J., & Martínez, I. (2011). A single machine scheduling problem with availability constraints and sequence-dependent setup costs. Applied Mathematical Modelling, 35(4), 2041-2050.
  28. Aldowaisan T (2001) A new heuristic and dominance relations for no-wait flowshops with setups. Comput Oper Res 28(6):563–584.
  29. Atashpaz-Gargari and Lucas, E.C., 2007. Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialist competitive. IEEE Congress on Evolutionary computation, Singapore.
  30. Shokrollahpour, E.; Zandieh, M.; Dorri, B. A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. Int. J. Prod. Res. 2011, 49, 3087–3103, doi:10.1080/00207540903536155.
  31. Talbi, E.G., Metaheuristics: from Design to Implementation, Wiley, 2009.

Keywords

No-wait; Scheduling; Hybrid flow shop; Meta-heuristic algorithms; Imperialist competitive algorithm.