Skip to main content
SpringerLink
Log in

Scatter search based particle swarm optimization algorithm for earliness/tardiness flowshop scheduling with uncertainty

  • Research Article
  • Published:
International Journal of Automation and Computing Aims and scope Submit manuscript

Abstract

Considering the imprecise nature of the data in real-world problems, the earliness/tardiness (E/T) flowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by employing the method of maximizing the membership function of middle value. Moreover, an effective scatter search based particle swarm optimization (SSPSO) algorithm is proposed to minimize the sum of total earliness and tardiness penalties. The proposed SSPSO algorithm incorporates the scatter search (SS) algorithm into the frame of particle swarm optimization (PSO) algorithm and gives full play to their characteristics of fast convergence and high diversity. Besides, a differential evolution (DE) scheme is used to generate solutions in the SS. In addition, the dynamic update strategy and critical conditions are adopted to improve the performance of SSPSO. The simulation results indicate the superiority of SSPSO in terms of effectiveness and efficiency.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. N. Dhamala, G. B. Thapa, H. N. Yu. An efficient frontier for sum deviation JIT sequencing problem in mixed-model systems via apportionment. International Journal of Automation and Computing, vol. 9, no. 1, pp. 87–97, 2012.

    Article  Google Scholar 

  2. E. E. Uyiomendo, T. Markeset. Subsea maintenance service delivery: Mapping factors influencing scheduled service duration. International Journal of Automation and Computing, vol. 7, no. 2, pp. 167–172, 2010.

    Article  Google Scholar 

  3. J. Balasubramanian, I. E. Grossmann. Scheduling optimization under uncertainty-an alternative approach. Computers & Chemical Engineering, vol. 27, no. 4, pp. 469–490, 2003.

    Article  Google Scholar 

  4. C. S. McCahon, E. S. Lee. Fuzzy job sequencing for a flow shop. European Journal of Operational Research, vol. 62, no. 3, pp. 294–301, 1992.

    Article  MATH  Google Scholar 

  5. S. Chanas, A. Kasperski. Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing times and fuzzy due dates. Engineering Applications of Artificial Intelligence, vol. 14, no. 3, pp. 377–386, 2001.

    Article  Google Scholar 

  6. M. Sakawa, T. Mori. An efficient genetic algorithm for jobshop scheduling problems with fuzzy processing time and fuzzy duedate. Computers & Industrial Engineering, vol. 36, no. 2, pp. 325–341, 1999.

    Article  Google Scholar 

  7. S. S. Nezhad, R. G. Assadi. Preference ratio-based maximum operator approximation and its application in fuzzy flow shop scheduling. Applied Soft Computing, vol. 8, no. 1, pp. 759–766, 2008.

    Article  Google Scholar 

  8. Q. Niu, B. Jiao, X. S. Gu. Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time. Applied Mathematics and Computation, vol. 205, no. 1, pp. 148–158, 2008.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Q. Li, K. B. Sun, D. H. Xu, H. Q. Li. Single machine due date assignment scheduling problem with customer service level in fuzzy environment. Applied Soft Computing, vol. 10, no. 3, pp. 849–858, 2010.

    Article  Google Scholar 

  10. R. Tavakkoli-Moghaddam, B. Javadi, F. Jolai, A. Ghodratnama. The use of a fuzzy multi-objective linear programming for solving a multi-objective single-machine scheduling problem. Applied Soft Computing, vol. 10, no. 3, pp. 919–925, 2010.

    Article  Google Scholar 

  11. P. J. Lai, H. C. Wu. Evaluate the fuzzy completion times in the fuzzy flow shop scheduling problems using the virusevolutionary genetic algorithms. Applied Soft Computing, vol. 11, no. 8, pp. 4540–4550, 2011.

    Article  Google Scholar 

  12. J. Kennedy, R. C. Eberhart. Particle swarm optimization. In Proceedings of International Conference on Neural Networks, IEEE, Piscataway, USA, pp. 1942–1948, 1995.

    Chapter  Google Scholar 

  13. A. Gorbenko, V. Popov. Task-resource scheduling problem. International Journal of Automation and Computing, vol. 9, no. 4, pp. 429–441, 2012.

    Article  MathSciNet  Google Scholar 

  14. F. Glover. Heuristics for integer programming using surrogate constraints. Decision Sciences, vol. 8, no. 1, pp. 156–166, 1977.

    Article  Google Scholar 

  15. M. Laguna, R, Martí. Scatter Search. Methodology and Implementations in C, Boston, USA: Kluwer Academic Publishers, pp. 1–88, 2003.

    MATH  Google Scholar 

  16. Y. H. Liu. Incorporating scatter search and threshold accepting in finding maximum likelihood estimates for the multinomial probit model. European Journal of Operational Research, vol. 211, no. 1, pp. 130–138, 2011.

    Article  Google Scholar 

  17. T. Zhang, W. A. Chaovalitwongse, Y. J. Zhang. Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Computers & Operations Research, vol. 39, no. 10, pp. 2277–2290, 2012.

    Article  MathSciNet  MATH  Google Scholar 

  18. M. de Athayde Costa e Silva, C. E. Klein, V. C. Mariani, L. dos Santos Coelho. Multiobjective scatter search approach with new combination scheme applied to solve environmental/economic dispatch problem. Energy, vol. 53, no. 1, pp. 14–21, 2013.

    Article  Google Scholar 

  19. M. Sakawa, R. Kubota. Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms. European Journal of Operational Research, vol. 120, no. 2, pp. 393–407, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  20. Q. Liu, X. S. Gu. A kind of job shop schedule problems with uncertain processing time. Journal of East China University of Science and Technology, vol. 27, no. 5, pp. 442–445, 2001. (in Chinese)

    MathSciNet  Google Scholar 

  21. R. Storn, K. Price. Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  22. R. Martí, M. Laguna, F. Glover. Principles of scatter search. European Journal of Operational Research, vol. 169, no. 2, pp. 359–372, 2006.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  24. F. Glover. A template for scatter search and path relinking. Artificial Evolution, J. K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D. Snyers, Eds., Berlin, Germany: Springer-Verlag, pp. 1–51, 1998.

    Chapter  Google Scholar 

  25. E. Taillard. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, vol. 47, no. 1, pp. 65–74, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  26. P. Li, X. Gu. Flow-shop scheduling problem with uncertain processing time and distinct due window. Journal of System Simulation, vol. 16, no. 1, pp. 155–157, 2004. (in Chinese)

    MathSciNet  Google Scholar 

  27. R. C. Eberhart, Y. H. Shi. Particle swarm optimization: Developments, applications and resources. In Proceedings of the IEEE Congress on Evolutionary Computation, IEEE, Seoul, Korea, pp. 81–86, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai, 200237, China

    Jia-Can Geng, Zhe Cui & Xing-Sheng Gu

Authors
  1. Jia-Can Geng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhe Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xing-Sheng Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xing-Sheng Gu.

Additional information

This work was supported by National Natural Science Foundation of China (Nos. 61174040 and 61104178), Shanghai Commission of Science and Technology (No. 12JC1403400), and the Fundamental Research Funds for the Central Universities.

Recommended by Guest Editor Xin Sun

Jia-Can Geng received the B. Sc. degree in automation from East China University of Science and Technology, China in 2012. She is currently a master student in control science and engineering in East China University of Science and Technology, China.

Her research interests include scheduling problems and intelligent optimization.

ORCID iD: 0000-0001-7299-3847

Zhe Cui received the B. Sc. degree in Department of Automation, School of Information Science and Engineering, East China University of Science and Technology, China in 2009. He is now a Ph.D. degree candidate in control science and engineering in East China University of Science and Technology, China.

His research interests include scheduling problems and meta-heuristics.

Xing-Sheng Gu received the B. Sc. degree from Nanjing Institute of Chemical Technology, China in 1982, received the M. Sc. and Ph.D. degrees from East China University of Science and Technology, China in 1988 and 1993, respectively. He is currently a professor at School of Information Science and Engineering, East China University of Science and Technology, China.

His research interests include planning and scheduling for process industry, modeling, control and optimization for industry processes, intelligent optimization, faults detection and diagnosis.

ORCID iD: 0000-0001-7180-1989

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Geng, JC., Cui, Z. & Gu, XS. Scatter search based particle swarm optimization algorithm for earliness/tardiness flowshop scheduling with uncertainty. Int. J. Autom. Comput. 13, 285–295 (2016). https://doi.org/10.1007/s11633-016-0964-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11633-016-0964-8

Keywords

Search

Navigation