10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Multi-objective Dynamic Scheduling Model of Flexible Job Shop Based on NSGAII Algorithm and Scroll Window Technology

      chapter-article

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The production process is often accompanied by a lot of disturbances, which make it difficult for flexible job shop to execute production according to the original job plan. It is necessary to dynamically adjust the production plan according to real-time conditions. To this end, this paper proposes a multi-objective dynamic scheduling model. In this model, scroll window technology and NSGAII algorithm is adopted to adapt the dynamic production evironment. A specific chromosome retention strategy and a variable objective selection mechanism are designed to ensure that the proposed model can select different objectives according to different disturbance events to solve the optimal solution. Finally, a case test is used to verify the feasibility and effectiveness of the model.

          Related collections

          Most cited references2

          • Record: found
          • Abstract: found
          • Article: not found

          Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm.

          In the practical production, after the completion of a job on a machine, it may be transported between the different machines. And, the transportation time may affect product quality in certain industries, such as steelmaking. However, the transportation times are commonly neglected in the literature. In this paper, the transportation time and processing time are taken as the independent time into the flexible job shop scheduling problem. The mathematical model of the flexible job shop scheduling problem with transportation time is established to minimize the maximum completion time. The FJSP problem is NP-hard. Then, an improved genetic algorithm is used to solve the problem. In the decoding process, an operation left shift insertion method according to the problem characteristics is proposed to decode the chromosomes in order to get the active scheduling solutions. The actual instance is solved by the proposed algorithm used the Matlab software. The computational results show that the proposed mathematical model and algorithm are valid and feasible, which could effectively guide the actual production practice.
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Multi-objective particle swarm optimisation for robust dynamic scheduling in a permutation flow shop

              Bookmark

              Author and article information

              Contributors
              ytan@pku.edu.cn
              shiyh@sustc.edu.cn
              tuba@np.ac.rs
              jhwang@tongji.edu.cn
              Journal
              978-3-030-53956-6
              10.1007/978-3-030-53956-6
              Advances in Swarm Intelligence
              Advances in Swarm Intelligence
              11th International Conference, ICSI 2020, Belgrade, Serbia, July 14–20, 2020, Proceedings
              978-3-030-53955-9
              978-3-030-53956-6
              22 June 2020
              : 12145
              : 435-444
              Affiliations
              [8 ]GRID grid.11135.37, ISNI 0000 0001 2256 9319, Peking University, ; Beijing, China
              [9 ]GRID grid.263817.9, Southern University of Science and Technology, ; Shenzhen, China
              [10 ]GRID grid.445150.1, ISNI 0000 0004 0466 4357, Singidunum University, ; Belgrade, Serbia
              GRID grid.24516.34, ISNI 0000000123704535, School of Mechanical Engineering, , Tongji University, ; Shanghai, 201804 China
              Article
              39
              10.1007/978-3-030-53956-6_39
              7354821
              cdf8d64c-9643-4cc8-bcd6-cc369f02e605
              © Springer Nature Switzerland AG 2020

              This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.

              History
              Categories
              Article
              Custom metadata
              © Springer Nature Switzerland AG 2020

              flexible job-shop,dynamic scheduling,evolutionary algorithm

              Comments

              Comment on this article