IDEAS home Printed from https://ideas.repec.org/a/wly/jnddns/v2016y2016i1n5413520.html

An Improved Multiobjective PSO for the Scheduling Problem of Panel Block Construction

Author

Listed:
  • Zhi Yang
  • Cungen Liu
  • Xuefeng Wang
  • Weixin Qian

Abstract

Uncertainty is common in ship construction. However, few studies have focused on scheduling problems under uncertainty in shipbuilding. This paper formulates the scheduling problem of panel block construction as a multiobjective fuzzy flow shop scheduling problem (FSSP) with a fuzzy processing time, a fuzzy due date, and the just‐in‐time (JIT) concept. An improved multiobjective particle swarm optimization called MOPSO‐M is developed to solve the scheduling problem. MOPSO‐M utilizes a ranked‐order‐value rule to convert the continuous position of particles into the discrete permutations of jobs, and an available mapping is employed to obtain the precedence‐based permutation of the jobs. In addition, to improve the performance of MOPSO‐M, archive maintenance is combined with global best position selection, and mutation and a velocity constriction mechanism are introduced into the algorithm. The feasibility and effectiveness of MOPSO‐M are assessed in comparison with general MOPSO and nondominated sorting genetic algorithm‐II (NSGA‐II).

Suggested Citation

  • Zhi Yang & Cungen Liu & Xuefeng Wang & Weixin Qian, 2016. "An Improved Multiobjective PSO for the Scheduling Problem of Panel Block Construction," Discrete Dynamics in Nature and Society, John Wiley & Sons, vol. 2016(1).
  • Handle: RePEc:wly:jnddns:v:2016:y:2016:i:1:n:5413520
    DOI: 10.1155/2016/5413520
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2016/5413520
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/5413520?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
    ---><---

    References listed on IDEAS

    as
    1. A. R. Rahimi-Vahed & S. M. Mirghorbani, 2007. "A multi-objective particle swarm for a flow shop scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 79-102, January.
    Full references (including those not matched with items on IDEAS)

    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. Nouha Nouri & Talel Ladhari, 2018. "Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking," Annals of Operations Research, Springer, vol. 267(1), pages 413-430, August.
    2. Dujuan Wang & Feng Liu & Yunqiang Yin & Jianjun Wang & Yanzhang Wang, 2015. "Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 967-981, November.
    3. Jianhui Mou & Xinyu Li & Liang Gao & Wenchao Yi, 2018. "An effective L-MONG algorithm for solving multi-objective flow-shop inverse scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 789-807, April.

    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:wly:jnddns:v:2016:y:2016:i:1:n:5413520. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/3059 .

    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.