Distributed assembly type permutation flow shop scheduling optimization method and system

An optimization method and distributed technology, applied in control/regulation systems, general control systems, instruments, etc., can solve the problems of difficult implementation, large amount of calculation, low flexibility, etc., and achieve the goal of shortening the completion time and reducing energy consumption. Effect
CN110632907AActive Publication Date: 2019-12-31SHANDONG NORMAL UNIV

Patent Information

Authority / Receiving Office
CN Β· China
Patent Type
Applications(China)
Current Assignee / Owner
SHANDONG NORMAL UNIV
Publication Date
2019-12-31

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses a distributed assembly type permutation flow shop scheduling optimization method and system. The efficiency of a distributed permutation flow shop is increased; and the completion time and the energy consumption are reduced. The method comprises the steps of: with the purpose of reducing the minimum weight value of the completion time and the total energy consumption, constructing a distributed assembly type permutation flow shop optimization problem model with a crane; solving the distributed assembly type permutation flow shop optimization problem model with the craneby adopting an improved whale swarm algorithm, so that a scheduling optimization scheme is obtained; and scheduling work-pieces of various factories in the distributed assembly type permutation flowshop by utilizing the obtained scheduling optimization scheme.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the field of production scheduling, in particular to a scheduling optimization method and system for a distributed assembled replacement flow workshop transported with a crane. Background technique

[0002] The Distributed Permutation Flow Shop Scheduling Problem (DPFSP) is a typical optimization problem studied in recent years. In DPFSP, two tasks need to be completed, that is, to determine the allocation of each factory and the scheduling sequence of each factory. Each factory has N jobs assigned to the same factory and processed by m machines. Each factory has N jobs assigned to F identical factories and processed by m machines, where job transfer between factories is not allowed. In reality, they started with a distributed environment to minimize manufacturing and delivery costs. Pan et al. studied various different heuristics to minimize the total process time. Bargaoui et al. proposed a new chemical reaction optimizat...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More