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. 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.
    3. 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.
    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. Alatas, Bilal & Akin, Erhan, 2009. "Chaotically encoded particle swarm optimization algorithm and its applications," Chaos, Solitons & Fractals, Elsevier, vol. 41(2), pages 939-950.
    2. 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.
    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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Mohamad Javad Alizadeh & Davoud Ahmadyar & Ali Afghantoloee, 2017. "Improvement on the Existing Equations for Predicting Longitudinal Dispersion Coefficient," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(6), pages 1777-1794, April.
    11. Hong, Wei-Chiang, 2010. "Application of chaotic ant swarm optimization in electric load forecasting," Energy Policy, Elsevier, vol. 38(10), pages 5830-5839, October.
    12. Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.
    13. Laha, Dipak & Sarin, Subhash C., 2009. "A heuristic to minimize total flow time in permutation flow shop," Omega, Elsevier, vol. 37(3), pages 734-739, June.
    14. Jinn-Tong Chiu & Ching-Hai Lin, 2016. "A Modified Particle Swarm Optimization Based on Eagle Foraging Behavior," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 15(03), pages 703-727, May.
    15. Anouar Farah & Akram Belazi & Khalid Alqunun & Abdulaziz Almalaq & Badr M. Alshammari & Mohamed Bechir Ben Hamida & Rabeh Abbassi, 2021. "A New Design Method for Optimal Parameters Setting of PSSs and SVC Damping Controllers to Alleviate Power System Stability Problem," Energies, MDPI, vol. 14(21), pages 1-26, November.
    16. Naso, David & Surico, Michele & Turchiano, Biagio & Kaymak, Uzay, 2007. "Genetic algorithms for supply-chain scheduling: A case study in the distribution of ready-mixed concrete," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2069-2099, March.
    17. Peng, Bo & Liu, Bo & Zhang, Fu-Yi & Wang, Ling, 2009. "Differential evolution algorithm-based parameter estimation for chaotic systems," Chaos, Solitons & Fractals, Elsevier, vol. 39(5), pages 2110-2118.
    18. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    19. Alatas, Bilal & Akin, Erhan & Ozer, A. Bedri, 2009. "Chaos embedded particle swarm optimization algorithms," Chaos, Solitons & Fractals, Elsevier, vol. 40(4), pages 1715-1734.
    20. Sadeghian, Hamidreza & Wang, Zhifang, 2020. "A novel impact-assessment framework for distributed PV installations in low-voltage secondary networks," Renewable Energy, Elsevier, vol. 147(P1), pages 2179-2194.

    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.