Distributed flow shop scheduling method and system with batch delivery constraint

A workshop scheduling and distributed technology, applied in the direction of control/adjustment system, general control system, instrument, etc., can solve problems with many parameters and complexity

Active Publication Date: 2021-01-29
SHANDONG NORMAL UNIV
View PDF5 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In terms of algorithms, although many solutions to distributed flow workshops and even distributed flow workshop scheduling with batch delivery constraints have bee

Method used

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
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Distributed flow shop scheduling method and system with batch delivery constraint
  • Distributed flow shop scheduling method and system with batch delivery constraint
  • Distributed flow shop scheduling method and system with batch delivery constraint

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0052]Example one

[0053]This embodiment discloses a distributed flow shop scheduling method with batch delivery constraints. Regarding the distributed replacement flow shop and batch delivery problem (DFSP-BD), DFSP-BD, which combines DFSP and batch delivery to the customer process, is an optimization problem. DFSP-BD is used to solve the integration of production and distribution in DFSP. It has two steps: processing the job in the processing stage and delivering products in batches. The specific steps are asfigure 1 Shown.

[0054]In the processing stage, first, a group of jobs J1, J2, J3..., Jn are randomly assigned to F factory F1, F2, F3..., Ff, and no changes are allowed after assignment. Then, in a distributed factory, jobs are processed on m identical machines, M1, M2, M3,..., MM are in the same order, and the processing time of the first machine in the factory is 0. Finally, a machine can only process one job at the same time. Each job must be processed on the previous machine ...

Example Embodiment

[0148]Example two

[0149]The purpose of this embodiment is to provide a computing device, including a memory, a processor, and a computer program stored in the memory and capable of running on the processor. When the processor executes the program, the steps of the method in the above embodiment are implemented. .

Example Embodiment

[0150]Example three

[0151]The purpose of this embodiment is to provide a computer-readable storage medium.

[0152]A computer-readable storage medium having a computer program stored thereon, and when the program is executed by a processor, it executes the steps of the method in the foregoing embodiment.

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

PUM

No PUM Login to view more

Abstract

The invention provides a distributed flow shop scheduling method and system with a batch delivery constraint. The method comprises the steps of taking the minimization of manufacturing time and totalenergy consumption as a target, enabling the manufacturing time to comprise the time of a processing stage and the time of a batch delivery stage, and enabling the total energy consumption to be the energy consumption of a truck transportation stage, solving the target to obtain a generated factory allocation vector, a generated job priority vector and a generated batch allocation vector, and performing distributed flow shop scheduling according to the vectors, and realizing minimization of the manufacturing time and the total energy consumption.

Description

technical field [0001] The disclosure belongs to the technical field of flow shop scheduling, and in particular relates to a distributed flow shop scheduling method and system with batch delivery constraints. Background technique [0002] The statements in this section merely provide background information related to the present disclosure and do not necessarily constitute prior art. [0003] With the rapid development of the manufacturing industry, many enterprises began to consider multiple factories working at the same time, forming distributed scheduling (DS). In DS, the Distributed Flow Shop Scheduling Problem (DFSP) is the most widely studied problem. To solve the DFSP problem, optimization objectives, constraints and algorithms are proposed. Hatami et al. proposed order-based setting time constraints to solve distributed problems. Ji et al. study the no-wait constraint when the processing and assembly times are random. Rifai and Nguyen solve the allocation problem...

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

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G05B19/418
CPCG05B19/41865G05B2219/32252
Inventor 李庆华李俊青
Owner SHANDONG NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap