Skip to main content
Log in

An efficient chaotic based PSO for earliness/tardiness optimization in a batch processing flow shop scheduling problem

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

The flow shop is a well-known class of manufacturing system for production process planning. The need for scheduling approaches arises from the requirement of most systems to implement more than one process at a moment. Batch processing is usually carried out to load balance and share system resources effectively and gain a desired quality of service level. A flow shop manufacturing problem with batch processors (BP) is discussed in current paper so as to minimize total penalty of earliness and tardiness. To address the problem, two improved discrete particle swarm optimization (PSO) algorithms are designed where most important properties of basic PSO on velocity of particles are enhanced. We also employ the attractive properties of logistic chaotic map within PSO so as to investigate the influence of chaos on search performance of BP flow shop problem. In order to investigate the suggested algorithms, a comprehensive computational study is carried out and performance of algorithms is compared with (1) a commercial optimization solver, (2) a well-known algorithm from PSO’s literature and (3) three algorithms from BP’s literature. The experimental results demonstrate the superiority of our algorithm against others.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Alatas, B., Akin, E., & Ozer, A. B. (2009). Chaos embedded particle swarm optimization algorithms. Chaos, Solitons and Fractals, 40, 1715–1734.

  • Chang, P. Y., Damodaran, P., & Melouk, S. (2004). Minimizing makespan on parallel batch processing machines. International Journal of Production Research, 42, 4211–4220.

    Article  Google Scholar 

  • Cheng, M.-Y., Huang, K.-Y., & Chen, H.-M. (2012). K-means particle swarm optimization with embedded chaotic search for solving multidimensional problems. Applied Mathematics and Computation, 219, 3091–3099.

    Article  Google Scholar 

  • Chou, D. F. (2007). A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion. International Journal of Advanced Manufacturing Technology, 35, 587–595.

    Article  Google Scholar 

  • Chou, D. F., Chann, C. P., & Wang, M. H. (2006). A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem. International Journal of Advanced Manufacturing Technology, 31, 350–359.

    Article  Google Scholar 

  • Chou, D. F., & Wang, M. H. (2008). Scheduling for a single semiconductor batch processing machine to minimize total weighted tardiness. Journal of the Chinese Institute of Industrial Engineers, 25, 136–147.

    Article  Google Scholar 

  • Damodaran, P., Hirani, N. S., Mario, C., & Gallego, V. (2009). Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. European Journal of Industrial Engineering, 3, 187–206.

    Article  Google Scholar 

  • Damodaran, P., Manjeshwar, P. K., & Srihari, K. (2006). Minimizing makespan on a batch processing machine with non-identical job sizes using genetic algorithms. International Journal of Production Economics, 103, 882–891.

    Article  Google Scholar 

  • Damodaran, P., & Srihari, K. (2004). Mixed integer formulation to minimize makespan in a flow shop with batch processing machines. Mathematical and Computer Modelling, 40, 1465–1472.

    Article  Google Scholar 

  • Damodaran, P., Srihari, K., & Lam, S. (2007). Scheduling a capacitated batch-processing machine to minimize makespan. Robotics and Computer-Integrated Manufacturing, 23, 208–16.

    Article  Google Scholar 

  • Dauxois, T., Ruffo, S., Arimondo, S., & Wilkens, M. (2002). Dynamics and thermodynamics of systems with long range interactions: An introduction (Lect. Notes in Phys. Vol. 602, 1st ed.). Springer: Berlin.

  • Gutie’rrez, J. M., & Iglesias, A. (1998). Mathematica package for analysis and control of chaos in nonlinear systems. Computers in Physics, 12(6), 608–619.

    Article  Google Scholar 

  • Hajiaghaei-Keshteli, M. (2010). The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches. Applied Soft Computing, 2, 2069–2078.

    Google Scholar 

  • He, Y., Qifa, X., Yang, S., & Liao, L. (2014). Reservoir flood control operation based on chaotic particle swarm optimization algorithm. Applied Mathematical Modelling, 38, 4480–4492.

    Article  Google Scholar 

  • Husseinzadeh Kashan, A., & Karimi, B. (2007). Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework. Journal of the Operational Research Society, 59, 1269–1280.

    Article  Google Scholar 

  • Husseinzadeh Kashan, A., Karimi, B., & Jenabi, M. (2008). A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes’. Computers and Operations Research, 35, 1084–1098.

    Article  Google Scholar 

  • Husseinzadeh Kashan, A., Karimi, B., & Jolai, F. (2006). Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes. International Journal of Production Research, 44, 2337–2360.

    Article  Google Scholar 

  • Iqbal, S. Zang, X. Zhu, Y. Liu, X., & Zhao, J. (2014). Introducing undergraduate electrical engineering students to chaotic dynamics: Computer simulations with logistic map and buck converter, 2014 8th Asia Modelling Symposium (AMS 2014), Taipei, Taiwan; 09/2014.

  • Kennedy, J., & Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm. In Proceedings of the world multiconference on systemics, cybernetics and informatics (pp. 4104–9). Piscatawary, NJ.

  • Koh, S. G., Koo, P. H., Ha, J. W., & Lee, W. S. (2004). Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families. International Journal of Production Research, 42, 4091–4107.

    Article  Google Scholar 

  • Kuru, L., Ozturk, A., Kurua, E. Kandar, & Kandar, O. (2015). Determination of voltage stability boundary values in electrical power systems by using the Chaotic Particle Swarm Optimization algorithm. Electrical Power and Energy Systems, 64, 873–879.

    Article  Google Scholar 

  • Lauff, V., & Werner, F. (2004). Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey. Mathematical and Computer Modelling, 40, 637–655.

    Article  Google Scholar 

  • Lei, D., & Guo, X. (2011). Variable neighborhood search for minimizing tardiness objectives on flow shop with batch processing machines. International Journal of Production Research, 49, 519–529.

    Article  Google Scholar 

  • Li, X., & Yin, M. (2013). An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure. Advances in Engineering Software, 55, 10–31.

    Article  Google Scholar 

  • Malve, S., & Uzsoy, R. (2007). A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Computers & Operations Research, 34, 3016–3028.

    Article  Google Scholar 

  • Manjeshwar, P. K., Damodaran, P., & Srihari, K. (2009). Minimizing makespan in a flow shop with two batch processing machines using simulated annealing. Robotics and Computer-Integrated Manufacturing, 25, 667–679.

    Article  Google Scholar 

  • Mark Berliner, L. (1992). Statistics, probability and chaos. Statistical Science, 7(1), 69–122.

    Article  Google Scholar 

  • May, R. M. (1976). Simple mathematical models with very complicated dynamics. Nature, 261, 459.

    Article  Google Scholar 

  • Mazumdar, C. S., Mathirajan, M., Gopinath, R., & Sivakumar, A. I. (2008). Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints. International Journal of Operational Research, 3, 119–139.

    Article  Google Scholar 

  • Melouk, S., Damodaran, P., & Chang, P. Y. (2004). Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics, 87, 141–147.

    Article  Google Scholar 

  • Mokhtari, H., & Salmasnia, A. (2015). A Monte Carlo simulation based chaotic differential evolution algorithm for scheduling a stochastic parallel processor system. Expert Systems with Applications, 42(20), 7132–7147.

    Article  Google Scholar 

  • Mönch, L., Balasubramanian, H., Fowler, J. W., & Pfund, M. E. (2005). Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers & Operations Research, 32, 2731–2750.

    Article  Google Scholar 

  • Mönch, L., Unbehaun, R., & Choung, Y. I. (2006). Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint. OR Spectrum, 28, 177–198.

    Article  Google Scholar 

  • Santos Coelho, L. D. (2008). A quantum particle swarm optimizer with chaotic mutation operator. Chaos, Solitons and Fractals, 37, 1409–1418.

    Article  Google Scholar 

  • Tang, M., Xin, Y., Li, J., & Zhai, J. (2013). Nonconvex resource control and lifetime optimization in wireless video sensor networks based on chaotic particle swarm optimization. Applied Soft Computing, 13, 3273–3284.

    Article  Google Scholar 

  • Tasgetiren, M. F., Liang, Y. C., Sevkli, M., & Gencyilmaz, G. (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177, 1930–1947.

  • Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., & Mirzaei, A. H. (2007). 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, 177, 5072–5090.

  • Turgut, O. E., Turgut, M. S., & Coban, M. T. (2014). Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations. Computers and Mathematics with Applications, 68, 508–530.

    Article  Google Scholar 

  • Van den Bergh, F. (2006). An analysis of Particle Swarm optimizers. Thesis (Ph.D.), University of Pretoria.

  • Wang, C. S., & Uzsoy, R. (2002). A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers & Operations Research, 29, 1621–1640.

    Article  Google Scholar 

  • Wang, M. H., & Chou, D. F. (2010). Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics. Expert Systems with Applications, 37, 1510–1521.

    Article  Google Scholar 

  • Wang, W.-X., Wang, X., Ge, X.-L., & Deng, L. (2014). Multi-objective optimization model for multi-project scheduling on critical chain. Advances in Engineering Software, 68, 33–39.

    Article  Google Scholar 

  • Wang, Y., Zhou, J., Qin, H., & Youlin, L. (2010). Improved chaotic particle swarm optimization algorithm for dynamic economic dispatch problem with valve-point effects. Energy Conversion and Management, 51, 2893–2900.

    Article  Google Scholar 

  • Xiang, T., Liao, X. F., & Wong, K. W. (2007). An improved particle swarm optimization algorithm combined with piecewise linear chaotic map. Applied Mathematics and Computation, 190, 1637–1645.

    Article  Google Scholar 

  • Xu, S. and Bean, J. C., (2007). A genetic algorithm for scheduling parallel non-identical batch processing machines. In Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling (CI-Sched 2007) (pp. 143–150).

  • Yuan, X., Yuan, Y., & Zhang, Y. (2002). A hybrid chaotic genetic algorithm for short-term hydro system scheduling. Mathematics and Computers in Simulation, 59, 319–327.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hadi Mokhtari.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mokhtari, H., Noroozi, A. An efficient chaotic based PSO for earliness/tardiness optimization in a batch processing flow shop scheduling problem. J Intell Manuf 29, 1063–1081 (2018). https://doi.org/10.1007/s10845-015-1158-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1158-x

Keywords

Navigation