Schedule Planning Proceeding of Transfer Batches in Flexible Automated Lines While Sets are Forming and Limits are Recognized

K.V Krotov,E.N Zaikina,A.Y Drozin,S Bratan,S Roshchupkin

doi:10.1051/matecconf/202134603094

Abstract

The hierarchical approach while solving the problem of complex scheduling of transferred batches of units using flexible transfer lines is considered, when sets and time limits of flexible transfer lines are formed. Mathematical model of hierarchical game to optimize a mixture of transferred batches is developed. The groups of sets are processing during time intervals of definite lengths. The schedules of batches of units are optimized, using the mathematical model. The way of optimizing a mixture of groups of sets while resulting batches are formed, is developed.

Highlights

PRnpnjt li Т t ilj T lThe number of items i type in h transferred batches (TB)( h = 1,mi )
The output in high-mixed productions recognizes the processing of transferred batches (TB) using Flexible Automated Lines (FAL)
The modern development of approaches of complex scheduling of proceeding of TB in FAL is described by lack of optimizing methods to optimize the decision using structures and schedule of processes them in FTM, when the limits to size of task are not considered, and the methods with assurance of coming close to optimal decision, while different values of input https://doi.org/10.10 51/matecconf /202134603094 data are used

Summary

PRnpnjt li Т t ilj T l

The number of items i type in h TB( h = 1,mi ). Array of order of sequence of proceeding items of TB in FTP in FAL. Array of number of type i items in TB in π l obtaining positions j. Time of proceeding type i item in FTP l. Array of times of proceeding of items on FTP in FAL. Arrays of rearrangement of l FTP from type to type of items proceeding. The times of the beginning of proceeding q items in TB, taking j positions in proceeding sequence in FAL. The arrays of times of the beginning of proceeding items in TB, taking j positions in sequences of proceeding them in l FTP. The times of the beginning of proceeding in FAL the last items in TB taking in π l the j positions.

The values of t

Legend g g set n gset

Findings

Conclusion