CN116882593B - Work order scheduling method and device, electronic equipment and storage medium - Google Patents

Work order scheduling method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN116882593B
CN116882593B CN202311135933.7A CN202311135933A CN116882593B CN 116882593 B CN116882593 B CN 116882593B CN 202311135933 A CN202311135933 A CN 202311135933A CN 116882593 B CN116882593 B CN 116882593B
Authority
CN
China
Prior art keywords
work order
work
time period
period
orders
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.)
Active
Application number
CN202311135933.7A
Other languages
Chinese (zh)
Other versions
CN116882593A (en
Inventor
王昊
范秀坤
万睿
梁礼欣
徐英刚
郑约慧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Meiyun Zhishu Technology Co ltd
Original Assignee
Meiyun Zhishu Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Meiyun Zhishu Technology Co ltd filed Critical Meiyun Zhishu Technology Co ltd
Priority to CN202311135933.7A priority Critical patent/CN116882593B/en
Publication of CN116882593A publication Critical patent/CN116882593A/en
Application granted granted Critical
Publication of CN116882593B publication Critical patent/CN116882593B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316Sequencing of tasks or work
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04Manufacturing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06Energy or water supply
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Health & Medical Sciences (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Educational Administration (AREA)
  • Manufacturing & Machinery (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to the technical field of work order scheduling, and provides a work order scheduling method, a device, electronic equipment and a storage medium, wherein the work order scheduling method comprises the following steps: sequencing time slots according to the electricity price, and dividing the time slots into two time slot sets; according to the specification or the power consumption speed of the work orders, the work orders are ordered in an ordering mode opposite to the ordering mode of the time slots and distributed to two time slot sets to form two work monolayers; randomly sequencing the worksheets to obtain a preset number of initial solutions; and performing iterative optimization on the solution and outputting a final solution. According to the invention, double-layer coding is carried out on the work order by combining the electricity price and the specification or the power consumption speed of the work order, repeated iterative optimization is carried out on the initial solution, and further the power consumption cost and the lap joint cost are optimized, so that the calculation blindness in the iterative search stage can be reduced, and compared with the traditional manual production scheduling and the production scheduling by using a standard genetic algorithm, the production scheduling efficiency is greatly improved, and the production scheduling cost is reduced.

Description

Work order scheduling method and device, electronic equipment and storage medium
Technical Field
The invention relates to the technical field of work order production, in particular to a work order scheduling method, a device, electronic equipment and a storage medium.
Background
Workshop scheduling problems have been the research hotspot in academia and enterprises for many years, and are typical NP-hard problems. The scheduling of material work orders such as metals (such as cold rolled steel) becomes a pain point problem for planners due to the characteristics of multiple scenes, multiple constraints, multiple targets, multiple specifications and the like, and a feasible scheduling scheme can be obtained by repeated testing more often depending on manual experience instead of a data analysis driving mode, so that the waste of enterprises in time, cost and the like is caused.
The time-sharing electricity price is divided into different time periods according to the load condition of the power grid, and a user is driven to change the electricity consumption time period through price difference so as to balance the peaks and the troughs of the load. In the production of various materials, the consumption of electric energy is different from different finished product specifications, and the larger the thickness of the specification is, the more electric energy is consumed, and the production should be carried out in a low electricity price period as much as possible. Therefore, the production time period is adjusted during production scheduling, so that a large amount of cost can be effectively saved, and unnecessary resource waste is avoided.
In recent years, intelligent algorithms have been widely applied to solving workshop scheduling problems, such as genetic algorithms, tabu search algorithms, particle swarm algorithms and the like, wherein the genetic algorithms have strong global search capability, are not limited to the problem field, have strong universality and are applied to many manufacturing scenes, but have the defects of poor local search capability, low iterative later search efficiency, dependence on initial population and the like, so that the characteristics of material production scheduling optimization problem are combined, and the genetic algorithms are improved by considering time-of-use electricity prices and are applied to actual production scheduling problems.
Disclosure of Invention
The present invention is directed to solving at least one of the technical problems existing in the related art. Therefore, the invention provides a work order scheduling method which can reduce the scheduling cost.
The invention also provides a work order scheduling device.
The invention also proposes an electronic device and a non-transitory computer readable storage medium.
According to an embodiment of the first aspect of the invention, a work order scheduling method comprises the following steps:
sequencing the time periods according to the electricity price corresponding to the time periods participating in scheduling, and dividing the sequenced time periods into a first time period set and a second time period set;
according to the specification size or the power consumption speed of each work order, sequencing each work order in a sequencing mode opposite to sequencing each time period, and sequentially distributing the processing time length corresponding to each work order to the first time period set and the second time period set to form a first work monolayer and a second work monolayer;
randomly sequencing worksheets in the first worksheet and the second worksheet respectively to obtain a preset number of initial solutions;
performing iterative optimization on the preset number of initial solutions until the iterative times reach an upper limit and outputting a final solution;
scheduling the work orders according to the final solution;
Each solution represents the position of the processing time length corresponding to each work order in each period of the participation production; the final solution is the solution with the lowest cost determined by the objective function; the objective function is determined by a lap joint cost function and an electric charge cost function, the lap joint cost function is used for determining the cost corresponding to the specification lap joint of different work orders, and the electric charge cost function is used for determining the electric charge cost corresponding to the processing of each work order.
According to the work order scheduling method, the work orders are subjected to double-layer coding by combining the electricity prices and the specification or the electricity consumption speed of the work orders, the electricity fee cost is greatly optimized when the initial solution is obtained, the repeated iterative optimization is carried out on the initial solution, the electricity consumption cost and the lap joint cost are further optimized, meanwhile, the blindness of calculation in the iterative search stage can be reduced in a double-layer coding mode, and compared with the traditional manual scheduling, the scheduling efficiency is greatly improved, and the scheduling cost is remarkably reduced.
According to one embodiment of the present invention, the dividing the ordered time periods into a first time period set and a second time period set includes:
sequentially accumulating the sequenced time periods until the accumulated time period is longer than half of the total processing time period of all work orders, or one part of each time period is left to be not involved in accumulation;
And forming the time periods participating in accumulation into the first time period set, and forming the time periods not participating in accumulation into the second time period set.
According to one embodiment of the invention, the iterative optimization comprises the steps of:
the work order of each of the preset target solutions is adjusted according to a preset rule, so that a preset number of adjustment solutions are obtained;
sequentially performing binary tournament selection operation, POX operator-based cross operation, neighborhood search-based mutation operation and population screening on the preset number of adjustment solutions to obtain a preset number of screening solutions;
wherein, the target solution corresponding to the first iterative optimization is the initial solution; the target solution corresponding to the first iterative optimization is the screening solution corresponding to the last iterative optimization.
According to the work order scheduling method provided by the invention, the order of each work order in the initial solution is adjusted according to the preset rule, the initial solution is initially optimized to obtain the adjusted solution, the second optimization is carried out on the adjusted solution through binary tournament selection operation, POX operator-based cross operation and neighborhood search-based mutation operation, and finally the preset number of solutions with the lowest cost are screened out through the step of population screening and are subjected to the next iteration, so that the work order scheduling can be effectively ensured to obtain better solutions, and the production cost is reduced.
According to one embodiment of the present invention, the preset rule includes:
starting from the ending time of the last time period, arranging all the first work orders to the last time period in the order of the first work orders in the work order level until the processing time length of the last time period is reached;
if the sum of the processing time lengths corresponding to the first work orders does not reach the processing time length of the last time period, then the second work orders are inverted to the last time period according to the sequence of the second work orders in the work order level, and the processing time length of the last time period is reached;
the first work order is a work order in a work order level corresponding to the last time period, the second work order is a work order in another work order level, and the specification of the first work order and the specification of the second work order are both larger than a specification lower limit value and smaller than a specification upper limit value;
according to the level of the work orders and the sequence of the work orders in the level of the work orders, the residual work orders are sequentially discharged to the time intervals from the starting time of the initial time interval; wherein the remaining worksheets are worksheets other than the worksheets in the last period;
and (3) carrying out position adjustment on each work order arranged in each time period so as to realize continuous increment or decrement of the specification of each work order.
According to one embodiment of the present invention, the position adjustment of each work order arranged after each period includes:
if the electricity price of the first time period is lower than the electricity price of the next time period, the position of the first work order in the first time period is kept unchanged, the position of the work order with the largest specification in the rest work orders in the first time period is kept unchanged, the work order with the smallest specification is adjusted to the tail end of the first time period, the order of the work orders from the first work order to the work order with the largest specification is increased, and the order of the work orders between the work orders with the largest specification and the tail work order is decreased;
if the electricity price of the first time period is higher than that of the next time period, the position of the first work order in the first time period is kept unchanged, the position of the work order with the smallest specification in the rest work orders in the first time period is kept unchanged, the work order with the largest specification is adjusted to the tail of the first time period, the work order from the first work order to the work order with the smallest specification is decreased, and the work order between the work order with the smallest specification and the tail work order is increased;
if the electricity price of the last time period is lower than that of the last time period, the work order with the minimum specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are sequentially increased in specification;
If the electricity price of the last time period is higher than that of the last time period, the work order with the largest specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are reduced in specification in sequence;
if the electricity price of the middle period is lower than the previous period and higher than the next period, the work order with the smallest specification in the middle period is adjusted to the first position of the middle period, and other work orders in the middle period are sequentially increased in specification;
if the electricity price of the middle period is higher than the previous period and lower than the next period, the work order with the largest specification in the middle period is adjusted to the first position of the middle period, and other work orders in the middle period are decreased in specification in sequence;
if the electricity price of the middle period is lower than that of the last period and the next period, the work order with the smallest specification in the middle period is adjusted to the end of the middle period, the work order with the next smallest specification is adjusted to the first position of the middle period, the work order with the largest specification is kept unchanged, the work order from the first work order to the work order with the largest specification in the middle period is increased in specification, and the work order from the work order with the largest specification to the work order with the tail is decreased in specification;
If the electricity price of the middle period is higher than that of the last period and the next period, the work order with the largest specification in the middle period is adjusted to the end of the middle period, the work order with the next largest specification is adjusted to the first position of the middle period, the work order with the smallest specification is kept unchanged, the work order from the first work order to the work order with the smallest specification in the middle period is decreased, and the work order from the work order with the smallest specification to the work order with the tail is increased.
According to the embodiment of the invention, the electricity price of each time period is compared with the electricity price of the previous or next time period, the maximum, minimum, sub-maximum and sub-minimum values of the specification in the current time period are combined to determine the work order arrangement position in the current time period, so that the fact that at most one inflection point appears in the specification of the work order in one time period can be realized, on one hand, the operation efficiency can be effectively improved by ordering other work orders through the determined values of the work order specification, and on the other hand, the reduction of the production arranging cost can be realized by reducing the inflection points.
According to one embodiment of the present invention, the cross operation based on the POX operator includes:
sequentially selecting 2 solutions from a preset number of solutions processed by the binary tournament selection operation, and performing cross operation on the 2 solutions according to cross probability;
The interleaving operation includes:
randomly dividing each work order into a first work order set and a second work order set;
copying the worksheets of the first solution and the second solution in the first worksheet set into a first child solution and a second child solution respectively, and keeping the positions of the worksheets in the first worksheet set in the 2 child solutions unchanged;
copying the worksheets of the second worksheet set into a second child solution and a first child solution, and keeping the order of the 2 child solutions of the worksheets Shan Zaisuo in the second worksheet set unchanged.
According to one embodiment of the present invention, the mutation operation based on the neighborhood search includes:
selecting at least one solution from a predetermined number of solutions processed based on the cross operation of the POX operator according to the mutation probability, and performing mutation operation on each of the at least one solution;
the mutation operation comprises the following steps:
and randomly selecting a plurality of worksheets from the solutions, generating all neighborhood solutions of the plurality of worksheets in sequence, and selecting the solution with the lowest cost from all neighborhood solutions as a variant child solution.
According to one embodiment of the invention, the population screening comprises:
and selecting a preset number of solutions with the lowest cost from the preset number of solutions and all variant child solutions processed by the cross operation based on the POX operator as a preset number of screening solutions corresponding to the current iteration optimization.
According to one embodiment of the invention, the work order is a cold rolled steel work order.
According to an embodiment of the second aspect of the present invention, a work order scheduling apparatus includes: the first coding module is used for sequencing the time periods according to the electricity price corresponding to the time periods participating in scheduling, and dividing the sequenced time periods into a first time period set and a second time period set;
the second coding module is used for sequencing the work orders in a sequencing mode opposite to sequencing the time intervals according to the specification size or the power consumption speed of the work orders, and sequentially distributing the processing time length corresponding to the work orders to the first time interval set and the second time interval set so as to form a first work monolayer and a second work monolayer;
the determining module is used for respectively carrying out random sequencing on the worksheets in the first worksheet and the second worksheet to obtain a preset number of initial solutions;
The optimization module is used for carrying out iterative optimization on the preset number of initial solutions until the iterative times reach an upper limit and outputting a final solution;
the scheduling module is used for scheduling the work orders according to the final solution;
each solution represents the position of the processing time length corresponding to each work order in each period of the participation production; the final solution is the solution with the lowest cost determined by the objective function; the objective function is determined by a lap joint cost function and an electric charge cost function, the lap joint cost function is used for determining the cost corresponding to the specification lap joint of different work orders, and the electric charge cost function is used for determining the electric charge cost corresponding to the processing of each work order.
According to the work order scheduling device provided by the embodiment of the invention, the work orders are subjected to double-layer coding by combining the electricity prices and the specification or the electricity consumption speed of the work orders, so that the electricity fee cost is greatly optimized when the initial solution is obtained, the repeated iterative optimization is performed on the initial solution, the electricity consumption cost and the lap joint cost are further optimized, meanwhile, the blindness of calculation in the iterative search stage can be reduced in a double-layer coding mode, and compared with the traditional manual scheduling, the scheduling efficiency is greatly improved, and the scheduling cost is remarkably reduced.
An electronic device according to an embodiment of the third aspect of the present invention includes a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the work order scheduling method as in the embodiment of the first aspect when executing the computer program.
A non-transitory computer readable storage medium according to an embodiment of the fourth aspect of the present invention has stored thereon a computer program which, when executed by a processor, implements a work order production method as the embodiment of the first aspect.
The above technical solutions in the embodiments of the present invention have at least one of the following technical effects:
by setting the lap cost parameter, the method of influencing the total cost by greatly increasing the lap cost under the condition that the lap proportion exceeds the lap proportion threshold value in actual production can be realized, the lap proportion is still restrained to be smaller and better, and the objective function can be further facilitated to prepare and determine the solution with the lowest cost;
through guaranteeing that last time period work order specification accords with last time period work order specification constraint, can guarantee to reduce with the specification difference between the work order of next batch, can make better linking and transition between the work order, reduce overlap joint cost, the debugging degree of difficulty of reduction equipment.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the related art, the drawings that are required to be used in the embodiments or the related technical descriptions will be briefly described, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to the drawings without inventive effort for those skilled in the art.
FIG. 1 is a schematic flow chart of a work order scheduling method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a worksheet non-cross-day processing duration provided by an embodiment of the present invention;
FIG. 3 is a schematic diagram of a worksheet cross-day processing duration provided by an embodiment of the present invention;
FIG. 4 is a schematic diagram of time period set and worker layer division provided by an embodiment of the present invention;
FIG. 5 is a schematic diagram of a worksheet according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of a work unit adjustment provided by an embodiment of the present invention;
FIG. 7 is a schematic diagram of a POX operator-based crossover operation provided by an embodiment of the present invention;
FIG. 8 is a schematic diagram of a variance operation of a solution based on a neighborhood search according to an embodiment of the present invention;
FIG. 9 is a flowchart of a work order scheduling method according to an embodiment of the present invention;
FIG. 10 is a graph of the variation trend of the final solution unit provided by the embodiment of the invention;
FIG. 11 is a schematic diagram of a work order layout device according to an embodiment of the present invention;
fig. 12 is a schematic diagram of an entity structure of an electronic device according to an embodiment of the present invention.
Detailed Description
Embodiments of the present invention are described in further detail below with reference to the accompanying drawings and examples. The following examples are illustrative of the invention but are not intended to limit the scope of the invention.
In the description of the embodiments of the present invention, it should be noted that the terms "center", "longitudinal", "lateral", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", etc. indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, are merely for convenience in describing the embodiments of the present invention and simplifying the description, and do not indicate or imply that the apparatus or elements referred to must have a specific orientation, be configured and operated in a specific orientation, and thus should not be construed as limiting the embodiments of the present invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
In describing embodiments of the present invention, it should be noted that, unless explicitly stated and limited otherwise, the terms "coupled," "coupled," and "connected" should be construed broadly, and may be either a fixed connection, a removable connection, or an integral connection, for example; can be mechanically or electrically connected; can be directly connected or indirectly connected through an intermediate medium. The specific meaning of the above terms in embodiments of the present invention will be understood in detail by those of ordinary skill in the art.
In embodiments of the invention, unless expressly specified and limited otherwise, a first feature "up" or "down" on a second feature may be that the first and second features are in direct contact, or that the first and second features are in indirect contact via an intervening medium. Moreover, a first feature being "above," "over" and "on" a second feature may be a first feature being directly above or obliquely above the second feature, or simply indicating that the first feature is level higher than the second feature. The first feature being "under", "below" and "beneath" the second feature may be the first feature being directly under or obliquely below the second feature, or simply indicating that the first feature is less level than the second feature.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the embodiments of the present invention. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
It should be noted that, in the work order scheduling method provided by the embodiment of the present invention, the execution body may be a computer device, for example, a mobile phone, a tablet computer, a notebook computer, a palm computer, a vehicle-mounted electronic device, a wearable device, an ultra-mobile personal computer (ultra-mobile personal computer, UMPC), a netbook, a personal digital assistant (personal digital assistant, PDA), or the like.
The technical scheme provided by the embodiment of the invention is described below by taking a work order scheduling system as an execution main body as an example.
Fig. 1 is a schematic flow chart of a job ticket scheduling method according to an embodiment of the present invention. Referring to fig. 1, a job ticket scheduling method provided by an embodiment of the present invention includes:
s101, sorting the time periods according to the electricity price corresponding to the time periods participating in production scheduling, and dividing the sorted time periods into a first time period set and a second time period set;
s102, sorting the work orders in a sorting mode opposite to the sorting of the time intervals according to the specification size or the power consumption speed of the work orders, and sequentially distributing the processing time length corresponding to the work orders to the first time interval set and the second time interval set to form a first work monolayer and a second work monolayer;
s103, randomly sequencing worksheets in the first worksheet and the second worksheet respectively to obtain a preset number of initial solutions;
s104, carrying out iterative optimization on a predetermined number of initial solutions until the iterative times reach an upper limit and outputting a final solution;
s105, scheduling the work orders according to the final solution;
each solution represents the position of the processing time length corresponding to each work order in each period of participation in production; the final solution is the solution with the lowest cost determined by the objective function; the objective function is determined by a lap joint cost function and an electric charge cost function, wherein the lap joint cost function is used for determining the cost corresponding to the specification lap joint of different worksheets, and the electric charge cost function is used for determining the electric charge cost corresponding to the processing of each worksheet.
It will be appreciated that each solution characterizes the position of the corresponding processing duration of each work order in each time period involved in the production scheduling, that is, each solution is a sequence containing the production scheduling results of each work order, wherein the position of each work order is uniquely determined.
The time periods are ordered according to the electricity price corresponding to the time periods participating in production scheduling, and the ordering mode can be an arrangement mode according to an ascending electricity price mode or an arrangement mode according to a descending electricity price mode.
It is understood that sorting the work orders in a reverse order to sorting the time periods according to the specification sizes or the power consumption rates of the work orders means that the specification sizes or the power consumption rates of the work orders are sorted in descending order when the power rates are sorted in ascending order, and the specification sizes or the power consumption rates of the work orders are sorted in ascending order when the power rates are sorted in descending order.
It should be noted that, according to the invention, the sorted time periods are divided into the first time period set and the second time period set, so that the electricity price is divided into the relatively higher time period set and the relatively lower time period set, the work orders are sorted in a sorting mode opposite to the sorting of the time periods, and the processing time length corresponding to the work orders is sequentially distributed to the first time period set and the second time period set, so as to form a first work order layer and a second work order layer, so that the work orders with smaller specification or lower electricity consumption speed are arranged in the time period with higher electricity price, and the work orders with larger specification or higher electricity consumption speed are arranged in the time period with lower electricity price, so that the electricity cost of the production is primarily reduced.
It should be noted that, before the job ticket scheduling according to the present invention is performed, the basic parameters of each job ticket to be scheduled and the scheduling related data, such as the scheduling start time (may be expressed as) Last work order specification of last batch (can be expressed as +.>) A lap ratio threshold (which may be expressed as +.>) Thin gauge (may be expressed as +.>) Gauge of thick stock (may be expressed as +.>) The number of electricity price time periods (which can be expressed as M), the electricity price of each time period (which can be expressed as +.>) Each period start time (may be expressed as +.>) The total time of day (which can be represented as P and is generally 24 hours), the number of work orders to be discharged (which can be represented as N), the specifications of each work order of the batch (which can be represented as +.>) Processing time of each work order of the batch (which can be expressed as +.>) The power consumption rate of each unit of the batch (which can be expressed as + ->) And the like, so as to ensure that the objective function can accurately determine the solution with the lowest cost, and further the accuracy of the production result.
The invention converts the constraint conditions in the production process into targets for determination, such as converting the specification lap joint proportion constraint into a lap joint cost function and the like, and converting the power consumption constraint into an electricity fee cost function, so that the equipment debugging difficulty can be effectively reduced, meanwhile, the condition of infeasible solution in the production process is avoided, the calculation solution speed is greatly improved, the production efficiency is further improved, and the general applicability of the production method is improved.
The objective function is determined by a lap cost function and an electric charge cost function, wherein the lap cost is determined by lap joint between worksheetsThe proportion calculation can be carried out by firstly calculating the lap proportion of the work order
Wherein,for the specification of last work order of the previous batch, < >>For the specification of each work order in the batch, < > for>Is->Specification of overlapping worksheets->The position of the work order i in the current scheduling sequence is the kth; k=1>For the overlap ratio between the first work order of the batch and the last work order of the previous batch, when k is more than or equal to 2,/I>Is the overlap ratio between every two work orders in the batch.
After the lap joint proportion of the work order is determined, the lap joint cost is determined through the lap joint proportion of the work order
Wherein,for the lap ratio threshold, a and b are lap cost parameters when the lap ratio exceeds the lap ratio threshold, and a and b are both positive numbers.
In addition, the invention sets the lap cost parameter to ensure that in actual production, if the lap proportion exceeds the lap proportion threshold value, the lap cost is greatly increased to influence the total cost, and the lap proportion can be still restrained to be smaller and better, so that the objective function can be further facilitated to prepare and determine the solution with the lowest cost.
After the lap cost of the work order is determined, the lap cost function is determined as
It should be noted that, the electric charge cost function in the objective function may be:
firstly, calculating the processing time length of a work order in each time period, wherein the processing time length of the first time period is
Wherein,for work order start time, +.>The time for bundling the work single is shown as follows:
wherein,for the start time of the schedule->Is the total duration of a day (typically 24 hours), -a.about.>For the position of the work order i in the current production sequence is kth,/and the position>Processing time of each work order of the batch.
It should be noted that, after date removal of P by mod function, work order start time can be ensuredAnd I/O time of the unijunction>All are non-dated times, for example when the start time of the work order is 10 # 6:00, then by proceeding with mod P, the resulting start time of the work order is 6:00, so as to calculate the processing time length of the work order later.
Fig. 2 is a schematic diagram of a processing duration of a work order without crossing days, where, as shown in fig. 2, when the work order does not cross days, there may be the following six relations between a start time point, an end time point and an electricity price period of the work order:
a)
b)
c)
d)
e)
f)
fig. 3 is a schematic diagram of a processing duration of a worksheet across days according to an embodiment of the present invention, as shown in fig. 3, when the worksheet is across days, the starting time point, the ending time point and the electricity price period of the work order can have the following six relations:
a)
b)
c)
d)
e)
f)
Wherein the method comprises the steps ofRepresents the start time of the first period, +.>And the work order processing time length is the work order processing time length of the first time period.
According to the processing time of the work order in each time interval and the electricity price in each time interval, calculating to obtain the electricity fee costThe formula can be:
determining an electric charge cost function according to the electric charge cost
Will overlap the cost functionElectric charge cost function>Adding to obtain the objective function->
It should be noted that the numerical values actually set by a and b can be set according to the magnitude of the electric charge, and the invention constructs the objective function by taking the lap joint cost function as a main part and the electric charge cost as an auxiliary part, and controls the values of a and b to make the magnitude of the lap joint cost larger than the magnitude of the electric charge cost, so as to ensure that the requirement meeting the specification lap joint proportion is preferentially met in the production process.
It should be noted that the last time period worksheets in each batch may conform to the last time period worksheet specification constraints. The specification constraint of the work order at the last time interval indicates that the scheduling of the work order of the current batch is finishedThe specification of the work order is not thin or thick in the electricity price period, i.e. the specification range of the work order is
Specifically, the end time work order specification may be made to conform to the end time work order specification constraint during the scheduling process (where the meaning of the calculation parameters may be referred to above) by:
Calculating the scheduling end time of the work orders of the current batch
Calculating the total work order processing time length of the last time period of the current batch
Determining the position of the first work order in the production sequence in the last period
Wherein argmin represents a variable value at which the expression takes a minimum value under a certain condition.
It can be understood that the processing time length of the work orders is accumulated by traversing the work orders in the sequence, and when the accumulated processing time length of the work orders just reachesWhen the critical work order is located, the position of the first work order in the final period is the position of the first work order in the production scheduling sequence/>
Finally, the last time period worksheet specification range constraint may be expressed as:
it should be noted that, by ensuring that the specification of the work order at the last time period accords with the specification constraint of the work order at the last time period, the specification difference between the work orders and the work orders in the next batch can be reduced, so that better connection and transition between the work orders can be realized, the lap joint cost is reduced, and the debugging difficulty of equipment is reduced.
It should be noted that, the position of the worksheet in one solution may conform to the position constraint:
specifically, the position of each work order in each solution is unique and can be expressed as:
/>
the worksheet corresponding to each position in each solution is also unique and can be expressed as:
It is to be understood that the constraints in the present invention can be expressed in terms of equations or sets of inequalities.
According to the work order scheduling method, the work orders are subjected to double-layer coding by combining the electricity prices and the specification or the electricity consumption speed of the work orders, the electricity fee cost is greatly optimized when the initial solution is obtained, the repeated iterative optimization is carried out on the initial solution, the electricity consumption cost and the lap joint cost are further optimized, meanwhile, the blindness of calculation in the iterative search stage can be reduced in a double-layer coding mode, compared with the traditional manual scheduling and the standard genetic algorithm scheduling, the scheduling efficiency is greatly improved, and the scheduling cost is remarkably reduced.
Fig. 4 is a schematic diagram of time period set and worker-layer division provided in the embodiment of the present invention, as shown in fig. 4, dividing each time period after sequencing into a first time period set and a second time period set, including:
sequentially accumulating the sequenced time periods until the accumulated time period is longer than half of the total processing time period of all work orders, or one part of each time period is left to be not involved in accumulation;
the time periods participating in accumulation form a first time period set, and the time periods not participating in accumulation form a second time period set.
It should be noted that, the manner of determining the first period set and the second period set may be to use more than half of the total processing time of the work order as the first period set, use the remaining period as the second period set, use the last period as the second period set, use the other periods as the first period set, and the invention is not limited thereto.
Next, one of the ways of determining the first time period set and the second time period set in the present invention will be described by taking the descending order of electricity price and the ascending order of the specifications of the work orders as an example with reference to fig. 4. For example, after the work orders 1-17 (assuming that the processing time lengths corresponding to the work orders are the same) are arranged according to the ascending order of the specifications, the work order with the minimum specification of the work orders (work order 1) is arranged into a time period with the highest electricity price (a first time period set), the rest work orders are sequentially arranged, the total processing time length of all the work orders to be arranged is calculated, the processing time length of the work orders in the time period is accumulated until the accumulated processing time length reaches half of the total processing time length (the work order 1 is accumulated to the work order 9), the time period of the work orders which participate in accumulation is used as the first time period set (the time period of the work orders 1-9 arrangement), and the time period of the work orders which do not participate in accumulation is used as the second time period set (the time period of the work orders 10-17 arrangement).
According to the work order scheduling method provided by the invention, the electricity prices of each time period are divided into the higher time period set and the lower time period set, and the electricity costs in work order scheduling can be effectively reduced due to smaller specification or smaller electricity consumption speed in the time period of higher electricity price.
In one embodiment, the iterative optimization includes the steps of:
the work order of each of the preset target solutions is adjusted according to a preset rule, so that a preset number of adjustment solutions are obtained;
sequentially performing binary tournament selection operation, POX operator-based cross operation, neighborhood search-based mutation operation and population screening on a preset number of adjustment solutions to obtain a preset number of screening solutions;
wherein, the target solution corresponding to the first iterative optimization is an initial solution; the target solution corresponding to the first iterative optimization is the screening solution corresponding to the last iterative optimization.
It should be noted that, the cost of the work order scheduling scheme has been primarily optimized in the initial solution, after the initial solution is determined, the work order is adjusted so as to further optimize the scheduling scheme, and an adjusted solution is obtained, and more solutions can be obtained on the basis of the secondarily optimized adjusted solution by performing binary tournament selection operation, cross operation based on the POX operator, mutation operation based on the neighborhood search and population screening on the adjusted solution, and by screening among the solutions, a solution with lower cost is determined.
It should be noted that, the binary tournament operation may be that two solutions are selected from a predetermined number of adjustment solutions, and the selection manner may be random selection, sequential selection, or the like, and the solution with the smallest cost of the two solutions is determined by the objective function and is used as the solution to be subjected to the cross operation based on the POX operator.
It will be appreciated that the binary tournament operation is repeated a predetermined number of times until a predetermined number of solutions are obtained.
It should be noted that, before performing iterative optimization, optimization parameters need to be determined in advance according to computing power of a computer, production scheduling requirements, and the like, including, for example: maximum number of iterations, crossover probability, mutation probability, a predetermined number of solutions, etc.
According to the work order scheduling method provided by the invention, the order of each work order in the initial solution is adjusted according to the preset rule, the initial solution is initially optimized to obtain the adjusted solution, the second optimization is carried out on the adjusted solution through binary tournament selection operation, POX operator-based cross operation and neighborhood search-based mutation operation, and finally the preset number of solutions with the lowest cost are screened out through the step of population screening and are subjected to the next iteration, so that the work order scheduling can be effectively ensured to obtain better solutions, and the production cost is reduced.
In one embodiment, the preset rules include:
starting from the ending time of the last time period, arranging all the first work orders in the work order level of the first work orders in a reverse manner until the processing time of the last time period is reached;
if the sum of the processing time lengths corresponding to the first work orders does not reach the processing time length of the last time period, then the second work orders are inverted to the last time period according to the sequence of the second work orders in the work order level, and the processing time length of the last time period is reached;
the first work order is a work order in a work order level corresponding to the last time period, the second work order is a work order in another work order level, and the specification of the first work order and the specification of the second work order are both larger than a lower limit value and smaller than an upper limit value;
according to the level of the work orders and the sequence of the work orders in the level of the work orders, the residual work orders are sequentially discharged to the time intervals from the starting time of the initial time interval; wherein the remaining worksheets are worksheets other than the worksheets in the last period;
and (3) carrying out position adjustment on each work order arranged in each time period so as to realize continuous increment or decrement of the specification of each work order.
The preset rules are described below with reference to fig. 5. FIG. 5 is a schematic diagram of a worksheet according to a specification adjustment provided in an embodiment of the present invention, as shown in FIG. 5, the period in the first period set is E 2 、E 4 The corresponding first work layer is L1, and the time period in the second time period set is E 1 、E 3 The corresponding second work layer is L2, and the upper limit of the specification is H 2 The lower limit of the specification is H 1 The production start time was 5 days 6:00, end time 6 days 16:00, randomly sequencing the L1 and the L2 shown in fig. 5 to obtain a predetermined number of initial solutions, and at this time, starting to adjust the initial solutions according to a preset rule:
first, the last period is determined to be 6 days 12:00-16:00, at time period E 3 And the electricity price time period belongs to a second time period set, wherein in the second time period set, according to the upper limit and the lower limit of the specification of the last time period, the first work orders in the work order level corresponding to the last time period are determined to be the work orders 10, 11 and 12, and the duration of the last time period is 4 hours, and two work orders can be discharged, so that the first work orders are inverted into the last time period, namely the work orders 11 and 12 are discharged into the last time period.
When the first work order is insufficient to fill the last period, the work orders in the second work order are inverted into the last period according to the order of the work orders in the initial solution until the last period is filled, for example, after the work orders 11-12 are ejected to 6 days, for example, 12:00, the inverted arrangement is ended.
The remaining work orders, i.e., work orders other than the work order that was entered in the last time period, are then being entered in other time periods according to the time period in which they were located, e.g., in FIG. 5, work orders 1-2-3, 4-5-6, 7-8-9 are each entered into 5 days 6:00-12:00, 5 days 18: and (3) in the steps of 00-6 days 0:00 and 6 days 6:00-6 days 12:00, respectively arranging the worksheets 10-13-14 and 15-16-17 in the steps of 5 days 12:00-18:00 and 6 days 0:00-6:00, and ending the positive arrangement.
Finally, the position of the worksheets in each period is adjusted, so that in an adjustment solution obtained by adjustment, the specification of each worksheet is increased or decreased, for example, the worksheet is adjusted from 10-13-14 to 14-13-10 in sequence for 5 days 12:00-18:00, and the worksheet is decreased.
In the present embodiment, the adjustment of the work position according to the specification is described only schematically, and the same applies to the adjustment according to the power consumption rate.
It should be noted that, the increasing or decreasing of the specification of each work order may mean that the specification of the work order has at most one extreme value in a period of time, so as to reduce inflection points and reduce cost.
According to the embodiment of the invention, the positions of the work orders are adjusted according to the pre-rule, so that the work order rule can be controlled to have at most one inflection point in one time period under the condition that the work orders in the last time period meet the requirement of the overlap joint range, the overlap joint cost between the work orders is effectively reduced, and the production cost is further reduced.
According to the above embodiment, the position adjustment is performed on each work order arranged to each period, including:
a) If the electricity price of the first time period is lower than the electricity price of the next time period, the position of the first work order in the first time period is kept unchanged, the position of the work order with the largest specification in the rest work orders in the first time period is kept unchanged, the work order with the smallest specification is adjusted to the end of the first time period, the order of the work orders from the first work order to the work order with the largest specification is increased, and the order of the work orders between the work orders with the largest specification and the work orders with the tail is decreased;
b) If the electricity price of the first time period is higher than that of the next time period, the position of the first work order in the first time period is kept unchanged, the position of the work order with the smallest specification in the rest work orders in the first time period is kept unchanged, the work order with the largest specification is adjusted to the end of the first time period, the work order from the first work order to the work order with the smallest specification is reduced, and the work order between the work order with the smallest specification and the work order with the tail is increased;
c) If the electricity price of the last time period is lower than that of the last time period, the work order with the minimum specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are sequentially increased in specification;
d) If the electricity price of the last time period is higher than that of the last time period, the work order with the largest specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are decreased in order in specification;
e) If the electricity price of the intermediate period is lower than the previous period and higher than the next period, the work order with the minimum specification in the intermediate period is adjusted to the first position of the intermediate period, and other work orders in the intermediate period are sequentially increased in specification;
f) If the electricity price of the intermediate period is higher than the previous period and lower than the next period, the work order with the largest specification in the intermediate period is adjusted to the first position of the intermediate period, and other work orders in the intermediate period are reduced in specification;
g) If the electricity price of the middle period is lower than that of the last period and the next period, the work order with the smallest specification in the middle period is adjusted to the end of the middle period, the work order with the next smallest specification is adjusted to the first position of the middle period, the work order with the largest specification is kept unchanged, the work order from the first work order to the work order with the largest specification in the middle period is increased in specification, and the work order from the largest specification work order to the last work order is decreased in specification;
h) If the electricity price of the middle period is higher than that of the last period and the next period, the work order with the largest specification in the middle period is adjusted to the end of the middle period, the work order with the next largest specification is adjusted to the first position of the middle period, the work order with the smallest specification is kept unchanged, the work order from the first work order to the work order with the smallest specification in the middle period is reduced, and the work order from the work order with the smallest specification to the work order with the last specification is increased.
The present invention will be described below with reference to the work order sequence shown in fig. 6, in which the positional adjustment of each work order after arrangement for each period is performed. Fig. 6 is a schematic diagram of the unit location adjustment provided in the embodiment of the present invention, where a) to h) shown in fig. 6 correspond to a) to h) respectively, and the unit location adjustment results are described below one by one:
a) The electricity price of the first time period is lower than that of the next time period, the position of the first work order (work order 1) in the first time period is kept unchanged, the position of the work order (work order 5) with the largest specification in the rest work orders in the first time period is kept unchanged, the work order (work order 4) with the smallest specification is adjusted to the end of the first time period, and the work order between the first work order and the work order with the largest specification is in specification increment (work order 1-2-3-4-5 increment) before the work order 4 is discharged to the work order 5 because the position of the work order with the largest specification is at the end;
b) The electricity price of the first time period is higher than that of the next time period, the position of the first work order (work order 1) in the first time period is kept unchanged, the position of the work order (work order 2) with the smallest specification in the rest work orders in the first time period is kept unchanged, the work order (work order 5) with the largest specification is adjusted to the end of the first time period, and the work order between the work orders with the smallest specification and the work orders with the tail is in specification increment (work order 1-2-3-4-5 increment);
c) The electricity price of the last time period is lower than that of the last time period, the work order (work order 1) with the smallest specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are sequentially increased in specification (work order 1-2-3-4-5 is increased in an increasing mode);
d) The electricity price of the last time period is higher than that of the last time period, the work order (work order 5) with the largest specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are reduced in specification (work order 5-4-3-2-1 is reduced in a descending mode);
e) The electricity price of the middle period is lower than that of the last period and higher than that of the next period, the work order (work order 1) with the minimum specification in the middle period is adjusted to the first position of the middle period, and other work orders in the middle period are sequentially increased in specification (work order 1-2-3-4-5 is increased in an increasing mode);
f) The electricity price of the middle period is higher than that of the last period and lower than that of the next period, the work order (work order 5) with the largest specification in the middle period is adjusted to the first position of the middle period, and other work orders in the middle period are decreased in order (work order 5-4-3-2-1 is decreased in order);
g) The electricity price of the middle period is lower than that of the last period and the next period, the work order of the work order from the first work order to the maximum specification work order in the middle period is increased in specification (the increment of work order 2-3-4-5), and the work order from the maximum specification work order to the last work order is decreased in specification (the decrement of work order 5-1), wherein the work order of the minimum specification work order (work order 1) in the middle period is adjusted to the end of the middle period, the work order (work order 2) in the middle period is adjusted to the first position of the middle period, and the work order (work order 5) in the maximum specification is unchanged;
h) The electricity price of the middle period is higher than that of the last period and the next period, the work order with the largest specification (work order 5) in the middle period is adjusted to the end of the middle period, the work order with the next largest specification (work order 4) is adjusted to the first position of the middle period, the position of the work order with the smallest specification (work order 1) is unchanged, the work order from the first work order to the work order with the smallest specification in the middle period is reduced (work order 4-1 is reduced), and the work order from the work order with the smallest specification to the work order with the last specification is increased (1-2-3-5 is increased).
According to the embodiment of the invention, the electricity price of each time period is compared with the electricity price of the previous or next time period, the maximum, minimum, sub-maximum and sub-minimum values of the specification in the current time period are combined to determine the work order arrangement position in the current time period, so that the fact that at most one inflection point appears in the specification of the work order in one time period can be realized, on one hand, the operation efficiency can be effectively improved by ordering other work orders through the determined values of the work order specification, and on the other hand, the reduction of the production arranging cost can be realized by reducing the inflection points.
In one embodiment, the POX operator based interleaving operation includes:
sequentially selecting 2 solutions from the preset number of solutions processed by the binary tournament selection operation, and performing cross operation on the 2 solutions according to the cross probability;
The interleaving operation includes:
randomly dividing each work order into a first work order set and a second work order set;
copying the worksheets of the first solution and the second solution in the first worksheet set into a first child solution and a second child solution respectively, and keeping the positions of the worksheets in the first worksheet set in the 2 child solutions unchanged;
the work orders in the 2 child solutions of the work order Shan Zaisuo contained in the second work order set are maintained by copying the work orders in the first solution and the second solution in the second work order set into the second child solution and the first child solution respectively.
In the following, description will be made on the cross operation based on the POX operator in the embodiment of the present invention with reference to fig. 7, fig. 7 is a schematic diagram of the cross operation based on the POX operator provided in the embodiment of the present invention, and as shown in fig. 7, two solutions are sequentially selected from a predetermined number of solutions after the binary tournament selection operation processing, where the first solution and the second solution, for example, P1 and P2, it is understood that each of P1 and P2 includes five worksheets with sequence numbers 1-5, and the five worksheets are randomly divided into a first worksheet set, for example, MS 1= {1,2}, and a second worksheet set, for example, MS 2= {3,4,5}.
Specifically, the interleaving operation includes: copying the MS1 in P1 into a child solution C1, copying the MS1 in P2 into a child solution C2, reserving the positions of two worksheets in the MS1 in the P1 and the P2 into the child solutions C1 and C2, sequentially discharging the MS2 in the P2 into the C1, sequentially discharging the MS2 in the P1 into the C2, reserving the sequences of three worksheets in the MS2 in the P1 and the P2 into the child solutions C1 and C2, and ending the cross operation.
It should be noted that, the crossover probability may be determined according to the demands on the computing power of the computer, the scheduling requirement, etc., for example, when the computing power of the computer is low, the crossover probability may be determined to be low, so as to determine that less crossover operations are performed on a predetermined number of solutions processed from the binary tournament selection operation, thereby improving the feasibility of the work order scheduling method.
After the crossover operation is executed, the current solution includes solutions processed by the non-crossover binary tournament selection operation and child solutions processed by the crossover, and the sum of the number of the solutions still remains the same as the preset number.
According to the embodiment of the invention, the solutions processed by the selection operation of the partial binary tournament are subjected to the cross operation according to the cross probability, so that the increase of the number of the solutions is beneficial to further determining the final solution with the lowest cost.
In one embodiment, the variance operation based on the neighborhood search includes:
selecting at least one solution from a predetermined number of solutions processed based on the cross operation of the POX operator according to the mutation probability, and performing a mutation operation on each of the at least one solution;
the mutation operation comprises the following steps:
and randomly selecting a plurality of worksheets from the solutions, generating all neighborhood solutions for sequencing the worksheets, and selecting the solution with the lowest cost from all neighborhood solutions as a variant child solution.
Next, description will be given of a mutation operation based on a neighborhood search in an embodiment of the present invention with reference to fig. 8, fig. 8 is a schematic diagram of a mutation operation based on a neighborhood search for a solution provided in an embodiment of the present invention, and as shown in fig. 8, the sequence of at least one solution is selected as "3-2-1-5-4" from a predetermined number of solutions after a cross operation process based on a POX operator according to a mutation probability, and the mutation operation is performed on the solution.
Specifically, the mutation operation includes: a plurality of worksheets are randomly selected from solutions, for example, 3 worksheets '2-1-4' are selected for mutation, the remaining two worksheets are kept unchanged, all neighborhood solutions based on the worksheets '2-1-4', for example, '2-4-1', '1-2-4', '1-4-2', '4-1-2', '4-2-1', are generated, and the solution with the lowest cost is selected from all neighborhood solutions as a mutation child solution.
It should be noted that, the mutation probability and the mutation work individual number can be determined according to the computer calculation power, the scheduling requirement and the like, for example, when the computer calculation power is lower, the lower crossover probability can be determined, so as to determine that less solutions after crossover operation processing based on the POX operator are subjected to mutation operation, and the feasibility of the work order scheduling method is improved; when the computer examples are lower, fewer variant individual numbers are determined, fewer neighborhood solutions are generated, and the like.
After the mutation operation is executed, the current solution includes a plurality of solutions processed by the uncrossed binary tournament selection operation, a plurality of crossed child solutions, and a plurality of mutated child solutions, wherein the sum of the number of the mutated child solutions is higher than the preset number.
According to the embodiment of the invention, the solution processed by the cross operation based on the POX operator is subjected to the mutation operation according to the mutation probability, the neighborhood solution is generated, and the neighborhood solution with the lowest cost is determined in the neighborhood solution to be used as the mutation child solution, so that the number of low-cost solutions is increased, and the method is more beneficial to further determining the final solution with the lowest cost.
In one embodiment, population screening comprises:
and selecting a preset number of solutions with the lowest cost from the preset number of solutions and all variant child solutions processed by the cross operation based on the POX operator as a preset number of screening solutions corresponding to the current iteration optimization.
It should be noted that, the filtering operation may be implemented by determining a preset number of solutions with the lowest cost through an objective function, for example, the preset number is 50, after the cross operation processing based on the POX operator, the solutions include 50 solutions and 20 variant child solutions, calculating the cost of the 70 solutions through the objective function, and reserving the 50 solutions with the lowest cost as filtering solutions.
According to the embodiment of the invention, the solutions after binary tournament selection operation, POX operator-based cross operation and neighborhood search-based mutation operation are screened, and the preset number of solutions with the lowest cost are obtained for the next iteration.
In one embodiment, the work order is a cold rolled steel work order.
The production method disclosed by the invention can be applied to the production of cold rolled steel work orders.
Fig. 9 is a flowchart of a work order scheduling method according to an embodiment of the present invention, and in the following, with reference to fig. 9, the work order scheduling method according to the present invention is specifically described in an embodiment:
first, determining basic data, including: scheduling start time=2023-03-20:12:00:00, last lot last worksheet specification +. >=0.5, overlap ratio threshold +.>=0.25, thin gauge->=0.3 thick stock gauge ∈ ->=0.75, first time period set (white shift) 8:00-22:00 price of electricity +.>=0.81 yuan/degree, second time period set (night shift) 22:00-8:00 price of electricity +.>The method comprises the steps of (1) carrying out operation on a batch of work orders, wherein the number of work orders to be discharged is (0.28 yuan/degree), the total time of day is 24 hours, the number of work orders to be discharged is (N=150), the work orders of the batch are respectively (0.3, 0.35, 0.4, 0.45, 0.5, 0.55, 0.6, 0.65, 0.7 and 0.75), the processing time of each work order of the batch is 20 minutes, and the power consumption speed (unit kw/min) corresponding to each work order of the batch is respectively (91, 92, 93, 94, 96, 97, 99, 100, 102 and 103);
a second step of determining a lap cost function in the objective function, comprising:
(1) calculating the lap joint proportion of the work orders:
(2) the lap joint proportion of the work order determines lap joint cost:
/>
(3) determining a lap cost function
Third, determining an electric charge cost function in the objective function, including:
(1) calculating the processing time length of the work order in each period:
wherein:
(2) calculating the electricity charge cost of the work order:
(3) determining an electric charge cost function
Fourth step, according to、/>Determining an objective function->
Fifthly, determining end time work order specification constraints, including:
(1) calculating the scheduling end time of the work order of the current batch:
(2) Calculating the total work order processing time length of the current batch at the last time period:
(3) determining the position of the first work order in the production sequence in the last period:
(4) end time worksheet specification range constraints:
sixth, determining a work location constraint, comprising:
the location of each work order in each solution is unique:
the worksheet corresponding to each position in each solution is also unique:
seventh, determining the optimization parameters includes: maximum number of iterations 50, crossover probability 0.8, mutation probability 0.1, predetermined number of solutions 50.
Eighth step, starting the solution, including:
calculating the total processing time length of all work orders to be scheduled for 50 hours, calculating the total processing time length of all work orders to be scheduled for each time period, sequencing each time period from high to low according to electricity prices, and determining that a first time period set (white shift) is 30 hours in 8:00-22:00, and a second time period set (night shift) is 20 hours in 22:00-8:00;
sequencing the work orders to be produced from small to large according to the specification or the power consumption speed, accumulating the processing time sequentially according to the sequence until the accumulated value just reaches the processing time corresponding to the shift, forming a work single layer level L1 by the work orders participating in accumulation, and forming a layer level L2 by the rest work orders; 90 work orders are arranged in L1, and 60 work orders are arranged in L2; representing all work orders by positive integers of 1-150;
Randomly sequencing worksheets in an L1 layer and an L2 layer respectively to obtain 50 initial solutions;
according to the work orders in the hierarchy from back to front, the work orders in the hierarchy are inverted and arranged with the arrangement ending time 2023/03/22 14:00:00, the work orders can be arranged only when the specification is more than 0.3 and less than 0.75, the total processing time of the last period is 6 hours after the accumulated processing time is up to the last period, and then all the remaining work orders are rearranged from the arrangement starting time 2023/03/20:12:00:00 to front;
starting from the first work order of the L1 level, performing positive arrangement by taking the arrangement start time 2023/03/20:12:00:00 as a starting point, calculating the finishing time of each work order until the finishing time of a certain work order in the level reaches the shift, and switching to the L2 level, and performing the operation; repeating the above operation until no work order exists in one level, and then sequentially discharging all the rest work orders in the other level, and ending the positive discharging operation;
the method comprises the steps of adjusting the order of work orders after the front row is finished to obtain an adjustment solution, wherein the first time period is a shift, the electricity price is higher than that of the next time period, the position of the first work order is unchanged, the largest specification work order in other work orders in the first time period is placed at the end of the first time period, the position of the smallest specification work order is unchanged, the positions of the three work orders are fixed for positioning, the order of the work orders between the first work order and the smallest specification work order is reduced, if the work order which is larger than the first work order exists, the work order is moved between the smallest specification work order and the tail work order, and the order of the work orders between the smallest specification work order and the tail work order is increased;
The last time period is a shift, the electricity price is higher than that of the last time period, and the largest specification work order in the last time period is put at the first position of the last time period, and the sequence of the rest work orders is adjusted to be in descending specification;
for the rest time periods, if the electricity price of the middle time period is lower than the previous time period and higher than the next time period, the work order with the minimum specification in the middle time period is adjusted to the first position of the middle time period, and other work orders in the middle time period are sequentially increased in specification; if the electricity price of the intermediate period is higher than the previous period and lower than the next period, the work order with the largest specification in the intermediate period is adjusted to the first position of the intermediate period, and other work orders in the intermediate period are reduced in specification; if the electricity price of the middle period is lower than that of the last period and the next period, the work order with the smallest specification in the middle period is adjusted to the end of the middle period, the work order with the next smallest specification is adjusted to the first position of the middle period, the work order with the largest specification is kept unchanged, the work order from the first work order to the work order with the largest specification in the middle period is increased in specification, and the work order from the largest specification work order to the last work order is decreased in specification; if the electricity price of the middle period is higher than that of the previous period and the next period, the work order with the largest specification in the middle period is adjusted to the end of the middle period, the work order with the next largest specification is adjusted to the first position of the middle period, the work order with the smallest specification is kept unchanged, the work order from the first work order to the work order with the smallest specification in the middle period is reduced, and the work order from the work order with the smallest specification to the work order with the last specification is increased;
Calculating the total cost of the adjusted scheme, judging whether the current iteration number reaches the maximum iteration number 50, if so, outputting the scheduling scheme with the lowest total cost, and ending scheduling; otherwise, the iteration number is increased by one, and the iterative optimization step (ninth step) is entered.
And a ninth step of performing iterative optimization on the adjustment solution, including:
(1) selection operations based on binary tournaments:
selecting two individuals from 50 adjustment solutions, adding the individuals with smaller total cost into a cross population, and repeating the operation for 50 times until the number of the individuals in the solution to be crossed reaches 50;
(2) cross operation based on the POX operator:
sequentially selecting two solutions from individuals of a population to be crossed as father, randomly dividing a first solution P1 and a second solution P2 into two sets MS1 and MS2, copying MS1 in P1 into a child solution C1, copying MS1 in P2 into a child solution C2, reserving positions of two work orders in P1 and P2 in the MS1 into the child solution C1 and C2, sequentially arranging MS2 in P2 into C1, sequentially arranging MS2 in P1 into C2, sequentially reserving the sequence of three work orders in P1 and P2 in the MS2 into the child solution C1 and C2, and ending one-time cross operation;
sequentially selecting 2 individuals from the population to be crossed, and respectively performing the above-mentioned cross operation on the first and second worker single layers with a cross probability of 0.8 to obtain 2 offspring, repeating 25 times to obtain 50 crossed offspring solutions;
(3) Variance operation based on neighborhood search:
determining solutions to be mutated in the 50 crossed child solutions, determining the number r (r is more than or equal to 2 and less than or equal to 4) of mutated work orders, determining the mutated work orders in the solutions to be mutated, generating all neighbor solutions of the sequences, and selecting the neighbor solution with the lowest cost as a mutated child solution;
carrying out the mutation operation on one layer of codes by using the mutation probability of 0.1 sequentially on the 50 crossed child solutions obtained after the crossing;
all the solutions at present comprise solutions processed by a plurality of uncrossed binary tournament selection operations, a plurality of crossed child solutions and a plurality of mutated child solutions;
tenth step, population screening, including:
the 50 solutions with the lowest cost are reserved from all the current solutions to serve as screening solutions, and the screening solutions are used as initial solutions of the next iteration before the iteration reaches the maximum iteration number.
Eleventh step, determining a final solution, comprising:
after the iteration number reaches the maximum iteration number, determining a solution with the lowest cost as a final solution, and scheduling the work order according to the final solution.
It should be noted that, the job ticket scheduling method provided by the present invention may be implemented by adopting programming such as Python, java, etc., and taking Python programming as an example, the two algorithms of the scheduling method and the standard genetic algorithm of the present invention are adopted to perform 10 calculation experiments on the present embodiment under the operating environment of 2.30ghz intel (R) Core (TM) i7-10510UCPU, 16GRAM, win 10. The experimental result is that under the condition that the running time of the two algorithms is 1min, the total cost of the scheme which can be finally obtained by each experiment of the hybrid genetic algorithm is 170745 (wherein the switching cost is 0 and the electricity fee cost is 170745), and the hybrid genetic algorithm is globally optimal; while the average value of 10 experiments of the standard genetic algorithm is 470773.6 (wherein the switching cost is 300000 and the electricity fee cost is 170773.6), although the global optimum can be achieved in 5 of the 10 experiments, the stability of the result is poor; in contrast, the optimal ratio of the hybrid genetic algorithm is about 63.7%.
In addition, the following table 1 shows the comparison results of the experiment, and the performance test results of other scale examples are obviously superior to the standard genetic algorithm. In addition, aiming at the scale scene, for example, the on-site manual production scheduling is carried out, the time for searching the optimal production scheduling scheme can be greatly shortened by the current method, and the method has strong practical application value. For the above embodiment, the method solves the trend of the work order specification of the final production scheduling scheme (final solution) as shown in fig. 10, where the abscissa of fig. 10 represents the processing time period and the ordinate represents the work order specification.
TABLE 1 Performance test experiment results of worksheet scheduling method and Standard genetic Algorithm
The embodiment of the invention also provides a work order scheduling device which can be correspondingly referred to the work order scheduling method.
Fig. 11 is a schematic structural diagram of a work order scheduling device according to an embodiment of the present invention. Referring to fig. 11, a work order scheduling device provided by an embodiment of the present invention may include:
the first encoding module 1101 is configured to sort the time periods according to the electricity price corresponding to the time periods participating in production scheduling, and divide the time periods after sorting into a first time period set and a second time period set;
The second encoding module 1102 is configured to sort the work orders according to the specification size or the power consumption speed of the work orders in a sorting manner opposite to the sorting of the time periods, and sequentially allocate the processing time lengths corresponding to the work orders to the first time period set and the second time period set, so as to form a first work monolayer and a second work monolayer;
a determining module 1103, configured to randomly sort the worksheets in the first worksheet and the second worksheet, respectively, to obtain a predetermined number of initial solutions;
an optimization module 1104, configured to iteratively optimize a predetermined number of initial solutions until the number of iterations reaches an upper limit and output a final solution;
a scheduling module 1105, configured to schedule the work order according to the final solution;
each solution represents the position of the processing time length corresponding to each work order in each period of the participation production; the final solution is the solution with the lowest cost determined by the objective function; the objective function is determined by a lap joint cost function and an electric charge cost function, the lap joint cost function is used for determining the cost corresponding to the specification lap joint of different work orders, and the electric charge cost function is used for determining the electric charge cost corresponding to the processing of each work order.
In one embodiment, the first encoding module 1101 is further configured to:
sequentially accumulating the sequenced time periods until the accumulated time period is longer than half of the total processing time period of all work orders, or one part of each time period is left to be not involved in accumulation;
the time periods participating in accumulation form a first time period set, and the time periods not participating in accumulation form a second time period set.
In one embodiment, the optimization module 1104 is further configured to:
the work order of each of the preset target solutions is adjusted according to a preset rule, so that a preset number of adjustment solutions are obtained;
and sequentially carrying out binary tournament selection operation, POX operator-based cross operation, neighborhood search-based mutation operation and population screening on the preset number of adjustment solutions to obtain the preset number of screening solutions.
In one embodiment, the optimization module 1104 is further configured to: starting from the ending time of the last time period, arranging all the first work orders in the work order level of the first work orders in a reverse manner until the processing time of the last time period is reached;
if the sum of the processing time lengths corresponding to the first work orders does not reach the processing time length of the last time period, then the second work orders are inverted to the last time period according to the sequence of the second work orders in the work order level, and the processing time length of the last time period is reached;
According to the level of the work orders and the sequence of the work orders in the level of the work orders, the residual work orders are sequentially discharged to the time intervals from the starting time of the initial time interval; wherein the remaining work orders are work orders other than the work order in the last period;
and (3) carrying out position adjustment on each work order arranged in each time period so as to realize continuous increment or decrement of the specification of each work order.
In one embodiment, the optimization module 1104 is further configured to: if the electricity price of the first time period is lower than the electricity price of the next time period, the position of the first work order in the first time period is kept unchanged, the position of the work order with the largest specification in the rest work orders in the first time period is kept unchanged, the work order with the smallest specification is adjusted to the end of the first time period, the order of the work orders from the first work order to the work order with the largest specification is increased, and the order of the work orders between the work orders with the largest specification and the work orders with the tail is decreased;
if the electricity price of the first time period is higher than that of the next time period, the position of the first work order in the first time period is kept unchanged, the position of the work order with the smallest specification in the rest work orders in the first time period is kept unchanged, the work order with the largest specification is adjusted to the end of the first time period, the work order from the first work order to the work order with the smallest specification is reduced, and the work order between the work order with the smallest specification and the work order with the tail is increased;
If the electricity price of the last time period is lower than that of the last time period, the work order with the minimum specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are sequentially increased in specification;
if the electricity price of the last time period is higher than that of the last time period, the work order with the largest specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are decreased in order in specification;
if the electricity price of the intermediate period is lower than the previous period and higher than the next period, the work order with the minimum specification in the intermediate period is adjusted to the first position of the intermediate period, and other work orders in the intermediate period are sequentially increased in specification;
if the electricity price of the intermediate period is higher than the previous period and lower than the next period, the work order with the largest specification in the intermediate period is adjusted to the first position of the intermediate period, and other work orders in the intermediate period are reduced in specification;
if the electricity price of the middle period is lower than that of the last period and the next period, the work order with the smallest specification in the middle period is adjusted to the end of the middle period, the work order with the next smallest specification is adjusted to the first position of the middle period, the work order with the largest specification is kept unchanged, the work order from the first work order to the work order with the largest specification in the middle period is increased in specification, and the work order from the work order with the largest specification to the work order with the tail is decreased in specification;
If the electricity price of the middle period is higher than that of the last period and the next period, the work order with the largest specification in the middle period is adjusted to the end of the middle period, the work order with the next largest specification is adjusted to the first position of the middle period, the work order with the smallest specification is kept unchanged, the work order from the first work order to the work order with the smallest specification in the middle period is reduced, and the work order from the work order with the smallest specification to the work order with the last specification is increased.
In one embodiment, the optimization module 1104 is further configured to:
sequentially selecting 2 solutions from the preset number of solutions processed by the binary tournament selection operation, and performing cross operation on the 2 solutions according to the cross probability;
the interleaving operation includes:
randomly dividing each work order into a first work order set and a second work order set;
copying the worksheets of the first solution and the second solution in the first worksheet set into a first child solution and a second child solution respectively, and keeping the positions of the worksheets in the first worksheet set in the 2 child solutions unchanged;
the worksheets of the first solution and the second solution in the second worksheet set are copied into the second child solution and the first child solution respectively, and the order of the worksheets in the second worksheet set in the 2 child solutions is kept unchanged.
In one embodiment, the optimization module 1104 is further configured to:
selecting at least one solution from a predetermined number of solutions processed based on the cross operation of the POX operator according to the mutation probability, and performing a mutation operation on each of the at least one solution;
the mutation operation comprises the following steps:
and randomly selecting a plurality of worksheets from the solutions, generating all neighborhood solutions for sequencing the worksheets, and selecting the solution with the lowest cost from all neighborhood solutions as a variant child solution.
In one embodiment, the optimization module 1104 is further configured to:
and selecting a preset number of solutions with the lowest cost from a preset number of solutions processed based on the cross operation of the POX operator and all variant child solutions as a preset number of screening solutions corresponding to the current iteration optimization.
According to the work order scheduling device provided by the embodiment of the invention, the work orders are subjected to double-layer coding by combining the electricity prices and the specification or the electricity consumption speed of the work orders, so that the electricity fee cost is greatly optimized when the initial solution is obtained, the repeated iterative optimization is performed on the initial solution, the electricity consumption cost and the lap joint cost are further optimized, meanwhile, the blindness of calculation in the iterative search stage can be reduced in a double-layer coding mode, and compared with the traditional manual scheduling and standard genetic algorithm, the scheduling efficiency is greatly improved, and the scheduling cost is remarkably reduced.
In one embodiment, the work order scheduling system provided by the embodiment of the invention comprises a power consumption maintenance module, a digital scheduling module and a graphical display module.
The power consumption maintenance module is used for maintaining the relation between the specification of the finished product and the power consumption in unit time, providing data support for calculating the cost of the electric charge, wherein the data can comprise information such as factory information, work order type, specification, unit power consumption, raw material stock code, raw material stock name, raw material specification, raw material surface, width and the like, and can be stored in a cloud database, a hard disk and the like, and can be displayed in a form, a page and the like.
It should be noted that, the digital production scheduling module may select the designated work order in the page as the first work order to be scheduled, and the rest work orders are scheduled after the designated work order and are non-scheduled work orders of the same work order type of the designated work order, so as to implement preferential production of the designated work order.
It should be noted that the digital scheduling module may be used for manually intervening scheduling sequence, designating priority scheduling worksheets, and may also be used for displaying information such as resource description, production line description, specification and size, worksheet number, start time, completion time, etc. of scheduling each worksheet.
It should be noted that the digital production scheduling module further includes two sub-modules: the system comprises a basic data maintenance submodule and an optimization parameter maintenance submodule, wherein the basic data maintenance submodule is used for maintaining basic data such as thin material specification, thick material specification and lap joint proportion, and the optimization parameter maintenance submodule is used for maintaining optimization parameters such as cross probability, variation probability maximum iteration number and the like.
The digital production scheduling module can maintain each parameter based on the two sub-modules, updates the sub-sections such as the production start time and the production end time of each work order aiming at the work order to be produced by the work order scheduling method and displays the sub-sections on the interface in a report form.
It should be noted that the graphic display module may provide a visual operation interface for the work order production system.
The work order scheduling system provided by the embodiment of the invention can provide visual operation which meets the service requirement, is convenient and quick to operate and has high availability for service personnel by providing the functions of power consumption maintenance, digital scheduling, graphical display and the like, and is convenient for the service personnel to schedule, maintain and know the scheduling condition.
Fig. 12 is a schematic physical structure of an electronic device according to an embodiment of the present invention, and as shown in fig. 12, the electronic device may include: processor 1210, communication interface (Communication Interface), 1220, memory 1230 and communication bus 1240, wherein processor 1210, communication interface 1220 and memory 1230 communicate with each other via communication bus 1240. Processor 1210 may call logic instructions in memory 1230 to perform the following method:
Sequencing the time periods according to the electricity price corresponding to the time periods participating in scheduling, and dividing the sequenced time periods into a first time period set and a second time period set;
according to the specification size or the power consumption speed of each work order, sequencing each work order in a sequencing mode opposite to sequencing each time period, and sequentially distributing the processing time length corresponding to each work order to the first time period set and the second time period set to form a first work monolayer and a second work monolayer;
randomly sequencing worksheets in the first worksheet and the second worksheet respectively to obtain a preset number of initial solutions;
performing iterative optimization on a predetermined number of initial solutions until the iterative times reach an upper limit and outputting a final solution;
scheduling the work orders according to the final solution;
in addition, the logic instructions in the memory 1230 described above may be implemented in the form of software functional units and sold or used as a stand-alone product, stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the related art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In yet another aspect, embodiments of the present invention further provide a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the method provided by the above embodiments, for example, comprising:
sequencing the time periods according to the electricity price corresponding to the time periods participating in scheduling, and dividing the sequenced time periods into a first time period set and a second time period set;
according to the specification size or the power consumption speed of each work order, sequencing each work order in a sequencing mode opposite to sequencing each time period, and sequentially distributing the processing time length corresponding to each work order to the first time period set and the second time period set to form a first work monolayer and a second work monolayer;
randomly sequencing worksheets in the first worksheet and the second worksheet respectively to obtain a preset number of initial solutions;
performing iterative optimization on a predetermined number of initial solutions until the iterative times reach an upper limit and outputting a final solution;
scheduling the work orders according to the final solution;
the apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on such understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the related art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that the above-mentioned embodiments are merely illustrative of the invention, and not limiting. While the invention has been described in detail with reference to the embodiments, those skilled in the art will appreciate that various combinations, modifications, or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, and it is intended to be covered by the scope of the claims of the present invention.

Claims (12)

1. A work order scheduling method, comprising:
Sequencing the time periods according to the electricity price corresponding to the time periods participating in scheduling, and dividing the sequenced time periods into a first time period set and a second time period set;
according to the specification size or the power consumption speed of each work order, sequencing each work order in a sequencing mode opposite to sequencing each time period, and sequentially distributing the processing time length corresponding to each work order to the first time period set and the second time period set to form a first work monolayer and a second work monolayer; the sequencing of the time periods is ascending sequencing or descending sequencing;
randomly sequencing worksheets in the first worksheet and the second worksheet respectively to obtain a preset number of initial solutions;
performing iterative optimization on the preset number of initial solutions until the iterative times reach an upper limit and outputting a final solution;
scheduling the work orders according to the final solution;
each solution represents the position of the processing time length corresponding to each work order in each period of the participation production; the final solution is the solution with the lowest cost determined by the objective function; the objective function is determined by a lap joint cost function and an electric charge cost function, the lap joint cost function is used for determining the cost corresponding to the specification lap joint of different work orders, and the electric charge cost function is used for determining the electric charge cost corresponding to the processing of each work order; the cost corresponding to the specification overlap joint of different worksheets is determined by the following modes: and determining the lap joint proportion between the work orders, and determining the cost corresponding to the specification lap joint of different work orders according to the lap joint proportion under the condition that the lap joint proportion is larger than the lap joint proportion threshold value.
2. The work order production method of claim 1, wherein the dividing the ordered time periods into a first time period set and a second time period set comprises:
sequentially accumulating the sequenced time periods until the accumulated time period is longer than half of the total processing time period of all work orders, or one part of each time period is left to be not involved in accumulation;
and forming the time periods participating in accumulation into the first time period set, and forming the time periods not participating in accumulation into the second time period set.
3. The work order production method of claim 1, wherein the iterative optimization comprises the steps of:
the work order of each of the preset target solutions is adjusted according to a preset rule, so that a preset number of adjustment solutions are obtained;
sequentially performing binary tournament selection operation, POX operator-based cross operation, neighborhood search-based mutation operation and population screening on the preset number of adjustment solutions to obtain a preset number of screening solutions;
wherein, the target solution corresponding to the first iterative optimization is the initial solution; the target solution corresponding to the first iterative optimization is the screening solution corresponding to the last iterative optimization.
4. The work order production method of claim 3, wherein the preset rule comprises:
Starting from the ending time of the last time period, arranging all the first work orders to the last time period in the order of the first work orders in the work order level until the processing time length of the last time period is reached;
if the sum of the processing time lengths corresponding to the first work orders does not reach the processing time length of the last time period, then the second work orders are inverted to the last time period according to the sequence of the second work orders in the work order level, and the processing time length of the last time period is reached;
the first work order is a work order in a work order level corresponding to the last time period, the second work order is a work order in another work order level, and the specification of the first work order and the specification of the second work order are both larger than a specification lower limit value and smaller than a specification upper limit value;
according to the level of the work orders and the sequence of the work orders in the level of the work orders, the residual work orders are sequentially discharged to the time intervals from the starting time of the initial time interval; wherein the remaining worksheets are worksheets other than the worksheets in the last period;
and (3) carrying out position adjustment on each work order arranged in each time period so as to realize continuous increment or decrement of the specification of each work order.
5. The work order placement method as set forth in claim 4, wherein said performing a position adjustment of each work order after being aligned to each time period comprises:
if the electricity price of the first time period is lower than the electricity price of the next time period, the position of the first work order in the first time period is kept unchanged, the position of the work order with the largest specification in the rest work orders in the first time period is kept unchanged, the work order with the smallest specification is adjusted to the tail end of the first time period, the work order from the first work order to the work order with the largest specification is increased in specification, and the work order between the work order with the largest specification and the tail work order is decreased in specification;
if the electricity price of the first time period is higher than that of the next time period, the position of the first work order in the first time period is kept unchanged, the position of the work order with the smallest specification in the rest work orders in the first time period is kept unchanged, the work order with the largest specification is adjusted to the tail end of the first time period, the order of the work orders from the first work order to the work order with the smallest specification is decreased, and the order of the work orders between the work orders with the smallest specification and the tail work order is increased;
if the electricity price of the last time period is lower than that of the last time period, the work order with the minimum specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are sequentially increased in specification;
If the electricity price of the last time period is higher than that of the last time period, the work order with the largest specification in the last time period is adjusted to the first position of the last time period, and other work orders in the last time period are reduced in specification in sequence;
if the electricity price of the middle period is lower than the previous period and higher than the next period, the work order with the smallest specification in the middle period is adjusted to the first position of the middle period, and other work orders in the middle period are sequentially increased in specification;
if the electricity price of the middle period is higher than the previous period and lower than the next period, the work order with the largest specification in the middle period is adjusted to the first position of the middle period, and other work orders in the middle period are decreased in specification in sequence;
if the electricity price of the middle period is lower than that of the last period and the next period, the work order with the smallest specification in the middle period is adjusted to the end of the middle period, the work order with the smallest specification is adjusted to the first position of the middle period, the work order with the largest specification is kept unchanged, the work order from the first work order to the work order with the largest specification in the middle period is increased in specification, and the work order from the work order with the largest specification to the work order with the tail is decreased in specification;
If the electricity price of the middle period is higher than that of the last period and the next period, the work order with the largest specification in the middle period is adjusted to the end of the middle period, the work order with the next largest specification is adjusted to the first position of the middle period, the work order with the smallest specification is kept unchanged, the order of the work orders from the first work order to the work order with the smallest specification in the middle period is decreased, and the order of the work orders from the smallest specification work order to the last work order is increased.
6. The work order production method according to claim 3, wherein the cross operation based on the POX operator includes:
sequentially selecting 2 solutions from a preset number of solutions processed by the binary tournament selection operation, and performing cross operation on the 2 solutions according to cross probability;
the interleaving operation includes:
randomly dividing each work order into a first work order set and a second work order set;
copying the worksheets of the first solution and the second solution in the first worksheet set into a first child solution and a second child solution respectively, and keeping the positions of the worksheets in the first worksheet set in the 2 child solutions unchanged;
copying the worksheets of the second worksheet set into a second child solution and a first child solution, and keeping the order of the 2 child solutions of the worksheets Shan Zaisuo in the second worksheet set unchanged.
7. The work order production method of claim 3, wherein the neighborhood search-based mutation operation comprises:
selecting at least one solution from a predetermined number of solutions processed based on the cross operation of the POX operator according to the mutation probability, and performing mutation operation on each of the at least one solution;
the mutation operation comprises the following steps:
and randomly selecting a plurality of worksheets from the solutions, generating all neighborhood solutions of the plurality of worksheets in sequence, and selecting the solution with the lowest cost from all neighborhood solutions as a variant child solution.
8. The work order production method of claim 7, wherein the population screening comprises:
and selecting a preset number of solutions with the lowest cost from the preset number of solutions and all variant child solutions processed by the cross operation based on the POX operator as a preset number of screening solutions corresponding to the current iteration optimization.
9. The work order layout method according to any one of claims 1 to 8, wherein the work order is a cold rolled steel work order.
10. A work order scheduling device, comprising:
the first coding module is used for sequencing the time periods according to the electricity price corresponding to the time periods participating in scheduling, and dividing the sequenced time periods into a first time period set and a second time period set;
The second coding module is used for sequencing the work orders in a sequencing mode opposite to sequencing the time intervals according to the specification size or the power consumption speed of the work orders, and sequentially distributing the processing time length corresponding to the work orders to the first time interval set and the second time interval set so as to form a first work monolayer and a second work monolayer; the sequencing of the time periods is ascending sequencing or descending sequencing;
the determining module is used for respectively carrying out random sequencing on the worksheets in the first worksheet and the second worksheet to obtain a preset number of initial solutions;
the optimization module is used for carrying out iterative optimization on the preset number of initial solutions until the iterative times reach an upper limit and outputting a final solution;
the scheduling module is used for scheduling the work orders according to the final solution;
each solution represents the position of the processing time length corresponding to each work order in each period of the participation production; the final solution is the solution with the lowest cost determined by the objective function; the objective function is determined by a lap joint cost function and an electric charge cost function, the lap joint cost function is used for determining the cost corresponding to the specification lap joint of different work orders, and the electric charge cost function is used for determining the electric charge cost corresponding to the processing of each work order; the cost corresponding to the specification overlap joint of different worksheets is determined by the following modes: and determining the lap joint proportion between the work orders, and determining the cost corresponding to the specification lap joint of different work orders according to the lap joint proportion under the condition that the lap joint proportion is larger than the lap joint proportion threshold value.
11. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the work order production method of any of claims 1 to 9 when the computer program is executed by the processor.
12. A non-transitory computer readable storage medium having stored thereon a computer program, which when executed by a processor implements the work order production method of any of claims 1 to 9.
CN202311135933.7A 2023-09-05 2023-09-05 Work order scheduling method and device, electronic equipment and storage medium Active CN116882593B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311135933.7A CN116882593B (en) 2023-09-05 2023-09-05 Work order scheduling method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311135933.7A CN116882593B (en) 2023-09-05 2023-09-05 Work order scheduling method and device, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN116882593A CN116882593A (en) 2023-10-13
CN116882593B true CN116882593B (en) 2024-02-23

Family

ID=88271803

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311135933.7A Active CN116882593B (en) 2023-09-05 2023-09-05 Work order scheduling method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN116882593B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103617472A (en) * 2013-07-09 2014-03-05 成都希盟泰克科技发展有限公司 Resource balancing self-adaption scheduling method of multi-project and multi-task management
CN104463414A (en) * 2014-10-23 2015-03-25 湘潭大学 Hot rolling production economic load scheduling method used under time-of-use power price
CN106971243A (en) * 2017-03-29 2017-07-21 湘潭大学 It is a kind of to reduce the hot rolling Optimization Scheduling of productive power cost
WO2022000924A1 (en) * 2020-07-01 2022-01-06 北京工业大学 Double-resource die job shop scheduling optimization method based on ammas-ga nested algorithm

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103617472A (en) * 2013-07-09 2014-03-05 成都希盟泰克科技发展有限公司 Resource balancing self-adaption scheduling method of multi-project and multi-task management
CN104463414A (en) * 2014-10-23 2015-03-25 湘潭大学 Hot rolling production economic load scheduling method used under time-of-use power price
CN106971243A (en) * 2017-03-29 2017-07-21 湘潭大学 It is a kind of to reduce the hot rolling Optimization Scheduling of productive power cost
WO2022000924A1 (en) * 2020-07-01 2022-01-06 北京工业大学 Double-resource die job shop scheduling optimization method based on ammas-ga nested algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
带有活动重叠的多模式资源受限项目调度问题;初梓豪等;《计算机集成制造系统》;第23卷(第03期);第557-566页 *
带流水作业工程项目调度问题的遗传算法;路深等;《控制工程》;第12卷(第01期);第11-14页 *

Also Published As

Publication number Publication date
CN116882593A (en) 2023-10-13

Similar Documents

Publication Publication Date Title
CN109636011B (en) Multi-shift planning and scheduling method based on improved variable neighborhood genetic algorithm
CN109934391B (en) Intelligent scheduling method for pure electric bus
US20190181644A1 (en) Pcs efficiency-considered microgrid operation device and operation method
CN110956371B (en) Green scheduling optimization method for intelligent manufacturing workshop facing complex man-machine coupling
CN111525601A (en) Charging and discharging control method and device for user side energy storage equipment and storage medium
JP2008067481A (en) Operation assisting method and device of power supply facility
CN110838076B (en) Monthly cross-provincial region renewable energy consumption method and terminal equipment
CN112801414B (en) Assembly type building component scheduling optimization method and system
CN109559062A (en) A kind of task distribution of cooperative logistical problem and paths planning method
CN112785454A (en) Intelligent scheduling method for flood season of cascade hydropower station and decision support system
CN113904385A (en) New energy power generation side virtual power plant shared energy storage method and system and storage medium
CN113159687B (en) Workshop AGV-UAV (automated guided vehicle-unmanned aerial vehicle) coordinated material distribution path planning method and system
Feng et al. Scenario reduction for stochastic unit commitment with wind penetration
CN105207207B (en) Micro-grid system dispatching method under isolated network state based on energy management
CN116882593B (en) Work order scheduling method and device, electronic equipment and storage medium
CN112668248A (en) Method and system for scheduling optimization calculation theoretical model of concrete transport vehicle
CN113779874A (en) Multi-objective optimization method for off-grid microgrid construction
CN113344273A (en) Building energy consumption based method and system for adjusting and optimizing peak-valley difference of regional distribution network
CN114074569A (en) Charging control method and system
JPH11259450A (en) Optimal output deciding method and device therefor
CN115952896A (en) Flexible job shop scheduling method based on material process alignment
CN115713202A (en) Ordered power utilization scheme making method based on two-stage stochastic programming algorithm
CN115663936A (en) Method and system for evaluating and improving energy storage full life cycle SOH (self-organizing hydrogen) staged utilization value
CN114580919A (en) Multi-scene two-stage demand response resource optimal scheduling method, device and equipment
CN115860593A (en) Energy storage scheduling method, device, equipment and storage medium

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
GR01 Patent grant
GR01 Patent grant