University of SaskatchewanHARVEST
  • Login
  • Submit Your Work
  • About
    • About HARVEST
    • Guidelines
    • Browse
      • All of HARVEST
      • Communities & Collections
      • By Issue Date
      • Authors
      • Titles
      • Subjects
      • This Collection
      • By Issue Date
      • Authors
      • Titles
      • Subjects
    • My Account
      • Login
      JavaScript is disabled for your browser. Some features of this site may not work without it.
      View Item 
      • HARVEST
      • Edwards School of Business
      • Finance and Management Science
      • View Item
      • HARVEST
      • Edwards School of Business
      • Finance and Management Science
      • View Item

      A particle swarm optimisation for the no-wait flow shop problem with due date constraints.

      Thumbnail
      View/Open
      Main article (1.216Mb)
      Date
      2016
      Author
      Samarghandi, Hamed
      Publisher
      International Journal of Production Research
      Type
      Article
      Peer Reviewed Status
      Peer Reviewed
      Metadata
      Show full item record
      Abstract
      This paper considers the no-wait flow shop scheduling problem with due date constraints. In the no-wait flow shop problem, waiting time is not allowed between successive operations of jobs. Moreover, a due date is associated with the completion of each job. The considered objective function is makespan. This problem is proved to be strongly NP-Hard. In this paper, a particle swarm optimisation (PSO) is developed to deal with the problem. Moreover, the effect of some dispatching rules for generating initial solutions are studied. A Taguchi-based design of experience approach has been followed to determine the effect of the different values of the parameters on the performance of the algorithm. To evaluate the performance of the proposed PSO, a large number of benchmark problems are selected from the literature and solved with different due date and penalty settings. Computational results confirm that the proposed PSO is efficient and competitive; the developed framework is able to improve many of the best-known solutions of the test problems available in the literature.
      Citation
      Samarghandi, H., (2015), A particle swarm optimisation for the no-wait flow shop problem with due date constraints. International Journal of Production Research, 53(9): p. 2853-2870. https://doi.org/10.1080/00207543.2015.1007245
      URI
      http://hdl.handle.net/10388/11496
      Subject
      flow shop scheduling
      no-wait
      due date constraints
      makespan
      particle swarm optimization
      Collections
      • Finance and Management Science
      University of Saskatchewan

      University Library

      © University of Saskatchewan
      Contact Us | Disclaimer | Privacy