IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v35y2008i5p851-861.html
   My bibliography  Save this article

A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan

Author

Listed:
  • Lian, Zhigang
  • Gu, Xingsheng
  • Jiao, Bin

Abstract

It is well known that the flow-shop scheduling problem (FSSP) is a branch of production scheduling and is NP-hard. Now, many different approaches have been applied for permutation flow-shop scheduling to minimize makespan, but current algorithms even for moderate size problems cannot be solved to guarantee optimality. Some literatures searching PSO for continuous optimization problems are reported, but papers searching PSO for discrete scheduling problems are few. In this paper, according to the discrete characteristic of FSSP, a novel particle swarm optimization (NPSO) algorithm is presented and successfully applied to permutation flow-shop scheduling to minimize makespan. Computation experiments of seven representative instances (Taillard) based on practical data were made, and comparing the NPSO with standard GA, we obtain that the NPSO is clearly more efficacious than standard GA for FSSP to minimize makespan.

Suggested Citation

  • Lian, Zhigang & Gu, Xingsheng & Jiao, Bin, 2008. "A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan," Chaos, Solitons & Fractals, Elsevier, vol. 35(5), pages 851-861.
    • Handle: RePEc:eee:chsofr:v:35:y:2008:i:5:p:851-861
    DOI: 10.1016/j.chaos.2006.05.082
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077906005388
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2006.05.082?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Allahverdi, Ali & Aldowaisan, Tariq, 2002. "New heuristics to minimize total completion time in m-machine flowshops," International Journal of Production Economics, Elsevier, vol. 77(1), pages 71-83, May.
    2. Nearchou, A.C.Andreas C., 2004. "The effect of various operators on the genetic search for large scheduling problems," International Journal of Production Economics, Elsevier, vol. 88(2), pages 191-203, March.
    3. Liu, Bo & Wang, Ling & Jin, Yi-Hui & Tang, Fang & Huang, De-Xian, 2005. "Improved particle swarm optimization combined with chaos," Chaos, Solitons & Fractals, Elsevier, vol. 25(5), pages 1261-1271.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zahra Beheshti & Siti Shamsuddin & Siti Yuhaniz, 2013. "Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems," Journal of Global Optimization, Springer, vol. 57(2), pages 549-573, October.
    2. Alatas, Bilal & Akin, Erhan, 2009. "Chaotically encoded particle swarm optimization algorithm and its applications," Chaos, Solitons & Fractals, Elsevier, vol. 41(2), pages 939-950.
    3. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Yi & Li, Xiaoping & Wang, Qian, 2009. "Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization," European Journal of Operational Research, Elsevier, vol. 196(3), pages 869-876, August.
    2. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    3. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    4. Ivona Brajević & Jelena Ignjatović, 2019. "An upgraded firefly algorithm with feasibility-based rules for constrained engineering optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2545-2574, August.
    5. Yu, Haiquan & Zhou, Jianxin & Si, Fengqi & Nord, Lars O., 2022. "Combined heat and power dynamic economic dispatch considering field operational characteristics of natural gas combined cycle plants," Energy, Elsevier, vol. 244(PA).
    6. Framinan, J. M. & Leisten, R., 2003. "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," Omega, Elsevier, vol. 31(4), pages 311-317, August.
    7. Wang, Jianzhou & Qin, Shanshan & Jin, Shiqiang & Wu, Jie, 2015. "Estimation methods review and analysis of offshore extreme wind speeds and wind energy resources," Renewable and Sustainable Energy Reviews, Elsevier, vol. 42(C), pages 26-42.
    8. Li, Xiaoping & Wang, Qian & Wu, Cheng, 2009. "Efficient composite heuristics for total flowtime minimization in permutation flow shops," Omega, Elsevier, vol. 37(1), pages 155-164, February.
    9. Xuanhu He & Wei Wang & Jiuchun Jiang & Lijie Xu, 2015. "An Improved Artificial Bee Colony Algorithm and Its Application to Multi-Objective Optimal Power Flow," Energies, MDPI, vol. 8(4), pages 1-26, March.
    10. Tseng, Lin-Yu & Lin, Ya-Tai, 2010. "A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 127(1), pages 121-128, September.
    11. K A H Kobbacy & S Vadera & M H Rasmy, 2007. "AI and OR in management of operations: history and trends," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 10-28, January.
    12. El-Shorbagy, M.A. & Mousa, A.A. & Nasr, S.M., 2016. "A chaos-based evolutionary algorithm for general nonlinear programming problems," Chaos, Solitons & Fractals, Elsevier, vol. 85(C), pages 8-21.
    13. Hossein Lotfi, 2022. "A Multiobjective Evolutionary Approach for Solving the Multi-Area Dynamic Economic Emission Dispatch Problem Considering Reliability Concerns," Sustainability, MDPI, vol. 15(1), pages 1-23, December.
    14. Zhang, Wen Yu & Hong, Wei-Chiang & Dong, Yucheng & Tsai, Gary & Sung, Jing-Tian & Fan, Guo-feng, 2012. "Application of SVR with chaotic GASA algorithm in cyclic electric load forecasting," Energy, Elsevier, vol. 45(1), pages 850-858.
    15. He, Qie & Wang, Ling & Liu, Bo, 2007. "Parameter estimation for chaotic systems by particle swarm optimization," Chaos, Solitons & Fractals, Elsevier, vol. 34(2), pages 654-661.
    16. Adel Taieb & Moêz Soltani & Abdelkader Chaari, 2017. "Parameter Optimization of MIMO Fuzzy Optimal Model Predictive Control By APSO," Complexity, Hindawi, vol. 2017, pages 1-11, October.
    17. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    18. Y N Sotskov & A Allahverdi & T-C Lai, 2004. "Flowshop scheduling problem to minimize total completion time with random and bounded processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 277-286, March.
    19. Yang, Dixiong & Li, Gang & Cheng, Gengdong, 2007. "On the efficiency of chaos optimization algorithms for global optimization," Chaos, Solitons & Fractals, Elsevier, vol. 34(4), pages 1366-1375.
    20. dos Santos Coelho, Leandro & Coelho, Antonio Augusto Rodrigues, 2009. "Model-free adaptive control optimization using a chaotic particle swarm approach," Chaos, Solitons & Fractals, Elsevier, vol. 41(4), pages 2001-2009.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:35:y:2008:i:5:p:851-861. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.