CN106503944A - Rule-based body section Logistic Scheduling method - Google Patents
Rule-based body section Logistic Scheduling method Download PDFInfo
- Publication number
- CN106503944A CN106503944A CN201610946529.1A CN201610946529A CN106503944A CN 106503944 A CN106503944 A CN 106503944A CN 201610946529 A CN201610946529 A CN 201610946529A CN 106503944 A CN106503944 A CN 106503944A
- Authority
- CN
- China
- Prior art keywords
- segmentation
- place
- level place
- level
- coefficient
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 230000011218 segmentation Effects 0.000 claims abstract description 90
- 230000008569 process Effects 0.000 claims description 22
- 230000007306 turnover Effects 0.000 claims description 4
- 238000007726 management method Methods 0.000 claims description 2
- 230000032258 transport Effects 0.000 claims description 2
- 230000001105 regulatory effect Effects 0.000 claims 1
- 238000004519 manufacturing process Methods 0.000 abstract description 5
- 238000007689 inspection Methods 0.000 abstract 1
- 230000002459 sustained effect Effects 0.000 abstract 1
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000004821 distillation Methods 0.000 description 1
- 239000013067 intermediate product Substances 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000003754 machining Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000028742 placenta development Effects 0.000 description 1
- 238000005096 rolling process Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the automatization of manufacturing and message area, and in particular to the dynamic dispatching method of logistics operation in a kind of body section factory towards shipyard.By the design of rule, make the logistics department in shipyard while the body section for meeting production division moves demand, by the execution of fork instruction, check and regulate related place, it is more reasonable that segmentation is put so that within a period of time, the fork instruction number of segmentation logistics is minimum in factory.By the inspection of time, reach in the case of 80% in the segmentation rate of storing up, fork instruction can be reduced to the 40% or so of total instruction number.Meanwhile, by improving rule base, the method sustained improvement can be made.
Description
Technical field
The invention belongs to the automatization of manufacturing and message area, and in particular to a kind of body section factory towards shipyard
The dynamic dispatching method of interior logistics operation.
Technical background
Intermediate products of the boat segmental as shipbuilding, before assembled formation, need in factory through mopping, fitting-out
Etc. program.As the stacking ability in stockyard place and the efficiency of production and processing are limited, boat segmental often occurs in the venue
The situation of intensive stacking.In practical operation, the stacking of segmentation often fails realization and makes rational planning for, while the production schedule has warp
The variation of perseverance, causing the removal of a segmentation in stockyard to move into needs to produce substantial amounts of fork instruction, has had a strong impact in field
Logistic efficiency.
Body section needed successively to be stacked in multiple stockyards and processed before final assembly is carried out.Each heap
Finite capacity and function phase are to single, and the operation stage of each carrying out required by segmentation is different, and this requires
Each segmentation carries out difference and orderly one-way flow between several stockyards.Daily, business department all can be carried to logistics department
Go out the demand of some segmentation movements, as target segment is stored on each two grades of places, and on two grades of places, do not reserve flat board
The space that car is travelled, will remove other segmentations that target segment is accomplished by first moving away on path using roomy flat car, that is, spread out
Raw instruction so that subsection scheduling complication.
In academic documents field, there is scholar to plan the heuristic value for proposing Logistic Scheduling, profit according to segmentation operation
With the time window dynamic of segmental machining, rolling scheduling window and scroll mechanism are set；By complicated dynamic spatial scheduling problem point
Solve as some short cycles and the scheduling sub-problem on single job platform.However, in enterprise practical operation, body section thing
Stream scheduling does not have reliable supplementary meanss, appoints the operating experience for so depending on staff, there is no related published patent.
Content of the invention
For reducing the fork instruction number that body section is moved in factory, shipbuilding efficiency is improved, reduce operating cost, this
Invention proposes a kind of rule-based body section Logistic Scheduling method.The present invention makes dividing for place in order to interior in a period of time
Section is put relatively reasonable, when subsection scheduling is carried out, can reduce fork instruction as far as possible.
Technical scheme utilizes segmentation placement regulation, during body section move is executed so that
Segmented general carries number of times minimum, and which in turn includes the following steps：
Step（1）Obtain the spatial data of shipyard field division
The operation stockyard in whole shipyard is defined as one-level place, according to the difference of job class, be divided into multiple that
Two grades of places of this isolation, job class include application and fitting-out, and in two grades of places, each can accommodate the area that a segmentation is put
Domain is defined as three-level place.
Step（2）Obtain three-level place status data
Based on shipbuilding management system, the real-time status data in three-level place is obtained, including fixed attribute：Three-level place
Technique is supported, coefficient is stacked, whether is contained energy source, and dynamic attribute in coding, affiliated region, place priority, place：
The segmentation that is stacked ID, stack segmentation the three-level place remaining process cycle natural law, wherein place priority be divided into A,
B, C three-level；Space for three-level place is controlled, and needs to be previously set：It is 0 to stack coefficient near the place of road, with road
The stacking coefficient in the 1 three-level place in interval is 1, the like, ideally, process cycle natural law is short（Priority is passed in and out
High）Segmentation be distributed in place periphery, that is, stack the low three-level place of coefficient.
Step（3）Obtain segmentation movement application inventory
There is provided by business department, including mobile application ID, mobile segmentation ID, the three-level place coding of sending area, technique
Flow direction, kinetic energy demand, stages process cycle natural law.
Step（4）According to the rule for setting, the move of flat car is calculated
Step（4.1）Segmentation movement application inventory is ranked up, is sorted according to technique flow direction rearward forward, technique is flowed to
Identical, then the short sequence of process cycle is forward.
Step（4.2）The three-level place of computation-free, including current idle three-level place coding and segmentation movement application
In inventory, the three-level place for removing is encoded by segmentation.
Step（4.3）Each three-level place resistance is calculated, the rest period day of coefficient and segmentation in place is stacked according to place
Several sequences are calculated；For three-level place, the place for having put segmentation produces Resistance Value, does not produce Resistance Value barnyard；
Preferentially put in the path constituted by irrational segmentation from those when resistance minimal path is calculated and pass through, to passing through
These are put irrational segmentation and are placed into rational position by fork instruction；Concrete execution step is as follows：With each two grades of places
Executed for overall successively, be ranked up according to remaining process cycle natural law of the segmentation in each three-level place, by the sequence of segmentation with
Place is stacked the sequence of coefficient and is compared, and finds out the unmatched segmentation of sequence number, that is, put improper, and these segmentations are located
The Resistance Value in three-level place is set to a (0<a<1), if meaning, the fork instruction for producing will move a segmentation, preferential shifting
Movable pendulum puts inappropriate segmentation.
Place Resistance Value refers to the resistance run into by flat car through certain three-level place, and the Resistance Value on barnyard ground is 0,
The three-level place Resistance Value for having segmentation to put is a certain occurrence.
Consider the present situation of putting that should optimize stockyard in segmentation moving process simultaneously, the stacking coefficient in place and segmentation work
The relation in skill cycle.From from the perspective of global optimization, the probability that the larger segmentation of process cycle natural law is extracted in the recent period is less,
Should be placed on the larger three-level place of coefficient is stacked in order to avoid stopping the path of the segmentation of other advantage distillations, and process cycle natural law
Less segmentation should be placed on the less three-level place of stacking coefficient in order to passing in and out.Determine the stacking system in two grades of places first
Number ordered series of numbers, if it is [10,8,8] that the three-level place number that coefficient is 0,1,2 is stacked in certain two grades of place；Secondly according to segmentation at this
The remaining process cycle natural law on ground is ranked up, if the rest period natural law of certain segmentation arranges the 12nd on two grades of places, its institute
Three-level place stacking coefficient be 0.The sequence of cycle phase natural law is compared with ordered series of numbers is stacked, it is found that the segmentation has been placed on and is not conformed to
The Resistance Value of the segmentation is set to a (a by suitable position<1), a<If 1 represents that the fork instruction for producing will move a segmentation,
Then inappropriate segmentation is put in preferential movement.If if the rest period natural law of certain segmentation arranges the 15th on two grades of places, its institute
Three-level place stacking coefficient be 1, represent that the segmentation is positioned over suitable place, arrange the place Resistance Value be 1.Reason
In the case of thinking, cycle natural law is short（That is turnover priority is high）Segmentation be placed in and stack the low three-level place of coefficient, and true past
Past is not thus, this method preferentially puts the road constituted by irrational segmentation from those when resistance minimal path is calculated
Pass through in footpath, to by fork instruction, these being put irrational segmentation and being placed into rational position；Concrete execution step
As follows：Executed as overall successively with each two grades of places, arranged according to remaining process cycle natural law of the segmentation in each three-level place
Sequence, the sequence that coefficient is stacked in the sequence of segmentation and place is compared, is found out the unmatched segmentation of sequence number, that is, is put and do not conform to
Suitable, the Resistance Value in the three-level place that these segmentations are located is set to a (0<a<1), if meaning, the fork instruction for producing will be moved
A segmentation is moved, then inappropriate segmentation is put in preferential movement.
Step（4.4）Calculate place drag overall and enter the path that appears on the scene, three-level place is calculated to the minimum path of road resistance
And drag overall value, path three-level place coded representation.
For the minimum consideration of fork instruction during making into appearance, each two grades of place is built into a network, structure
Construction method is as follows：With each three-level place as summit, connected with directed edge between two adjacent three-level places, weight is entrance
The Resistance Value in the place, builds place directed graph.Using path calculation method, each three-level place superior self-cultivation roadlock can be calculated
The minimum path of force value, path can be represented with three-level place sequence.
Step（4.5）Movement is specified to apply for segmentation three-level place to be moved in inventory, the hard constraint for needing satisfaction is：Dynamic
The energy and process attribute, soft-constraint are followed successively by place priority, stack coefficients match and drag overall.
It is noted that three-level place should meet every constraints when selected target three-level place, firm constraints include
Meet energy source demand, target process stage.Soft constraint is followed successively by place priority, place and stacks coefficient, turnover resistance most
Little value.
Step（4.6）The instruction reorder that plan is executed, technique flow direction are sorted forward, little forward of Resistance Value rearward.
Step（4.7）Flat car transports fork instruction computing, successively in the following order：Check and regulate, wait to move in place to be moved into
Appear on the scene check and regulate, Planning Directive；Regulation：Fork instruction does not allow to produce fork instruction again, and the segmentation that fork instruction is produced is preferential
The position of free time is positioned over, and original position is put back to if without clear position.
Beneficial effect
The setting of rule, reduces artificial uncertain, and by practical proof, general shipyard is reached in stockyard stacking rate
When more than 80%, fork instruction can be reduced to 40% or so.
Meanwhile, by actual operation, can constantly improve rule base so that the method has good expansible
Property.
Description of the drawings
Fig. 1 is rule-based body section Logistic Scheduling method flow.
Fig. 2 is that present situation is put in place segmentation, has three two grades of places, and oblique line represents that the part is wall, and flat car cannot
Turnover, each lattice represent 1 three-level place, and the numeral on grid represents the remaining technique week for being positioned over segmentation on the place
Phase natural law, is idle place without numerical monitor, and numerical monitor is 0 segmentation for executing down one technique.
Fig. 3 is that coefficient is stacked in place, and the numeral on grid represents the stacking coefficient in the place.
Fig. 4 is place Resistance Value, and the numeral on grid represents the intake resistance in the place.
Fig. 5 is the drag overall value in place to road, the numeral on grid represent segmentation on the place to road or point
Section enters the drag overall value in the place.
Specific embodiment
For further illustrating each embodiment, the present invention is provided with accompanying drawing.A part of these accompanying drawings for present invention, its
Main in order to embodiment to be described, and the associated description of description can be coordinated to disclose the operation principles of embodiment.Coordinate and refer to this
A little contents, those of ordinary skill in the art will be understood that other possible embodiments and advantages of the present invention, overall calculating
Flow process is as shown in Figure 1.
In conjunction with the drawings and specific embodiments, the present invention is further described, is to simplify explanation, embodiment is done one
Fixed simplified, it is assumed that shipyard has three segmentations to stack places, has stacked the segmentation of different cycles number, as shown in Figure 2 on place.Per piece
Certain technique is absorbed in two grades of places, and technique 1 is completed in two grades of places 1, and technique 2 is completed in two grades of places 2, and technique 3 is in three-level
Place 3 completes.Stacking coefficient per two grades of places of piece is as shown in Figure 3.Assume that all segmentations have kinetic energy demand, and all three-level fields
All there is energy source on ground.
In order to simplify description, using following denotational descriptions
Row sequence number of the i three-levels place in corresponding two grades of places
Row sequence number of the j three-levels place in corresponding two grades of places
The three-level place of (i, j) on two grades of place n
Three-level placeStacking coefficient
Three-level placeOn segmentation
SegmentationThe cycle natural law of technique in m roads
Assume that body section will be through technique 1, technique 2 and technique 3 this three process, now by segmentationWithMove into into
Row technique 3 and technique 2,My god,My god.Calculation process according to the present invention is proceeded as follows：
（1）It is ranked up according to the technique of segmentation flow direction and process cycle.Due to segmentationOperation rearward, then preferentially
Execute segmentationSegmentation is executed afterwards
（2）Find out, and the Resistance Value in the place is set as a（a
<1）.As shown in Figure 4
（3）Calculate three-level placeWithTo the path that road resistance is minimum, and enter The minimum path of resistance, minimum drag overall value are marked on Fig. 5.
（4）DetermineThree-level place to be moved into
Due toMy god, sequence 23 in two grades of places of target, if place it in the less three-level place of stacking coefficient
The middle outbound action that can affect other segmentations follow-up, therefore it is in 2 three-level place that should be placed on stacking coefficient.Three-level place
Stack coefficient and be 2, but three-level placeMinimal path value is less, therefore selects place
Minimum drag access path is：According to rule, fork instruction of the priority treatment near road.Raw
Into such as giving an order：
→ temporarily putting
（Plan）
（5）Calculate segmentationAppearance path.
Minimum drag removes path：WhereinOn all there is segmentation,
ThereforeFork instruction for the paths.According to rule, fork instruction of the priority treatment near road.Generate as follows
Instruction：
→ temporarily putting
（6）UpdateThe flat car move inventory of scheduling.
→ temporarily putting
→ temporarily putting
（Plan）
（7）RemoveMobile application, it is only necessary to mobile segmentationField conditions is recalculated, including Resistance Value, minimum
Resistance path etc., the originally larger segmentation of rest period natural lawIt is moved to and stacks the larger three-level place of coefficientMoving
Achieve the optimization to place to check and regulate on the premise of dynamic number of times is less.
（8）DetermineThree-level place to be moved into
Due toMy god, sequence 12 in two grades of places of target should be placed on the three-level place for stacking that coefficient is 1.Examine
Consider drag overall value minimum, can be placed intoMoving into path is：Produce a fork instructionGenerate such as
Give an order：
（Plan）
（9）Calculate segmentationAppearance path.
Minimum drag removes path：Fork instruction is not produced, and generating instruction is：
（Plan）
（10）UpdateMobile flat car move inventory
（Plan）
（11）All mobile applications are disposed.
Claims (1)
1. rule-based shipyard segmentation Logistic Scheduling method, using segmentation placement regulation, is executing body section move
During so that it is minimum that segmented general carries number of times, it is characterised in that in turn includes the following steps：
Step (1) obtains the spatial data of shipyard field division
The operation stockyard in whole shipyard is defined as one-level place, according to the difference of job class, be divided into multiple each other every
From two grades of places, job class includes application and fitting-out, in two grades of places each to accommodate the region that a segmentation puts fixed
Justice is three-level place；
Step (2) obtains three-level place status data
Based on shipbuilding management system, the real-time status data in three-level place is obtained, including fixed attribute：Compile in three-level place
Technique is supported, coefficient is stacked, whether is contained energy source, and dynamic attribute in code, affiliated region, place priority, place：Institute
The segmentation ID of stacking, remaining process cycle natural law of the segmentation in the three-level place is stacked, wherein place priority is divided into A, B, C
Three-level；Space for three-level place is controlled, and needs to be previously set：It is 0 to stack coefficient near the place of road, with road interval
The stacking coefficient in 1 three-level place is 1, the like, ideally, process cycle natural law short (i.e. turnover priority is high)
Segmentation is distributed in place periphery, that is, stack the low three-level place of coefficient；
Step (3) obtains segmentation movement application inventory
There is provided by business department, flow to including mobile application ID, mobile segmentation ID, the three-level place coding of sending area, technique,
Kinetic energy demand, stages process cycle natural law；
Step (4) calculates the move of flat car according to the rule for setting
Step (4.1) is ranked up to segmentation movement application inventory, is sorted according to technique flow direction rearward forward, and technique flows to phase
With then the short sequence of process cycle is forward；
The three-level place of step (4.2) computation-free, including current idle three-level place coding and segmentation movement application inventory
The three-level place for removing is encoded by middle segmentation；
Step (4.3) calculates each three-level place resistance, stacks the rest period natural law of coefficient and segmentation in place according to place
Sequence is calculated；For three-level place, the place for having put segmentation produces Resistance Value, does not produce Resistance Value barnyard；In meter
Preferentially put in the path constituted by irrational segmentation from those when calculating resistance minimal path and pass through, to by derivative
These are put irrational segmentation and are placed into rational position by instruction；Concrete execution step is as follows：With each two grades of places as whole
Body is executed successively, is ranked up according to remaining process cycle natural law of the segmentation in each three-level place, by the sequence of segmentation and place
The sequence for stacking coefficient is compared, and finds out the unmatched segmentation of sequence number, that is, put the three-level improper, these segmentations are located
The Resistance Value in place is set to a (0<a<1), if meaning, the fork instruction for producing will move a segmentation, preferential mobile pendulum
Put inappropriate segmentation；
Step (4.4) is calculated place drag overall and enters the path that appears on the scene, calculate three-level place to the path of road resistance minimum and
Drag overall value, path three-level place coded representation；
Step (4.5) specifies movement to apply for segmentation three-level place to be moved in inventory, and the hard constraint for needing satisfaction is：Energy source
And process attribute, soft-constraint is followed successively by place priority, stacks coefficients match and drag overall；
The instruction reorder that step (4.6) plan is executed, technique flow direction are sorted forward, little forward of Resistance Value rearward；
Step (4.7) flat car transports fork instruction computing, successively in the following order：Place to be moved into is checked and regulated, field to be removed
Check and regulate, Planning Directive；Regulation：Fork instruction does not allow to produce fork instruction again, and the segmentation that fork instruction is produced preferentially is placed
In idle position, original position is put back to if without clear position.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610946529.1A CN106503944A (en) | 2016-10-26 | 2016-10-26 | Rule-based body section Logistic Scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610946529.1A CN106503944A (en) | 2016-10-26 | 2016-10-26 | Rule-based body section Logistic Scheduling method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106503944A true CN106503944A (en) | 2017-03-15 |
Family
ID=58321128
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610946529.1A Pending CN106503944A (en) | 2016-10-26 | 2016-10-26 | Rule-based body section Logistic Scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106503944A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110009268A (en) * | 2018-10-31 | 2019-07-12 | 上海船舶工艺研究所(中国船舶工业集团公司第十一研究所) | One kind being used for body section logistics link analysis method |
-
2016
- 2016-10-26 CN CN201610946529.1A patent/CN106503944A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110009268A (en) * | 2018-10-31 | 2019-07-12 | 上海船舶工艺研究所(中国船舶工业集团公司第十一研究所) | One kind being used for body section logistics link analysis method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zheng et al. | Multi-objective multi-population biased random-key genetic algorithm for the 3-D container loading problem | |
| Gen et al. | Evolutionary techniques for optimization problems in integrated manufacturing system: State-of-the-art-survey | |
| CN112561194B (en) | Integrated scheduling method and system for production and logistics of mixed flow shop | |
| Tavakkoli-Moghaddam et al. | Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS | |
| CN110533228B (en) | Flight recovery method considering passenger willingness | |
| CN104346143A (en) | Data conversion method from EBOM (Engineering Bill of Material) to MBOM (Maintenance Bill of Material) | |
| CN112783172B (en) | AGV and machine integrated scheduling method based on discrete whale optimization algorithm | |
| CN108764579B (en) | Storage multi-robot task scheduling method based on congestion control | |
| CN105629927A (en) | Hybrid genetic algorithm-based MES (Manufacturing Execution System) production planning and scheduling method | |
| Yurtkuran et al. | A novel artificial bee colony algorithm for the workforce scheduling and balancing problem in sub-assembly lines with limited buffers | |
| CN104123587B (en) | Steel production contractor plan and multi-echelon inventory matching optimization method under MTO MTS management modes | |
| CN103729748B (en) | Progress computational methods and its algorithm based on comprehensive network plans are realized | |
| CN101859100A (en) | Improved particle swarm optimization method based on streamline production scheduling of fuzzy due date | |
| CN115730799A (en) | Method, system and equipment for scheduling production tasks of flexible assembly job workshop | |
| CN118195277B (en) | Helicopter group offshore platform operation integrated scheduling method | |
| CN112801484A (en) | Material distribution scheduling method and system considering batching errors | |
| CN105741181A (en) | Hybrid flow shop scheduling method for different parallel machines | |
| Gu | Application research for multiobjective low-carbon flexible job-shop scheduling problem based on hybrid artificial bee colony algorithm | |
| CN110263970B (en) | Hybrid discrete artificial bee colony algorithm for solving automatic rail trolley feeding scheduling problem | |
| Geng et al. | Scatter search based particle swarm optimization algorithm for earliness/tardiness flowshop scheduling with uncertainty | |
| ElMekkawy et al. | A new memetic algorithm for optimizing the partitioning problem of tandem AGV systems | |
| CN106503944A (en) | Rule-based body section Logistic Scheduling method | |
| Qiao et al. | Layered Drum-Buffer-Rope-Based scheduling of reentrant manufacturing systems | |
| Ventura et al. | Optimal location of dwell points in a single loop AGV system with time restrictions on vehicle availability | |
| Duan et al. | EDA based probabilistic Memetic Algorithm for distributed blocking permutation flowshop scheduling with sequence dependent setup time |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170315 |
|
| RJ01 | Rejection of invention patent application after publication |