Skip to main content
SpringerLink
Log in

Research on job-shop scheduling optimization method with limited resources

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Job-shop scheduling is an important subject in the fields of production management and combinatorial optimization. It is also an urgent problem to be solved in actual production. It is usually difficult to achieve the optimal solution with classical methods, due to a high computational complexity (NP-Hard). According to the nature of job-shop scheduling, a solution based on a particle swarm optimiser (PSO) is presented in this paper. In addition to establishing a job-shop scheduling model based on PSO, we have researched the coding and optimized operation of PSO. We have also considered more suitable methods of coding and operation for job-shop scheduling as well as the target function and calculation of the proper figure. The software system of job-shop scheduling is developed according to the PSO algorithm. Test simulations illustrate that the PSO algorithm is a suitable and effective approach for solving the job-shop scheduling problem.

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. Xie X, Zhang W, Yang Z (2003) Summarizing PSO. Control and Decision-making 18(2):129–134

    Google Scholar 

  2. Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proc Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan

  3. Eberhart RC, Kennedy J (1995) Particles swarm optimization. In: IEEE International Conference on Neural Network, Perth, Australia

  4. Shi Y, Eberhart RC (2000) Empirical study of particle swarm optimization. Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, Orlando, FL, 1945–1950

  5. Fan L, Chang H, Zhu X (2005) A algorithm of job-shop scheduling and realization. CIMS 11(5):673–677

    Google Scholar 

  6. Zhang C, Yan P (1995) The nerve-net method for job-shop scheduling. Journal of Automation 21(6):706–712

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Northeastern Univesity, Shenyang, Liaoning, People’s Republic of China

    Liu Yongxian, Liu Xiaotian & Zhao Jinfu

  2. 319 Northeasten University, Wenhua Road 3-11 Heping District, Shenyang, 110004, China

    Liu Yongxian

Authors
  1. Liu Yongxian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liu Xiaotian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhao Jinfu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liu Yongxian.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yongxian, L., Xiaotian, L. & Jinfu, Z. Research on job-shop scheduling optimization method with limited resources. Int J Adv Manuf Technol 38, 386–392 (2008). https://doi.org/10.1007/s00170-007-1345-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-1345-9

Keywords

Search

Navigation