CN117314316A - Warehouse-in and warehouse-out scheduling method of customized furniture plate automatic sorting system - Google Patents
Warehouse-in and warehouse-out scheduling method of customized furniture plate automatic sorting system Download PDFInfo
- Publication number
- CN117314316A CN117314316A CN202311345178.5A CN202311345178A CN117314316A CN 117314316 A CN117314316 A CN 117314316A CN 202311345178 A CN202311345178 A CN 202311345178A CN 117314316 A CN117314316 A CN 117314316A
- Authority
- CN
- China
- Prior art keywords
- plate
- warehouse
- time
- sequence
- scheduling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 81
- 238000004806 packaging method and process Methods 0.000 claims abstract description 73
- 238000006243 chemical reaction Methods 0.000 claims abstract description 15
- 238000013178 mathematical model Methods 0.000 claims abstract description 15
- 238000005457 optimization Methods 0.000 claims abstract description 7
- 238000012545 processing Methods 0.000 claims description 61
- 238000003860 storage Methods 0.000 claims description 44
- 238000012546 transfer Methods 0.000 claims description 24
- 238000012856 packing Methods 0.000 claims description 15
- 238000003754 machining Methods 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 7
- 238000000605 extraction Methods 0.000 claims description 5
- 238000010845 search algorithm Methods 0.000 claims description 5
- 230000003247 decreasing effect Effects 0.000 claims description 4
- 230000002068 genetic effect Effects 0.000 claims description 4
- 238000005304 joining Methods 0.000 claims description 3
- 238000013519 translation Methods 0.000 claims description 3
- 239000000463 material Substances 0.000 abstract description 4
- 238000004519 manufacturing process Methods 0.000 description 4
- 238000005520 cutting process Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000005034 decoration Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/067—Enterprise or organisation modelling
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
Abstract
The invention relates to the technical field of sorting and scheduling, in particular to a warehouse-in and warehouse-out scheduling method of an automatic sorting system for customized furniture plates, which comprises the following steps: aiming at the problem of joint dispatching of warehouse in and warehouse out with limited buffer area and constraint of packaging priority sequence in an automatic sorting system, constructing a mathematical model of the problem; solving a mathematical model of the problem by adopting a multi-stage heuristic algorithm to obtain an optimal solution of the problem; the multi-stage heuristic algorithm comprises a buffer constraint conversion heuristic algorithm, an insert time algorithm and an ex-warehouse scheduling algorithm. The invention solves the problems that the existing joint scheduling optimization problem of material warehouse-in and warehouse-out is solved by adopting an intelligent algorithm, but the intelligent algorithm is difficult to quickly generate a scheduling scheme in a short time.
Description
Technical Field
The invention relates to the technical field of sorting and scheduling, in particular to a warehouse-in and warehouse-out scheduling method of an automatic sorting system for customized furniture plates.
Background
As the personalized demands of people on home decoration scenes are increasing, the panel furniture manufacturing industry is gradually realizing transformation and upgrading from manual or semi-automatic to automatic and informative. The production process of the customized furniture plate comprises three links of cutting, selecting and packing, wherein the cutting processing link is used for producing according to the process of the product; the sorting link comprises two parts of warehousing and ex-warehouse, and is realized by a sorting system, the plates are distributed to corresponding sorting units after finishing the last processing procedure, a sorting machine performs warehousing temporary storage on the plates in a limited warehousing buffer zone, and when all the plates in the order are warehoused, the sorting machine takes out the plates according to a designated sequence; and finally, carrying out packing treatment on the plate in a packing area.
According to the difference of the degree of automation, the sorting system is divided into an automatic sorting system which is not widely applied and a traditional manual sorting system, the automatic sorting system mainly solves the scheduling optimization problem of material warehouse entry and warehouse exit, for the problem, the existing research mainly adopts model simulation or heuristic algorithm to solve the problem, the automatic sorting system also needs to solve the joint scheduling optimization problem of material warehouse entry and warehouse exit, for the problem, the existing research mainly adopts intelligent algorithms, such as genetic field search algorithm (GA-VNS), ant colony Algorithm (ACO), particle swarm algorithm (PSO), TABU search algorithm (TABU) and the like to solve the scheduling scheme, however, for solving the custom-board furniture production scene, the intelligent algorithm is difficult to quickly generate a scheduling scheme in a short time.
Disclosure of Invention
Aiming at the defects, the invention provides a warehouse-in and warehouse-out scheduling method of an automatic sorting system for customized furniture plates, which aims to solve the problem that an intelligent algorithm is adopted to solve a scheduling scheme for the existing joint scheduling optimization problem of material warehouse-in and warehouse-out, but the intelligent algorithm is difficult to quickly generate a scheduling scheme in a short time.
To achieve the purpose, the invention adopts the following technical scheme:
A warehouse-in and warehouse-out scheduling method of a customized furniture plate automatic sorting system comprises the following steps:
step S1: aiming at the problem of joint dispatching of warehouse in and warehouse out with limited buffer area and constraint of packaging priority sequence in an automatic sorting system, constructing a mathematical model of the problem;
step S2: solving a mathematical model of the problem by adopting a multi-stage heuristic algorithm to obtain an optimal solution of the problem; the multi-stage heuristic algorithm comprises a buffer constraint conversion heuristic algorithm, an insert time algorithm and an ex-warehouse scheduling algorithm.
Preferably, in step S1, constructing a mathematical model of the problem specifically includes the steps of:
constructing an objective function, wherein the expression of the objective function is as follows:
min f＝min (α*max (C i4 )+(1-α)*max(C i2 ))； (1)
wherein the objective function has the following constraint conditions:
wherein alpha represents the weight of the optimization target occupied by the time of finishing the package; 1-alpha represents the weight occupied by the time of completion of the warehouse; i and j each represent an index of a plate number; h represents the buffer capacity; n represents the total number of the plates; k represents a stage index, and 1,2,3 and 4 represent the stages of warehousing, ex-warehouse, confluence transfer and packaging respectively in the stage index; p (P) ik Representing the processing time of the plate i in the k stage; c (C) ik Representing the finishing time of the plate i in the k stage; m is m k Representing the number of machines in the k-stage; t (T) k-1,k Representing the transit time generated between the k-1 stage and the k stage; r is R ik Representing the arrival time of the plate i at the k stage; b (B) i The number of the plate immediately after the plate i in the specified packaging sequence is represented, and if the current plate is the last plate in the order packaging task, the current plate is numbered; o (O) i Plate number O representing plate i; f represents a positive number; v (V) ijmk Representing that on the machine m of the kth stage, the plate i is processed before the plate j; v (V) iimk Representing that on the machine m of the kth stage, the plate i itself is processed; v (V) jimk Representing that on machine m at the kth stage, plate j is processed before plate i; d (D) imk Indicating that at the kth stage the panel i is assigned to the machine m for processing; s is S ik Representing the start machining time of the workpiece i in the kth stage; s is S jk Indicating the start machining time of the workpiece j in the kth stage;representing the processing of the plate Bi on the k-stage apparatus m; />Representing that in the k-th stage the plate i is processed earlier than the plate Bi on the apparatus m; r is R i+h,k Indicating the arrival time of the buffer zone of the ith+h plate of the plate at the kth stage; d (D) i+b,mk Representing the processing of the plate i+b on the k-stage apparatus m; r is R i+h+1,k Indicating the arrival time of the (i+h+1) th plate at the buffer zone of the k-th plate; s is S I,k Representing the start machining time of the workpiece i in the kth stage; d (D) i+h+1,mk Representing the plate i+h+1 being processed on the k-th stage apparatus m.
Preferably, in step S2, the following substeps are specifically included:
step S21: assembling the plates to be put in storage O p According to the arrival time r of the plate i Descending and sequencing to obtain a scheduling sequence PQ to be put in storage;
step S22: respectively calculating earliest warehousing start time EST of each plate in the scheduling sequence PQ to be warehoused by utilizing a buffer zone constraint conversion heuristic algorithm i And a latest binnable start time LST i ；
Step S23: determining a first plate PQ to be binned into a scheduling sequence PQ using an insert time algorithm 1 Is the warehouse entry start time of (a)And ending time->And schedule sequence PQ and order to be put in warehouse>Number of boards put in storageUpdating;
step S24: determining an orderThe number of plates already put in storage->And (4) order->Number of plates in (3)If so, executing step S25; if not, executing step S23;
step S25: respectively calculating plate set O to be subjected to ex-warehouse scheduling by adopting an ex-warehouse scheduling algorithm D Delivery start time of delivery plateDelivery end time->Start time of packing operation +.>End timeBeginning time of confluence transfer- >And end time of confluence transfer->
Step S26: judging whether the scheduling sequence PQ to be put in storage is an empty set or not, if so, ending the processing; otherwise, with the first plateOn the same machineEarliest binnable start time than first plate PQ 1 End time of->Small plate, with earliest warehouse-in start time of +.>Then the scheduling sequence PQ to be put in storage is set at the earliest possible start time EST of each plate i The order is sorted without decreasing, and step S23 is performed.
Preferably, in step S22, the following substeps are specifically included:
step S221: adopting buffer zone constraint conversion heuristic algorithm to make arrival time r of every plate i For earliest binnable start time IEST i Collecting plates to be put into storage O P According to the arrival time r of each plate i Sorting from large to small to obtain a scheduling sequence PQ to be put in a warehouse of each sorting machine and a plate warehousing processing time P, wherein N is in the scheduling sequence PQ to be put in a warehouse 0 A block plate;
step S222: taking the boards from the front to the back in the scheduling sequence PQ to be put into storage, and calculating the latest warehouse-in start time ILST of the boards i Let cursor c=1;
step S223: making the sorting machine set MS, judging whether the sorting machine set MS is empty, if yes, ending the processing, otherwise, selecting a machine mE MS, updating the sorting machine set MS, and executing step S224;
Step S224: judging the number N of the plates in the scheduling sequence PQ to be put in storage 0 If equal to c, executing step S223, otherwise, taking the c-th plate J from the scheduling sequence PQ to be put in storage c The buffer capacity is b;
step S225: judging whether c is smaller than b+1, if so, warehousing a c-th plate J in a scheduling sequence PQ c Latest warehouse entry start time ILST c Equal to the maximum value in the interval, step S227 is performed; otherwise, step S226 is performed;
step S226: if c=b+1, then the warehouse is to be reservedC-th plate J in scheduling sequence PQ c Latest warehouse entry start time ILST c For arrival time r of first plate in scheduling sequence PQ to be put in storage 1 And performs step S227; otherwise, the c-th plate J in the scheduling sequence PQ to be put in storage v Latest warehouse entry start time ILST v The method comprises the following steps: arrival time r of c-b-th plate in scheduling sequence PQ to be put in storage v-b Arrival time of c-b-1 th plate and c-th plate J c Is a warehouse entry processing time r c-b-1 -P c The difference between the latest warehouse-in time of the c-1 th plate and the c-th plate J c Difference ILST between warehouse entry processing times c-1 -P c The minimum of the three values;
step S227: let c=c+1.
Preferably, in step S23, the following substeps are specifically included:
step S231: the earliest warehouse-in start time of the plate is IEST i The earliest warehousing ending time is IEED i Plate J i The processing time of (2) is P i The three satisfy the following relations: IEED (electronic identification device) i ＝IEST i +P i ；
Judging the current plate J k Is a delivery time interval of (a) and IEST i And IEED i Whether the intervals between the two are coincident;
wherein there are three cases, namely IEST i At the current plate J k During the delivery time interval of IEED i At the current plate J k During the delivery time interval of (2) and IEST i And latest warehouse-in start time ILST of plate i Are all at the current plate J k Is in the time interval of the warehouse-out;
if there is coincidence, plate J i Is the start time IST of warehouse entry i ＝IEST i Warehouse entry end time IED i ＝IEED i And ending the process; otherwise, step S232 is performed;
step S232: judging plate J i Is a warehouse-in time interval, i.e. IEST i And ILST i With or without idle time in the interval between, if any, with idle timeThe start time of the maximum period of time is taken as the panel J i Is the start time IST of warehouse entry i And ending the process; otherwise, step S233 is performed;
step S233: judging plate J i The longest warehouse-in time interval of (i.e. IEST) i ILED by the latest warehouse-in end time of the plate i If the idle time is longer than the interval between the plates J i Processing time P of (2) i And ends the processing with the start time of the first free period as the board J i Is the start time IST of warehouse entry i The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, S234 is performed;
step S234: if no idle time period for inserting the warehouse-in task exists, the warehouse-out priority principle is followed, and the warehouse-out finishing time OED is selected d Maximum, and less than or equal to the latest binnable start time ILST i Plate J of (2) d OED of (2) d As panel J i Is the start time IST of warehouse entry i ；
Step S235: let the start time OST of going out of warehouse U Minimum and greater than or equal to the latest warehouse-in end time ILST of the plate i Plate J of (2) U As the first affected plate, the plate package sequence is OBQ mb Currently processing plate J i Sorting machine warehouse-out priority order is sq 2 The method comprises the steps of carrying out a first treatment on the surface of the All of the ex-warehouse tasks O affected on each machine out And warehouse-in task O in Identified by an affected process translation (Affected Operations Rescheduling, AOR) algorithm and O is determined out And O in The start time and the end time of the warehouse-in and warehouse-out of the inner plate are shifted backwards, and the amount of the shifted-backward time is IED i -OST U The method comprises the steps of carrying out a first treatment on the surface of the If the time is shifted backward O in And if the warehouse-in starting time IST of the inner plate exceeds the latest warehouse-in starting time ILST, the plate is returned to the scheduling sequence PQ to be warehouse-in again for rescheduling operation.
Preferably, in step S25, the following substeps are specifically included:
step S251: determining a set of boards O to be dispatched from a warehouse using a longest process time priority rule (Longest Process Time, LPT) D And initial packaging sequence of the warehouse-out plateColumn, and iterating the initial packaging sequence of the ex-warehouse plate by using a genetic domain search algorithm (GA-VNS);
step S252: determining the time of the delivery and starting of the delivery plate in the sorting machine, setting the initial packaging sequence of the delivery plate as the initial delivery sequence, and obtaining the delivery time of the delivery plate by using a transfer bottleneck algorithm (Shifting Bottleneck Heuristic, SBH);
step S253: and determining the confluence sequence of the delivery plates in the confluence transfer stage, and obtaining the working time of each delivery plate on the confluence transfer machine by utilizing a first available machine (First Available Machine, FAM) algorithm.
Preferably, in step S251, the set O of boards to be dispatched from the warehouse is determined using the longest process time priority rule (Longest Process Time, LPT) D And an initial packaging sequence of the ex-warehouse plate, comprising in particular the following sub-steps:
step S2511: determining an initial rescheduling moment ct=c imax Wherein C imax The current maximum warehouse entry completion time is set; determining a plate to be dispatched, wherein the plate to be dispatched comprises a plate B which is dispatched and has a time of starting to dispatch greater than or equal to ct 1 Order plate B which is currently put in storage and not scheduled out of warehouse 2 ；
Step S2512: pair B 2 The following treatment is carried out:
the total time t of each packaging task of the order processing is obtained i The method comprises the steps of carrying out a first treatment on the surface of the According to t i Sequencing the packaging tasks in a non-increasing order to obtain a packaging task sequence bq;
step S2513: rearranging the plates in the packaging task sequence BQ according to the appointed stacking sequence to obtain a new packaging task sequence BQ;
step S2514: the first wrapping task BQ is repeatedly fetched from the new wrapping task sequence BQ 1 Is allocated to the total processing time S at this time mb On the smallest baling press mb, the total processing time S of baling press mb is updated mb Packaging sequence SBQ of a packaging machine mb mb And a new wrapping task sequence BQ, and judges that the new wrapping task sequence BQ isIf not, the step S2515 is executed, otherwise, the step S2514 is executed continuously;
step S2515: let the warehouse-out plate with the warehouse-out start time smaller than ct be B 3 Find B 3 Packaging sequence SBQ at each packer mb mb Plate LSQ positioned furthest back mb The method comprises the steps of carrying out a first treatment on the surface of the And build set O L Wherein, set O L Packaging sequence SBQ comprising a respective packaging machine mb mb Head panel to panel LSQ of (C) mb All the plates in between; and determine if ct is less than set O L Maximum delivery completion time C for middle plate omax If yes, let ct=c omax And update B 1 And O L Otherwise, obtaining a plate set O to be subjected to ex-warehouse scheduling D Packing sequence OBQ of delivery plate in each packer mb I.e. the initial packaging sequence of the exiting plate.
Preferably, in step S252, the following substeps are specifically included:
step S2521: initializing a sorter set MS and sorting the sorted sorter set M 0 Setting aside;
step S2522: selecting a sorting machine with the longest total plate ex-warehouse processing time as a bottleneck machine m p Wherein m is p ∈M-M 0 M represents a set of machines;
step S2523: obtaining a bottleneck machine m based on a single machine problem solving algorithm p The warehouse-out sequence of the upper plate; and redundant virtual arcs on the extracted graph are deleted, and the bottleneck machine m p Joining a set M of sorting machines that have completed the dispatch 0 Obtaining a new sorting machine set M with completed dispatching 0 The method comprises the steps of carrying out a first treatment on the surface of the Wherein the extraction graph is used for representing a plate set O to be subjected to ex-warehouse scheduling D Scheduling problems of the middle warehouse-out plate;
step S2524: determining whether the sorter set MS is equal to the new, scheduled sorter set M 0 If yes, obtaining a plate set O to be subjected to ex-warehouse scheduling D Time for starting to leave warehouse of middle warehouse-out plateAnd ending the time of deliveryIf not, step S2522 is performed.
Preferably, in step S253, the following substeps are specifically included:
step S2531: plate set O based on to-be-ex-warehouse scheduling D Time for starting to leave warehouse of middle warehouse-out plateAnd according to the formula R i,3 ＝S i,2 +P i,2 +T i,2,3 Obtaining the time of the warehouse-out plate to reach the confluence transfer machine; wherein, the time that the warehouse plate arrives at the confluence transfer machine is represented; s is S i,2 Indicating the start-up time of the warehouse-out plate, < >>P i,2 The processing time of the plate out of the warehouse during the warehouse out is represented; t (T) i,2,3 The transportation time of the plate ex-warehouse between the ex-warehouse stage and the confluence stage is set;
step S2532: time R for delivering warehouse plate to confluence transfer machine i,2 Sorting the warehouse-out plates in the order which is not reduced to obtain a sequence S;
step S2533: the earliest machine that starts working of the first unscheduled plate in the sequence S is assigned to the plate until the plates in the sequence S are all discharged.
The technical scheme provided by the embodiment of the application can comprise the following beneficial effects:
according to the scheme, the multi-stage heuristic algorithm is adopted to solve the joint scheduling problem of the warehouse in and out with the limited buffer area and the constraint of the packaging priority sequence, and combines the intelligent algorithm with the heuristic algorithm, so that compared with the traditional method for solving by using the intelligent algorithm singly, the time for searching solutions is shortened, the solving time is within an acceptable range, a scheduling scheme can be generated in a short time, and the overall efficiency of warehouse in and out sorting of the plate-type custom furniture enterprises is improved.
Drawings
FIG. 1 is a flow chart of steps of a method for warehouse-in and warehouse-out scheduling for an automated custom furniture plate sorting system;
FIG. 2 is a multi-stage heuristic flow chart;
fig. 3 is a schematic diagram of one embodiment of the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are exemplary only for explaining the present invention and are not to be construed as limiting the present invention.
A warehouse-in and warehouse-out scheduling method of a customized furniture plate automatic sorting system comprises the following steps:
step S1: aiming at the problem of joint dispatching of warehouse in and warehouse out with limited buffer area and constraint of packaging priority sequence in an automatic sorting system, constructing a mathematical model of the problem;
step S2: solving a mathematical model of the problem by adopting a multi-stage heuristic algorithm to obtain an optimal solution of the problem; the multi-stage heuristic algorithm comprises a buffer constraint conversion heuristic algorithm, an insert time algorithm and an ex-warehouse scheduling algorithm.
In the method, as shown in fig. 1, the first step is to construct a mathematical model of a problem aiming at the problem of joint warehouse-in scheduling with limited buffer and packing priority constraint in an automatic sorting system, specifically, the problem of joint warehouse-in scheduling with limited buffer and packing priority constraint in the existing automatic sorting system, and in one embodiment, as shown in fig. 2, the problem is described by a certain automatic sorting production line example, and the existing c orders o= { O h I1 is not less than h is not less than c, and each order has Z packaging tasks Z= { Z } u I1 is not less than u is not less than z, and each packing task comprises j plates q= { q i |1≤i≤j }. A plurality of plates form a packaging task, and a plurality of packaging tasks form an order. Plate q i Four stages of K= { K are needed to be put in and put out of warehouse, combined and transferred and packaged k 1 is less than or equal to k is less than or equal to 4, and each stage is provided with corresponding p equivalent parallel machines M= { M mk The plate is processed by m is smaller than or equal to 1 and smaller than or equal to p, and machines in adjacent stages are connected through a conveying belt. The key to the above problem is to sequentially constrain the assignment of the tasks of the machine at each stage and to determine the start processing time and the completion time of each task, and to complete the packaging tasks of all orders in as short a time as possible, so that the weighted sum of the maximum package completion time of the board and the maximum delivery completion time of the board is as small as possible. By constructing a mathematical model of the joint dispatch problem of the in-out warehouse with limited buffer and packaging priority constraints, the problem is convenient to analyze subsequently. The second step is to solve the mathematical model of the problem by adopting a multi-stage heuristic algorithm to obtain the optimal solution of the problem; the multi-stage heuristic algorithm comprises a buffer constraint conversion heuristic algorithm, an insert time algorithm and an ex-warehouse scheduling algorithm. In this embodiment, the optimal solution of the problem is actually an in-out warehouse scheduling scheme, and a multi-stage heuristic algorithm is adopted to solve the mathematical model of the problem, and combines an intelligent algorithm and a heuristic algorithm, so that compared with the traditional solution by singly using the intelligent algorithm, the solution searching time is shortened, the solution time is within an acceptable range, and a scheduling scheme can be generated in a short time, so that the overall efficiency of in-out warehouse sorting of the plate-type custom furniture enterprise is improved.
Preferably, in step S1, constructing a mathematical model of the problem specifically includes the steps of:
constructing an objective function, wherein the expression of the objective function is as follows:
min f＝min(α*max(C i4 )+(1-α)*max(C i2 ))； (1)
wherein the objective function has the following constraint conditions:
wherein alpha represents the weight of the optimization target occupied by the time of finishing the package; 1-alpha represents the weight occupied by the time of completion of the warehouse; i and j each represent an index of a plate number; h represents the buffer capacity; n represents the total number of the plates; k represents a stage index, and 1,2,3 and 4 represent the stages of warehousing, ex-warehouse, confluence transfer and packaging respectively in the stage index; p (P) ik Representing the processing time of the plate i in the k stage; c (C) ik Representing the finishing time of the plate i in the k stage; m is m k Representing the number of machines in the k-stage; t (T) k-1,k Representing the transit time generated between the k-1 stage and the k stage; r is R ik Representing the arrival time of the plate i at the k stage; b (B) i The number of the plate immediately after the plate i in the specified packaging sequence is represented, and if the current plate is the last plate in the order packaging task, the current plate is numbered; o (O) i Plate number O representing plate i; f represents a positive number; v (V) ijmk Representing that on the machine m of the kth stage, the plate i is processed before the plate j; v (V) iimk Machine indicated in the kth stageOn the device m, the plate i is processed by itself; v (V) jimk Representing that on machine m at the kth stage, plate j is processed before plate i; d (D) ikmk Indicating that at the kth stage the panel i is assigned to the machine m for processing; s is S ik Representing the start machining time of the workpiece i in the kth stage; s is S jk Indicating the start machining time of the workpiece j in the kth stage;representing the processing of the plate Bi on the k-stage apparatus m; />Representing that in the k-th stage the plate i is processed earlier than the plate Bi on the apparatus m; r is R i+h,k Indicating the arrival time of the buffer zone of the ith+h plate of the plate at the kth stage; d (D) i+b,mk Representing the processing of the plate i+b on the k-stage apparatus m; r is R i+h+1,k Indicating the arrival time of the (i+h+1) th plate at the buffer zone of the k-th plate; s is S I,k Representing the start machining time of the workpiece i in the kth stage; d (D) i+h+1,mk Representing the plate i+h+1 being processed on the k-th stage apparatus m.
In this embodiment, the objective function is the objective to be optimized by the subsequent multi-stage heuristic algorithm, so as to solve the problem of joint dispatch of the warehouse in and out with limited buffer area and package priority constraint in the automatic sorting system.
Further, in the above formulae, the formula (1) is an objective function value; the formula (2) shows that in the stages 2, 3 and 4, the plate is not in a tight front-to-back relationship; formulas (3) (4) represent that the plate is treated at stages 2, 3, 4 at most before or immediately after another plate; formula (5) indicates that panel j is either treated prior to panel i or is treated immediately after panel i in stages 2, 3, 4, or vice versa; formula (6) represents that each machine in stages 2, 3 and 4 can only process one plate at a time; formula (7) shows that each plate can be processed by only one machine in 2 and 3 stages; formula (8) represents that if a machine receives an assigned plate to be processed in stages 2, 3 and 4, the machine must have a relationship between the plate immediately after and immediately before; the formulas (9) and (10) show that the plates in the stages 1, 2, 3 and 4 are sequentially processed by a machine, and the current plate can be processed only after the plate is processed just before the current plate is processed; the method comprises the steps that (11) after all plates in a certain order are put in storage, the plates can be put out of the storage; formulas (12) (13) provide that in the fourth stage, if the plates are affiliated to the same order, the plates are processed according to the specified priority constraint; equation (14) provides that at each stage the arrival time of the panel must not be later than the start-up time of the panel; the formula (15) represents the finishing time of the plate as the sum of the starting time and the processing time; equation (16) represents that in stages 3 and 4, the arrival time of the panel is equal to the sum of the finishing time and the transportation time of the last stage, wherein the transportation time of stages 1 to 2 is not a constant value; equation (17) (18) indicates that the number of boards in the warehouse entry buffer does not exceed the buffer capacity.
Preferably, in step S2, the method specifically comprises the following substeps:
step S21: assembling the plates to be put in storage O p According to the arrival time r of the plate i Descending and sequencing to obtain a scheduling sequence PQ to be put in storage;
step S22: respectively calculating earliest warehousing start time EST of each plate in the scheduling sequence PQ to be warehoused by utilizing a buffer zone constraint conversion heuristic algorithm i And a latest binnable start time LST i ；
Step S23: determining a first plate PQ to be binned into a scheduling sequence PQ using an insert time algorithm 1 Is the warehouse entry start time of (a)And ending time->And schedule sequence PQ and order to be put in warehouse>Number of boards put in storageUpdating;
step (a)S24: determining an orderThe number of plates already put in storage->And (4) order->Number of plates in (3)If so, executing step S25; if not, executing step S23;
step S25: respectively calculating plate set O to be subjected to ex-warehouse scheduling by adopting an ex-warehouse scheduling algorithm D Delivery start time of delivery plateDelivery end time->Start time of packing operation +.>End timeBeginning time of confluence transfer->And end time of confluence transfer->
Step S26: judging whether the scheduling sequence PQ to be put in storage is an empty set or not, if so, ending the processing; otherwise, with first plate PQ 1 At the same machine and at an earliest start time of warehouse entry than the first plate PQ 1 End time of (2)Small plate, with earliest warehouse-in start time of +.>Then the scheduling sequence PQ to be put in storage is set at the earliest possible start time EST of each plate i The order is sorted without decreasing, and step S23 is performed.
The problem that the plate needs to be put in and put out is solved by dividing the joint scheduling problem of the warehouse-in and warehouse-out with the constraint of the limited buffer area and the packaging priority sequence, the sequence of the sorting machine for processing the two tasks is reasonably and preferentially arranged, and the condition that the warehouse-in plate waits for a long time in the warehouse-in buffer area is reduced or prevented, so that the aim that the warehouse-in buffer area is not blocked is fulfilled. After the two-dimensional order plates are all put in storage and sleeved, the plate delivery and packaging tasks are reasonably distributed, the starting delivery time of the plates in the sorting area is determined, and the plates reach the packer according to the stacking sequence. As shown in fig. 2, in this embodiment, a multi-stage heuristic algorithm is used to solve the problem, where the multi-stage heuristic algorithm includes two parts of warehouse-in buffer scheduling and warehouse-out scheduling, and the function of the warehouse-in buffer scheduling part in the algorithm is to solve the problem one, specifically, a buffer constraint conversion heuristic algorithm and an insert time algorithm are used; the function of the ex-warehouse scheduling part in the algorithm is to solve the second problem, and specifically, the ex-warehouse scheduling algorithm is adopted.
Preferably, in step S22, the following substeps are specifically included:
step S221: adopting buffer zone constraint conversion heuristic algorithm to make arrival time r of every plate i For earliest binnable start time IEST i Collecting plates to be put into storage O P According to the arrival time r of each plate i Sorting from large to small to obtain a scheduling sequence PQ to be put in a warehouse of each sorting machine and a plate warehousing processing time P, wherein N is in the scheduling sequence PQ to be put in a warehouse 0 A block plate;
step S222: from waiting to be inThe boards are fetched from front to back in the library scheduling sequence PQ, and the latest warehousing start time ILST of the boards is calculated i Let cursor c=1;
step S223: making the sorting machine set MS, judging whether the sorting machine set MS is empty, if yes, ending the processing, otherwise, selecting a machine mE MS, updating the sorting machine set MS, and executing step S224;
step S224: judging the number N of the plates in the scheduling sequence PQ to be put in storage 0 If equal to c, executing step S223, otherwise, taking the c-th plate J from the scheduling sequence PQ to be put in storage c The buffer capacity is b;
step S225: judging whether c is smaller than b+1, if so, warehousing a c-th plate J in a scheduling sequence PQ c Latest warehouse entry start time ILST c Equal to the maximum value in the interval, step S227 is performed; otherwise, step S226 is performed;
step S226: if c=b+1, then the c-th plate J in the scheduling sequence PQ is to be put in c Latest warehouse entry start time ILST c For arrival time r of first plate in scheduling sequence PQ to be put in storage 1 And performs step S227; otherwise, the c-th plate J in the scheduling sequence PQ to be put in storage c Latest warehouse entry start time ILST c The method comprises the following steps: arrival time r of c-b-th plate in scheduling sequence PQ to be put in storage c-b Arrival time of c-b-1 th plate and c-th plate J c Is a warehouse entry processing time r c-b-1 -P c The difference between the latest warehouse-in time of the c-1 th plate and the c-th plate J c Difference ILST between warehouse entry processing times c-1 -P c The minimum of the three values;
step S227: let c=c+1.
In this embodiment, in order to solve the above-mentioned problem, the board will pass through a warehouse-in buffer area before warehouse-in, the buffer area is limited, and the board in the buffer area will be distributed to the sorting machine for warehouse-in based on the First Come First Serve (FCFS) principle. If the plate is not put in the warehouse in time, the plate stays in the warehouse in buffer area for a period of time, so that the buffer area is possibly blocked. Therefore, the scheme provides a buffer zone constraint conversion heuristic algorithm, which solves the problems and determines the warehousing start time of the plate. In order to prevent the buffer from blocking, the buffer constraint conversion heuristic algorithm converts the limited buffer capacity constraint into a specified plate to be put in storage in a warehouse-in time interval.
Preferably, in step S23, the method specifically includes the following substeps:
step S231: the earliest warehouse-in start time of the plate is IEST i The earliest warehousing ending time is IEED i Plate J i The processing time of (2) is P i The three satisfy the following relations: IEED (electronic identification device) i ＝IEST i +P i ；
Judging the current plate J k Is a delivery time interval of (a) and IEST i And IEED i Whether the intervals between the two are coincident;
wherein there are three cases, namely IEST i At the current plate J k During the delivery time interval of IEED i At the current plate J k During the delivery time interval of (2) and IEST i And latest warehouse-in start time ILST of plate i Are all at the current plate J k Is in the time interval of the warehouse-out;
if there is coincidence, plate J i Is the start time IST of warehouse entry i ＝IEST i Warehouse entry end time IED i ＝IEED i And ending the process; otherwise, step S232 is performed;
step S232: judging plate J i Is a warehouse-in time interval, i.e. IEST i And ILST i In the interval between, there is an idle time, if any, the starting time of the time zone with the maximum idle time is taken as the plate J i Is the start time IST of warehouse entry i And ending the process; otherwise, step S233 is performed;
step S233: judging plate J i The longest warehouse-in time interval of (i.e. IEST) i ILED by the latest warehouse-in end time of the plate i If the idle time is longer than the interval between the plates J i Processing time P of (2) i And ending the processing with the start time of the first idle period as the plateJ i Is the start time IST of warehouse entry i The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, S234 is performed;
step S234: if no idle time period for inserting the warehouse-in task exists, the warehouse-out priority principle is followed, and the warehouse-out finishing time OED is selected d Maximum, and less than or equal to the latest binnable start time ILST i Plate J of (2) d OED of (2) d As panel J i Is the start time IST of warehouse entry i ；
Step S235: let the start time OST of going out of warehouse U Minimum and greater than or equal to the latest warehouse-in end time ILST of the plate i Plate J of (2) U As the first affected plate, the plate package sequence is OBQ mb Currently processing plate J i Sorting machine warehouse-out priority order is sq 2 The method comprises the steps of carrying out a first treatment on the surface of the All of the ex-warehouse tasks O affected on each machine out And warehouse-in task O in Identified by an affected process translation (Affected Operations Rescheduling, AOR) algorithm and O is determined out And O in The start time and the end time of the warehouse-in and warehouse-out of the inner plate are shifted backwards, and the amount of the shifted-backward time is IED i -OST U The method comprises the steps of carrying out a first treatment on the surface of the If the time is shifted backward O in And if the warehouse-in starting time IST of the inner plate exceeds the latest warehouse-in starting time ILST, the plate is returned to the scheduling sequence PQ to be warehouse-in again for rescheduling operation.
In this embodiment, the warehouse-in start time interval of the plate is determined through the buffer zone constraint conversion heuristic algorithm, but there is idle time in the scheduling scheme, and the overall efficiency of the system can be improved by reasonably utilizing the idle time. Therefore, the scheme provides an inserting time algorithm, inserts the plate warehousing task by utilizing the idle time, finds out the warehousing task which is restrained immediately before and after the inserted warehousing task by utilizing an AOR algorithm, and moves the linked task backwards so as to determine the starting time of plate warehousing.
Preferably, in step S25, the method specifically includes the following substeps:
step S251: determining a set of boards to be dispatched from a warehouse using a longest process time priority rule (Longest Process Time, LPT)O D And the initial packaging sequence of the ex-warehouse plate, and iterating the initial packaging sequence of the ex-warehouse plate by utilizing a genetic domain search algorithm (GA-VNS);
step S252: determining the time of the delivery and starting of the delivery plate in the sorting machine, setting the initial packaging sequence of the delivery plate as the initial delivery sequence, and obtaining the delivery time of the delivery plate by using a transfer bottleneck algorithm (Shifting Bottleneck Heuristic, SBH);
Step S253: and determining the confluence sequence of the delivery plates in the confluence transfer stage, and obtaining the working time of each delivery plate on the confluence transfer machine by utilizing a first available machine (First Available Machine, FAM) algorithm.
In this embodiment, regarding the second problem, the second problem is regarded as a three-stage flow shop scheduling problem with an assembly process, and for the second problem, the warehouse-in task is once not considered, and is decomposed into three stage sub-problems, the first sub-problem is that the plate set O to be subjected to warehouse-out scheduling is determined by adopting the longest processing time priority rule D And the initial packaging sequence of the ex-warehouse plate is iterated by utilizing the GA-VNS, wherein the GA-VNS is an existing intelligent algorithm; secondly, determining the time of leaving and starting a warehouse of the plate in the sorting machine, taking an initial packaging sequence of the warehouse of the plate as an initial warehouse of the plate, and obtaining the warehouse of the plate by using an SBH algorithm; and thirdly, determining the confluence sequence of the warehouse-out plates in the confluence transfer stage, and calling a FAM algorithm by the plates after the warehouse-out, so as to obtain the start time of each warehouse-out plate on the confluence transfer machine. Therefore, the ex-warehouse scheduling algorithm can effectively solve the three sub-problems, and is used for carrying out ex-warehouse scheduling on the plates which are put in warehouse but not yet subjected to ex-warehouse scheduling, and the scene that the plates are taken out of warehouse in the warehouse-in process and the earliest plate ex-warehouse operation time of the sorting machine is not 0 needs to be considered.
Preferably, in step S251, the set O of boards to be dispatched from the warehouse is determined using the longest process time priority rule (Longest Process Time, LPT) D And an initial packaging sequence of the ex-warehouse plate, comprising in particular the following sub-steps：
Step S2511: determining an initial rescheduling moment ct=c imax Wherein C imax The current maximum warehouse entry completion time is set; determining a plate to be dispatched, wherein the plate to be dispatched comprises a plate B which is dispatched and has a time of starting to dispatch greater than or equal to ct 1 Order plate B which is currently put in storage and not scheduled out of warehouse 2 ；
Step S2512: pair B 2 The following treatment is carried out:
the total time t of each packaging task of the order processing is obtained i The method comprises the steps of carrying out a first treatment on the surface of the According to t i Sequencing the packaging tasks in a non-increasing order to obtain a packaging task sequence bq;
step S2513: rearranging the plates in the packaging task sequence BQ according to the appointed stacking sequence to obtain a new packaging task sequence BQ;
step S2514: the first wrapping task BQ is repeatedly fetched from the new wrapping task sequence BQ 1 Is allocated to the total processing time S at this time mb On the smallest baling press mb, the total processing time S of baling press mb is updated mb Packaging sequence SBQ of a packaging machine mb mb And a new packaging task sequence BQ, and determining whether the new packaging task sequence BQ is an empty set, if so, executing step S2515, otherwise, continuing to execute step S2514;
Step S2515: let the warehouse-out plate with the warehouse-out start time smaller than ct be B 3 Find B 3 Packaging sequence SBQ at each packer mb mb Plate LSQ positioned furthest back mb The method comprises the steps of carrying out a first treatment on the surface of the And build set O L Wherein, set O L Packaging sequence SBQ comprising a respective packaging machine mb mb Head panel to panel LSQ of (C) mb All the plates in between; and determine if ct is less than set O L Maximum delivery completion time C for middle plate omax If yes, let ct=c omax And update B 1 And O L Otherwise, obtaining a plate set O to be subjected to ex-warehouse scheduling D Packing sequence OBQ of delivery plate in each packer mb I.e. the initial packaging sequence of the exiting plate.
In this embodiment, the set of boards O to be dispatched from the warehouse can be determined by the longest process time priority rule (Longest Process Time, LPT) D And a packing sequence OBQ of the delivery plate at each packer mb . The longest process time priority rule is an existing heuristic algorithm.
Preferably, in step S252, the following substeps are specifically included:
step S2521: initializing a sorter set MS and sorting the sorted sorter set M 0 Setting aside;
step S2522: selecting a sorting machine with the longest total plate ex-warehouse processing time as a bottleneck machine m p Wherein m is p ∈M-M 0 M represents a set of machines;
step S2523: obtaining a bottleneck machine m based on a single machine problem solving algorithm p The warehouse-out sequence of the upper plate; and redundant virtual arcs on the extracted graph are deleted, and the bottleneck machine m p Joining a set M of sorting machines that have completed the dispatch 0 Obtaining a new sorting machine set M with completed dispatching 0 The method comprises the steps of carrying out a first treatment on the surface of the Wherein the extraction graph is used for representing a plate set O to be subjected to ex-warehouse scheduling D Scheduling problems of the middle warehouse-out plate;
step S2524: determining whether the sorter set MS is equal to the new, scheduled sorter set M 0 If yes, obtaining a plate set O to be subjected to ex-warehouse scheduling D Time for starting to leave warehouse of middle warehouse-out plateAnd ending the time of deliveryIf not, step S2522 is performed.
In this embodiment, the LPT is used to obtain the plate set O to be dispatched D The package sequence of the warehouse-out plates in each packer is provided, but the start time and the end time of the warehouse-out plates in the warehouse-out stage are not obtained, so the scheme provides an optimized SBH algorithm for solving the plate set O to be subjected to warehouse-out scheduling D The scheduling problem of the plate ex-warehouse, wherein the SBH algorithm is a heuristic algorithm.
In step S2523, bottleneck machine m is obtained based on the single machine problem solving algorithm p And the single machine problem solving algorithm is a sequencing algorithm in the ex-warehouse sequence of the upper plate. Redundant virtual arcs on the extraction graph are eliminated, and in particular, the extraction graph is used for representing a plate set O to be subjected to ex-warehouse scheduling D The scheduling problem of the board is that the numbers in the dots in the figure represent the boards in different packaging tasks as shown in figure 3; the direction of the solid arc connection represents the packing sequence OBQ of the plates in each packing task mb The method comprises the steps of carrying out a first treatment on the surface of the The points of virtual arc connection represent that these plates are assigned to the same sorter for treatment; the direction of the virtual arc connection indicates the order of the plates exiting the warehouse on the sorter. By deleting redundant virtual arcs among the plates, the sequence of the plates going out of the warehouse on the sorting machine can be determined, so that the distance of the longest path of the extracted graph is minimum, which is to solve the plate set O to be scheduled out of the warehouse D The core of the scheduling problem of the board is that of the board.
Preferably, in step S253, the following substeps are specifically included:
step S2531: plate set O based on to-be-ex-warehouse scheduling D Time for starting to leave warehouse of middle warehouse-out plateAnd according to the formula R i,3 ＝S i,2 +P i,2 +T i,2,3 Obtaining the time of the warehouse-out plate to reach the confluence transfer machine; wherein, the time that the warehouse plate arrives at the confluence transfer machine is represented; s is S i,2 Indicating the start-up time of the warehouse-out plate, < > >P i,2 The processing time of the plate out of the warehouse during the warehouse out is represented; t (T) i,2,3 The transportation time of the plate ex-warehouse between the ex-warehouse stage and the confluence stage is set;
step S2532: time R for delivering warehouse plate to confluence transfer machine i,2 Ordering the warehouse-out plates in a non-decreasing order to obtain a sequenceS；
Step S2533: the earliest machine that starts working of the first unscheduled plate in the sequence S is assigned to the plate until the plates in the sequence S are all discharged.
In the embodiment, the plate set O to be dispatched is obtained D After the start time and the end time of the delivery plate in the delivery stage, the start time of the delivery plate on the confluence transfer machine needs to be determined, so that the problem can be solved by using a FAM algorithm, wherein the FAM algorithm is a heuristic algorithm.
Furthermore, functional units in various embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units may be integrated into one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product.
While embodiments of the present invention have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the invention, and that variations, modifications, alternatives and variations of the above embodiments may be made by those skilled in the art within the scope of the invention.
Claims (9)
1. A warehouse-in and warehouse-out scheduling method of a customized furniture plate automatic sorting system is characterized in that: the method comprises the following steps:
step S1: aiming at the problem of joint dispatching of warehouse in and warehouse out with limited buffer area and constraint of packaging priority sequence in an automatic sorting system, constructing a mathematical model of the problem;
step S2: solving a mathematical model of the problem by adopting a multi-stage heuristic algorithm to obtain an optimal solution of the problem; the multi-stage heuristic algorithm comprises a buffer constraint conversion heuristic algorithm, an insert time algorithm and an ex-warehouse scheduling algorithm.
2. A method of warehouse-in and warehouse-out scheduling for an automated custom furniture board sorting system as claimed in claim 1, wherein: in step S1, constructing a mathematical model of the problem specifically includes the steps of:
constructing an objective function, wherein the expression of the objective function is as follows:
min f＝min(α*max(C i4 )+(1-α)*max(C i2 ))； (1)
Wherein the objective function has the following constraint conditions:
wherein alpha represents the weight of the optimization target occupied by the time of finishing the package; 1-alpha represents the weight occupied by the time of completion of the warehouse; i and j each represent an index of a plate number; h represents the buffer capacity; n represents the total number of the plates; k represents a stage index, and 1,2,3 and 4 represent the stages of warehousing, ex-warehouse, confluence transfer and packaging respectively in the stage index; p (P) ik Representing the processing time of the plate i in the k stage; c (C) ik Representing the finishing time of the plate i in the k stage; m is m k Representing the number of machines in the k-stage; t (T) k-1,k Representing the transit time generated between the k-1 stage and the k stage; r is R ik Representing the arrival time of the plate i at the k stage; b (B) i The number of the plate immediately after the plate i in the specified packaging sequence is represented, and if the current plate is the last plate in the order packaging task, the current plate is numbered; o (O) i Plate number O representing plate i; f represents a positive number; v (V) ijmk Representing that on the machine m of the kth stage, the plate i is processed before the plate j; v (V) iimk Representing that on the machine m of the kth stage, the plate i itself is processed; v (V) jimk Representing that on machine m at the kth stage, plate j is processed before plate i; d (D) imk Indicating that at the kth stage the panel i is assigned to the machine m for processing; s is S ik Representing the start machining time of the workpiece i in the kth stage; s is S jk Indicating the start machining time of the workpiece j in the kth stage;representing the processing of the plate Bi on the k-stage apparatus m; />Representing that in the k-th stage the plate i is processed earlier than the plate Bi on the apparatus m; r is R i+h，k Indicating the arrival time of the buffer zone of the ith+h plate of the plate at the kth stage; d (D) i+b，mk Representing the processing of the plate i+b on the k-stage apparatus m; r is R i+h+1k Indicating the arrival time of the (i+h+1) th plate at the buffer zone of the k-th plate; s is S I，k Representing the start machining time of the workpiece i in the kth stage; d (D) i+h+1mk Representing the plate i+h+1 being processed on the k-th stage apparatus m.
3. A method of warehouse-in and warehouse-out scheduling for an automated custom furniture board sorting system as claimed in claim 1, wherein: in step S2, the method specifically includes the following substeps:
step S21: assembling the plates to be put in storage O p According to the arrival time r of the plate i Descending and sequencing to obtain a scheduling sequence PQ to be put in storage;
step S22: respectively calculating earliest warehousing start time EST of each plate in the scheduling sequence PQ to be warehoused by utilizing a buffer zone constraint conversion heuristic algorithm i And a latest binnable start time LST i ；
Step S23: determining a first plate PQ to be binned into a scheduling sequence PQ using an insert time algorithm 1 Is the warehouse entry start time of (a)And ending time->And schedule sequence PQ and order to be put in warehouse>Number of boards put in storageUpdating;
step S24: determining an orderThe number of plates already put in storage->And (4) order->The number of plates->If so, executing step S25; if not, executing step S23;
step S25: respectively calculating plate set O to be subjected to ex-warehouse scheduling by adopting an ex-warehouse scheduling algorithm D Delivery start time of delivery plateDelivery end time->Start time of packing operation +.>End time +.>Beginning time of confluence transfer->And end time of confluence transfer->
Step S26: judging whether the scheduling sequence PQ to be put in storage is an empty set or not, if so, ending the processing; otherwise, with first plate PQ 1 At the same machine and at an earliest start time of warehouse entry than the first plate PQ 1 End time of (2)Small plate, with earliest warehouse-in start time of +.>Then the scheduling sequence PQ to be put in storage is set at the earliest possible start time EST of each plate i The order is sorted without decreasing, and step S23 is performed.
4. A method of warehouse-in scheduling for an automated custom furniture panel sorting system as claimed in claim 3, wherein: in step S22, the method specifically includes the following substeps:
Step S221: adopting buffer zone constraint conversion heuristic algorithm to make arrival time r of every plate i For earliest binnable start time IEST i Collecting plates to be put into storage O P According to the arrival time r of each plate i Sorting from large to small to obtain a scheduling sequence PQ to be put in a warehouse of each sorting machine and a plate warehousing processing time P, wherein N is in the scheduling sequence PQ to be put in a warehouse 0 A block plate;
step S222: taking the boards from the front to the back in the scheduling sequence PQ to be put into storage, and calculating the latest warehouse-in start time ILST of the boards i Let cursor c=1;
step S223: making the sorting machine set MS, judging whether the sorting machine set MS is empty, if yes, ending the processing, otherwise, selecting a machine mE MS, updating the sorting machine set MS, and executing step S224;
step S224: judging the number N of the plates in the scheduling sequence PQ to be put in storage 0 If equal to c, executing step S223, otherwise, taking the c-th plate J from the scheduling sequence PQ to be put in storage c The buffer capacity is b;
step S225: judging whether c is smaller than b+1, if so, warehousing a c-th plate J in a scheduling sequence PQ c Latest warehouse entry start time ILST c Equal to the maximum value in the interval, step S227 is performed; otherwise, step S226 is performed;
Step S226: if c=b+1, then the c-th plate J in the scheduling sequence PQ is to be put in c Is the latest in (2)Library start time ILST c For arrival time r of first plate in scheduling sequence PQ to be put in storage 1 And performs step S227; otherwise, the c-th plate J in the scheduling sequence PQ to be put in storage c Latest warehouse entry start time ILST c The method comprises the following steps: arrival time r of c-b-th plate in scheduling sequence PQ to be put in storage c-b Arrival time of c-b-1 th plate and c-th plate J c Is a warehouse entry processing time r c-b-1 -P c The difference between the latest warehouse-in time of the c-1 th plate and the c-th plate J c Difference ILST between warehouse entry processing times c-1 -P c The minimum of the three values;
step S227: let c=c+1.
5. A method of warehouse-in and warehouse-out scheduling for an automated custom furniture board sorting system as claimed in claim 4, wherein: in step S23, the method specifically includes the following substeps:
step S231: the earliest warehouse-in start time of the plate is IEST i The earliest warehousing ending time is IEED i Plate J i The processing time of (2) is P i The three satisfy the following relations: IEED (electronic identification device) i ＝IEST i +P i ；
Judging the current plate J k Is a delivery time interval of (a) and IEST i And IEED i Whether the intervals between the two are coincident;
wherein there are three cases, namely IEST i At the current plate J k During the delivery time interval of IEED i At the current plate J k During the delivery time interval of (2) and IEST i And latest warehouse-in start time ILST of plate i Are all at the current plate J k Is in the time interval of the warehouse-out;
if there is coincidence, plate J i Is the start time IST of warehouse entry i ＝IEST i Warehouse entry end time IED i ＝IEED i And ending the process; otherwise, step S232 is performed;
step S232: judging plate J i Is a warehouse-in time interval, i.e. IEST i And ILST i In the interval between, there is an idle time, if any, the starting time of the time zone with the maximum idle time is taken as the plate J i Is the start time IST of warehouse entry i And ending the process; otherwise, step S233 is performed;
step S233: judging plate J i The longest warehouse-in time interval of (i.e. IEST) i ILED by the latest warehouse-in end time of the plate i If the idle time is longer than the interval between the plates J i Processing time P of (2) i And ends the processing with the start time of the first free period as the board J i Is the start time IST of warehouse entry i The method comprises the steps of carrying out a first treatment on the surface of the Otherwise, S234 is performed;
step S234: if no idle time period for inserting the warehouse-in task exists, the warehouse-out priority principle is followed, and the warehouse-out finishing time OED is selected d Maximum, and less than or equal to the latest binnable start time ILST i Plate J of (2) d OED of (2) d As panel J i Is the start time IST of warehouse entry i ；
Step S235: let the start time OST of going out of warehouse U Minimum and greater than or equal to the latest warehouse-in end time ILST of the plate i Plate J of (2) U As the first affected plate, the plate package sequence is OBQ mb Currently processing plate J i Sorting machine warehouse-out priority order is sq 2 The method comprises the steps of carrying out a first treatment on the surface of the All of the ex-warehouse tasks O affected on each machine out And warehouse-in task O in Identified by an affected process translation (Affected Operations Rescheduling, AOR) algorithm and O is determined out And O in The start time and the end time of the warehouse-in and warehouse-out of the inner plate are shifted backwards, and the amount of the shifted-backward time is IED i -OST U The method comprises the steps of carrying out a first treatment on the surface of the If the time is shifted backward O in And if the warehouse-in starting time IST of the inner plate exceeds the latest warehouse-in starting time ILST, the plate is returned to the scheduling sequence PQ to be warehouse-in again for rescheduling operation.
6. A method of warehouse-in scheduling for an automated custom furniture panel sorting system as claimed in claim 3, wherein: in step S25, the method specifically includes the following substeps:
step S251: determining a set of boards O to be dispatched from a warehouse using a longest process time priority rule (Longest Process Time, LPT) D And the initial packaging sequence of the ex-warehouse plate, and iterating the initial packaging sequence of the ex-warehouse plate by utilizing a genetic domain search algorithm (GA-VNS);
Step S252: determining the time of the delivery and starting of the delivery plate in the sorting machine, setting the initial packaging sequence of the delivery plate as the initial delivery sequence, and obtaining the delivery time of the delivery plate by using a transfer bottleneck algorithm (Shifting Bottleneck Heuristic, SBH);
step S253: and determining the confluence sequence of the delivery plates in the confluence transfer stage, and obtaining the working time of each delivery plate on the confluence transfer machine by utilizing a first available machine (First Available Machine, FAM) algorithm.
7. A method of warehouse-in and warehouse-out scheduling for an automated custom furniture board sorting system as claimed in claim 6, wherein: in step S251, a set of boards O to be dispatched from the warehouse is determined using the longest process time priority rule (Longest Process Time, LPT) D And an initial packaging sequence of the ex-warehouse plate, comprising in particular the following sub-steps:
step S2511: determining an initial rescheduling moment ct=c imax Wherein C imax The current maximum warehouse entry completion time is set; determining a plate to be dispatched, wherein the plate to be dispatched comprises a plate B which is dispatched and has a time of starting to dispatch greater than or equal to ct 1 Order plate B which is currently put in storage and not scheduled out of warehouse 2 ；
Step S2512: pair B 2 The following treatment is carried out:
the total time t of each packaging task of the order processing is obtained i The method comprises the steps of carrying out a first treatment on the surface of the According to t i Sequencing the packaging tasks in a non-increasing order to obtain a packaging task sequence bq;
step S2513: rearranging the plates in the packaging task sequence BQ according to the appointed stacking sequence to obtain a new packaging task sequence BQ;
step S2514: the first wrapping task BQ is repeatedly fetched from the new wrapping task sequence BQ 1 Is allocated to the total processing time S at this time mb On the smallest baling press mb, the total processing time S of baling press mb is updated mb Packaging sequence SBQ of a packaging machine mb mb And a new packaging task sequence BQ, and determining whether the new packaging task sequence BQ is an empty set, if so, executing step S2515, otherwise, continuing to execute step S2514;
step S2515: let the warehouse-out plate with the warehouse-out start time smaller than ct be B 3 Find B 3 Packaging sequence SBQ at each packer mb mb Plate LSQ positioned furthest back mb The method comprises the steps of carrying out a first treatment on the surface of the And build set O L Wherein, set O L Packaging sequence SBQ comprising a respective packaging machine mb mb Head panel to panel LSQ of (C) mb All the plates in between; and determine if ct is less than set O L Maximum delivery completion time C for middle plate omax If yes, let ct=c omax And update B 1 And O L Otherwise, obtaining a plate set O to be subjected to ex-warehouse scheduling D Packing sequence OBQ of delivery plate in each packer mb I.e. the initial packaging sequence of the exiting plate.
8. A method of warehouse-in and warehouse-out scheduling for an automated custom furniture board sorting system as claimed in claim 7, wherein: in step S252, the method specifically includes the following substeps:
step S2521: initializing a sorter set MS and sorting the sorted sorter set M 0 Setting aside;
step S2522: selecting a sorting machine with the longest total plate ex-warehouse processing time as a bottleneck machine m p Wherein m is p ∈M-M 0 M represents a set of machines;
step S2523: obtaining a bottleneck machine m based on a single machine problem solving algorithm p The warehouse-out sequence of the upper plate; and redundant virtual arcs on the extracted graph are deleted, and the bottleneck machine m p Joining a set M of sorting machines that have completed the dispatch 0 Obtaining a new sorting machine set M with completed dispatching 0 The method comprises the steps of carrying out a first treatment on the surface of the Wherein the extraction graph is used for representing a plate set O to be subjected to ex-warehouse scheduling D Scheduling problems of the middle warehouse-out plate;
step S2524: determining whether the sorter set MS is equal to the new, scheduled sorter set M 0 If yes, obtaining a plate set O to be subjected to ex-warehouse scheduling D Time for starting to leave warehouse of middle warehouse-out plateAnd ending the delivery time->If not, step S2522 is performed.
9. A method of warehouse-in and warehouse-out scheduling for an automated custom furniture board sorting system as claimed in claim 8, wherein: in step S253, the method specifically includes the following sub-steps:
step S2531: plate set O based on to-be-ex-warehouse scheduling D Time for starting to leave warehouse of middle warehouse-out plateAnd according to the formula R i，3 ＝S i，2 +P i，2 +T i，2，3 Obtaining the time of the warehouse-out plate to reach the confluence transfer machine; wherein, the time that the warehouse plate arrives at the confluence transfer machine is represented; s is S i，2 Indicating the start-up time of the warehouse-out plate, < >>P i，2 The processing time of the plate out of the warehouse during the warehouse out is represented; t (T) i，2，3 The transportation time of the plate ex-warehouse between the ex-warehouse stage and the confluence stage is set;
step S2532: time R for delivering warehouse plate to confluence transfer machine i，2 Sorting the warehouse-out plates in the order which is not reduced to obtain a sequence S;
step S2533: the earliest machine that starts working of the first unscheduled plate in the sequence S is assigned to the plate until the plates in the sequence S are all discharged.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311345178.5A CN117314316A (en) | 2023-10-17 | 2023-10-17 | Warehouse-in and warehouse-out scheduling method of customized furniture plate automatic sorting system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311345178.5A CN117314316A (en) | 2023-10-17 | 2023-10-17 | Warehouse-in and warehouse-out scheduling method of customized furniture plate automatic sorting system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117314316A true CN117314316A (en) | 2023-12-29 |
Family
ID=89260132
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311345178.5A Pending CN117314316A (en) | 2023-10-17 | 2023-10-17 | Warehouse-in and warehouse-out scheduling method of customized furniture plate automatic sorting system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117314316A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030083762A1 (en) * | 2000-01-21 | 2003-05-01 | Farrah Timothy Francis | System for specifying design of a product or process |
| CN111368421A (en) * | 2020-03-02 | 2020-07-03 | 广西大学 | Grouping heuristic method for blanking of furniture boards according to stacking |
| CN112581052A (en) * | 2020-11-30 | 2021-03-30 | 南京林业大学 | Warehousing and splicing method for finished plate furniture products |
| CN114493015A (en) * | 2022-01-28 | 2022-05-13 | 佛山科学技术学院 | Plate intelligent production line dynamic scheduling method based on gene coding |
| CN115730789A (en) * | 2022-11-14 | 2023-03-03 | 河海大学 | ASRS task scheduling and goods allocation method and system under classified storage |
| CN116307485A (en) * | 2023-01-31 | 2023-06-23 | 中科元象(常州)智能装备有限公司 | Custom plate sorting and packing method |
-
2023
- 2023-10-17 CN CN202311345178.5A patent/CN117314316A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030083762A1 (en) * | 2000-01-21 | 2003-05-01 | Farrah Timothy Francis | System for specifying design of a product or process |
| CN111368421A (en) * | 2020-03-02 | 2020-07-03 | 广西大学 | Grouping heuristic method for blanking of furniture boards according to stacking |
| CN112581052A (en) * | 2020-11-30 | 2021-03-30 | 南京林业大学 | Warehousing and splicing method for finished plate furniture products |
| CN114493015A (en) * | 2022-01-28 | 2022-05-13 | 佛山科学技术学院 | Plate intelligent production line dynamic scheduling method based on gene coding |
| CN115730789A (en) * | 2022-11-14 | 2023-03-03 | 河海大学 | ASRS task scheduling and goods allocation method and system under classified storage |
| CN116307485A (en) * | 2023-01-31 | 2023-06-23 | 中科元象(常州)智能装备有限公司 | Custom plate sorting and packing method |
Non-Patent Citations (1)
| Title |
|---|
| 李煜民;章才能;: "智能家居中基于数据融合的云端安全性研究", 信息系统工程, no. 02, 20 February 2015 (2015-02-20), pages 85 - 86 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107506956B (en) | Based on improvement particle cluster algorithm supply chain production and transport coordinated dispatching method and system | |
| CN103955818B (en) | The method for scheduling task of Multilayer shuttle car automated storage and retrieval system | |
| CN101417732B (en) | Carrying command automatic generation system and method | |
| Rauf et al. | A smart algorithm for multi-criteria optimization of model sequencing problem in assembly lines | |
| CN111115084B (en) | Logistics optimization control system and method for maximally meeting delivery date | |
| CN109823757A (en) | A kind of plate warehouse-out method, system and storage medium | |
| Hazarika et al. | Genetic algorithm approach for machine cell formation with alternative routings | |
| CN115759634A (en) | Efficient collaboration method for batch layout of rectangular plates | |
| CN114881504B (en) | Electronic precision part full-automatic flexible production line scheduling method based on order selection | |
| Jiang | Solving multi-robot picking problem in warehouses: a simulation approach | |
| CN113034084B (en) | Dynamic configuration method and terminal for unitized intelligent warehouse | |
| CN116664053B (en) | Commodity inventory management method | |
| CN117314316A (en) | Warehouse-in and warehouse-out scheduling method of customized furniture plate automatic sorting system | |
| CN117234214A (en) | Automatic shuttle for stacking industrial goods | |
| CN116774658A (en) | Flexible job shop dynamic scheduling method under material limitation | |
| CN115629584A (en) | Order scheduling optimization method based on improved crow search algorithm | |
| US20020099462A1 (en) | Method and apparatus for sequencing production in a manufacturing environment | |
| CN109886626A (en) | A kind of plate storage method, system and storage medium | |
| US20240043214A1 (en) | Industrial internet of things for intelligent three-dimensional warehouse, controlling methods and storage medium thererof | |
| CN115293670A (en) | Automatic distribution center order sorting method based on mixed element heuristic algorithm | |
| US8417652B2 (en) | System and method for effecting optimization of a sequential arrangement of items | |
| CN115034653A (en) | End-to-end dynamic job shop scheduling model based on transformer | |
| CN115907066A (en) | Cement enterprise vehicle scheduling method based on hybrid sparrow intelligent optimization algorithm | |
| CN114971124A (en) | Intelligent scheduling method for electroplating production line based on slime mold algorithm | |
| Norozi et al. | Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |