CN111160723A - Dynamic flexible job shop scheduling method - Google Patents

Dynamic flexible job shop scheduling method Download PDF

Info

Publication number
CN111160723A
CN111160723A CN201911274024.5A CN201911274024A CN111160723A CN 111160723 A CN111160723 A CN 111160723A CN 201911274024 A CN201911274024 A CN 201911274024A CN 111160723 A CN111160723 A CN 111160723A
Authority
CN
China
Prior art keywords
scheduling
module
workpieces
workshop
information
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.)
Withdrawn
Application number
CN201911274024.5A
Other languages
Chinese (zh)
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.)
Qingdao Agricultural University
Beijing Transpacific Technology Development Ltd
Original Assignee
Qingdao Agricultural University
Beijing Transpacific Technology Development 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 Qingdao Agricultural University, Beijing Transpacific Technology Development Ltd filed Critical Qingdao Agricultural University
Priority to CN201911274024.5A priority Critical patent/CN111160723A/en
Publication of CN111160723A publication Critical patent/CN111160723A/en
Withdrawn legal-status Critical Current

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/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/06312Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • 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/067Enterprise or organisation modelling
    • 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
    • Y02P80/00Climate change mitigation technologies for sector-wide applications
    • Y02P80/10Efficient use of energy, e.g. using compressed air or pressurized fluid as energy carrier
    • 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/90Financial instruments for climate change mitigation, e.g. environmental taxes, subsidies or financing

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Educational Administration (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 discloses a dynamic flexible job shop scheduling method, which comprises the following method modules, wherein the method modules comprise an information processing system module, a shop scheduling module, a display terminal module and a scheduling data storage and transmission module, the information processing system module consists of an information receiving system module, an information sending system module and an information processing system module, and the scheduling algorithm and the established model are combined into a whole, so that the scheduling can be carried out through a macroscopic angle during the scheduling, and single and more detailed division can be carried out through the model, so that the scheduling of the shop can be more effective, the production cost of enterprises can be reduced, the utilization rate of energy can be improved, the energy allocation can be optimized, the purposes of saving resources and protecting the environment can be achieved, and the maximization of the economic benefit of the enterprises can be realized, thereby improving the industry competitiveness of enterprises.

Description

Dynamic flexible job shop scheduling method
Technical Field
The invention belongs to the technical field related to workshop scheduling, and particularly relates to a dynamic flexible job workshop scheduling method.
Background
The job shop scheduling plays an important role in optimizing configuration and scientific operation of resources, is a key for enterprises to realize stable and efficient operation of manufacturing systems, and is mainly applied to emergency command centers, duty rooms, emergency centers, mines, emergency vehicles and the like. The touch screen dispatching desk is configured, so that a user can carry out emergency notification and command issuing in the fastest and most effective way, and the state of a notified object can be visually displayed.
The prior art of the job shop scheduling method has the following problems: the existing job shop scheduling method is generally implemented by adopting a scheduling method when scheduling is carried out, so that when scheduling of different work types is carried out, a single method cannot carry out scheduling well under certain specific conditions, and a series of deviation problems occur in scheduling.
Disclosure of Invention
The invention aims to provide a dynamic flexible job shop scheduling method to solve the problem that the existing job shop scheduling method in the background art generally adopts a single method to schedule and cannot be well adapted to different work types.
In order to achieve the purpose, the invention provides the following technical scheme:
a dynamic flexible job workshop scheduling method is composed of following method modules, wherein the method modules comprise an information processing system module, a workshop scheduling module, a display terminal module and a scheduling data storage and transmission module, the information processing system module consists of an information receiving system module, an information sending system module and an information processing system module, the information receiving system module in the information processing system module is used for receiving collected information, the information sending system module in the information processing system module is used for sending the information of workshop data, and the information processing system module in the information processing system module is used for performing different processing functions on information to be used and unnecessary information;
preferably, the workshop scheduling module is composed of a touch screen scheduling table, a scheduling algorithm and a workshop scheduling problem model, the touch screen scheduling table in the workshop scheduling module has the function of manual control scheduling, the scheduling algorithm in the touch screen scheduling table has the function of better scheduling according to different algorithms, and the workshop scheduling problem model in the touch screen scheduling table has the function of more intuitively observing the whole scheduling;
preferably, the display terminal module is composed of a main control computer, a terminal and a display, the main control computer in the display terminal module has the function of computer operation, the terminal in the display terminal module has the function of computer control, and a display screen in the display terminal module has the function of playing to-be-watched;
preferably, the scheduling data saving and transmitting module is composed of a fax system receiving and sending system, a telephone directory system and an intelligent detection signaling system, the fax system receiving and sending system in the scheduling data saving and transmitting module has the fax system receiving and sending function and has the saving function, the telephone directory system in the scheduling data saving and transmitting module has the function of facilitating a dispatcher to quickly inquire telephone numbers and call, and the intelligent detection signaling system in the scheduling data saving and transmitting module has the functions of automatically detecting signaling types and automatically configuring corresponding signaling parameters.
Preferably, the workshop scheduling operation steps are as follows:
the method comprises the following steps: in order to order workpieces according to the Johnson algorithm, it can be described in detail that N workpieces (J { Jl | J1, J2,. till. Jn, l ═ 1,2,. till. N }) are processed on M devices (M ═ { Mk | M1, M2.. till. Mm, k ═ 1,2,. till. M }), each workpiece includes N predetermined processing sequences, and each processing sequence can be processed on a plurality of devices. After the batch is carried out, R-type workpieces are formed, wherein R is { Ri | R1, R2,. Rr, i is 1,2,. R }, the processing time of the jth process of the ith workpiece on the equipment k is Tijk, Tpi represents the finishing time of the last process of the pth batch of the ith workpiece, Ds represents the delivery time of the workpieces s, and Dpi represents the delivery time of the pth batch of the ith workpiece. The scheduling objective is to minimize the maximum completion time and the total delay to obtain a processing queue S1, and the processing sequence of the B-type workpieces in the second processing unit is S1;
step two: firstly, clustering and batching workpieces which are similar in machining process, have the same workpiece size in the same range and are made of the same blank material to reduce the problem solving scale, randomly forming different batches, wherein each workpiece has a respective delivery date, and scheduling according to the earliest delivery date in the batches after batching;
step three: arranging the machine arranged on the first processing unit to process according to FAM rules, wherein the starting time of the next batch of workpieces is more than or equal to the finishing time of the previous batch of workpieces when the same machine is occupied, and the processed workpieces are processed;
step four: then, adjusting the online and offline of the equipment in real time according to the dynamic state, analyzing whether conflicts or potential conflicts occur or not, and scheduling according to a scheduling buffer zone after analysis;
step five: arranging the class B workpieces and the class A workpieces processed in cooperation therewith to be processed on the machine of the second processing unit in the order of S1 according to the LBM rule;
step six: by compiling the scheduling scheme from planning to executing, from executing to checking and from checking to improving, the scheme can be better compiled, and then the scheduling scheme is compiled and the workshop schedule is inquired and compared with each other so as to improve;
step seven: and then checking whether the materials are deficient or not according to the compiled report corresponding to the progress of the workshop, if the materials are deficient, reporting the materials to a main office of the workshop for reporting, if the materials are not deficient, detecting whether damaged equipment occurs or not, if the damaged equipment occurs, maintaining and detecting the equipment through organizational maintenance, if the damaged equipment does not exist, checking whether the productivity is insufficient or not, and if the productivity is not insufficient, scheduling work can be carried out.
Preferably, the operation steps of the telephone directory system are as follows:
the method comprises the following steps: establishing a model, and then inputting a number in the established model;
step two: searching is carried out through the input number, and comparison is carried out through data stored in the model;
step three: then displaying the searched numbers, and distinguishing whether the numbers are single numbers or group numbers, and displaying at this time;
step four: and then dial according to the retrieved number, so that the dispatcher to be dispatched can be better contacted.
Compared with the prior art, the invention provides a dynamic flexible job shop scheduling method, which has the following beneficial effects:
according to the invention, the scheduling algorithm and the established model are combined into a whole, so that scheduling can be carried out through a macroscopic angle during scheduling, and single and more detailed division can be carried out through the model, so that the scheduling of a workshop can be more effective, and further reduction of production cost and energy consumption optimization of an enterprise can be facilitated, namely, the production cost of the enterprise can be reduced, the utilization rate of energy can be improved, the energy allocation can be optimized, the purposes of saving resources and protecting the environment can be achieved, the maximization of the economic benefit of the enterprise can be realized, and the industrial competitiveness of the enterprise can be improved.
Detailed Description
The invention provides a dynamic flexible job shop scheduling method, which comprises the following technical scheme:
a dynamic flexible job workshop scheduling method is composed of following method modules, wherein the method modules comprise an information processing system module, a workshop scheduling module, a display terminal module and a scheduling data storage and transmission module, the information processing system module consists of an information receiving system module, an information sending system module and an information processing system module, the information receiving system module in the information processing system module is used for receiving collected information, the information sending system module in the information processing system module is used for sending the information of workshop data, and the information processing system module in the information processing system module is used for performing different processing functions on the information needed to be used and unnecessary information;
the workshop scheduling module is composed of a touch screen scheduling table, a scheduling algorithm and a workshop scheduling problem model, the touch screen scheduling table in the workshop scheduling module has the function of manual control scheduling, the scheduling algorithm in the touch screen scheduling table has the function of better scheduling according to different algorithms, and the workshop scheduling problem model in the touch screen scheduling table has the function of more intuitively observing the overall scheduling;
the display terminal module consists of a main control computer, a terminal and a display, wherein the main control computer in the display terminal module has the function of computer operation, the terminal in the display terminal module has the function of computer control, and a display screen in the display terminal module has the function of playing to-be-watched;
the dispatching data storage and transmission module is composed of a fax system receiving and sending system, a telephone directory system and an intelligent detection signaling system, wherein the fax system receiving and sending system in the dispatching data storage and transmission module has the fax system receiving and sending function and has the storage function, the telephone directory system in the dispatching data storage and transmission module has the function of facilitating a dispatcher to quickly inquire telephone numbers and call, and the intelligent detection signaling system in the dispatching data storage and transmission module has the functions of automatically detecting signaling types and automatically configuring corresponding signaling parameters.
The workshop scheduling operation steps are as follows:
the method comprises the following steps: in order to order workpieces according to the Johnson algorithm, it can be described in detail that N workpieces (J { Jl | J1, J2,. till. Jn, l ═ 1,2,. till. N }) are processed on M devices (M ═ { Mk | M1, M2.. till. Mm, k ═ 1,2,. till. M }), each workpiece includes N predetermined processing sequences, and each processing sequence can be processed on a plurality of devices. After the batch is carried out, R-type workpieces are formed, wherein R is { Ri | R1, R2,. Rr, i is 1,2,. R }, the processing time of the jth process of the ith workpiece on the equipment k is Tijk, Tpi represents the finishing time of the last process of the pth batch of the ith workpiece, Ds represents the delivery time of the workpieces s, and Dpi represents the delivery time of the pth batch of the ith workpiece. The scheduling objective is to minimize the maximum completion time and the total delay to obtain a processing queue S1, and the processing sequence of the B-type workpieces in the second processing unit is S1;
step two: firstly, clustering and batching workpieces which are similar in machining process, have the same workpiece size in the same range and are made of the same blank material to reduce the problem solving scale, randomly forming different batches, wherein each workpiece has a respective delivery date, and scheduling according to the earliest delivery date in the batches after batching;
step three: arranging the machine arranged on the first processing unit to process according to FAM rules, wherein the starting time of the next batch of workpieces is more than or equal to the finishing time of the previous batch of workpieces when the same machine is occupied, and the processed workpieces are processed;
step four: then, adjusting the online and offline of the equipment in real time according to the dynamic state, analyzing whether conflicts or potential conflicts occur or not, and scheduling according to a scheduling buffer zone after analysis;
step five: arranging the class B workpieces and the class A workpieces processed in cooperation therewith to be processed on the machine of the second processing unit in the order of S1 according to the LBM rule;
step six: by compiling the scheduling scheme from planning to executing, from executing to checking and from checking to improving, the scheme can be better compiled, and then the scheduling scheme is compiled and the workshop schedule is inquired and compared with each other so as to improve;
step seven: and then checking whether the materials are deficient or not according to the compiled report corresponding to the progress of the workshop, if the materials are deficient, reporting the materials to a main office of the workshop for reporting, if the materials are not deficient, detecting whether damaged equipment occurs or not, if the damaged equipment occurs, maintaining and detecting the equipment through organizational maintenance, if the damaged equipment does not exist, checking whether the productivity is insufficient or not, and if the productivity is not insufficient, scheduling work can be carried out.
The operation steps of the telephone directory system are as follows:
the method comprises the following steps: establishing a model, and then inputting a number in the established model;
step two: searching is carried out through the input number, and comparison is carried out through data stored in the model;
step three: then displaying the searched numbers, and distinguishing whether the numbers are single numbers or group numbers, and displaying at this time;
step four: and then dial according to the retrieved number, so that the dispatcher to be dispatched can be better contacted.
The working principle and the using process of the invention are as follows:
firstly establishing a model according to the actual condition of a workshop, then importing detected data into the model, then carrying out calculation according to a scheduling algorithm, and importing the calculated data into the model, so that macroscopic scheduling can be better carried out through the model, then drawing a scheduling scheme according to a compiled report, then adopting the drawn report step by step according to the scheme during production, so that the scheduling can be more reasonable, then adjusting the online and offline of equipment according to dynamic real time, analyzing whether conflicts or potential conflicts occur or not, scheduling according to a scheduling buffer area after analysis, and arranging B-type workpieces and A-type workpieces processed in cooperation with the B-type workpieces on a machine of a second processing unit according to an LBM rule according to the sequence of S1, the scheduling scheme is compiled, the compiling scheduling scheme is from planning to executing, executing to checking and checking to improving, so that the scheme can be compiled better, then the compiling scheduling scheme is compared with the progress of the inquired workshop to improve, then whether the workshop is short of materials is checked according to the compiled report corresponding to the progress of the workshop, if the workshop is short of materials, the main office and the main office of the workshop are reported to report, if the workshop is not short of materials, whether damaged equipment exists is detected, if the damaged equipment exists, the equipment is maintained and detected through organization and maintenance, if the damaged equipment does not exist, whether the productivity is insufficient is checked, and if the productivity is insufficient, the scheduling work can be carried out.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims (3)

1. A dynamic flexible job shop scheduling method is composed of the following method modules, wherein the method modules comprise an information processing system module, a shop scheduling module, a display terminal module and a scheduling data storage and transmission module, and is characterized in that: the information processing system module consists of an information receiving system module, an information sending system module and an information processing system module, wherein the information receiving system module in the information processing system module is used for receiving the collected information, the information sending system module in the information processing system module is used for sending the information of the workshop data, and the information processing system module in the information processing system module is used for performing different processing functions on the information required to be used and the unnecessary information;
the workshop scheduling module is composed of a touch screen scheduling table, a scheduling algorithm and a workshop scheduling problem model, the touch screen scheduling table in the workshop scheduling module has the function of manual control scheduling, the scheduling algorithm in the touch screen scheduling table has the function of better scheduling according to different algorithms, and the workshop scheduling problem model in the touch screen scheduling table has the function of more intuitively observing the whole scheduling;
the display terminal module consists of a main control computer, a terminal and a display, wherein the main control computer in the display terminal module has the function of computer operation, the terminal in the display terminal module has the function of computer control, and a display screen in the display terminal module has the function of playing to-be-watched;
the dispatching data storage and transmission module is composed of a fax system sending and receiving system, a telephone directory system and an intelligent detection signaling system, wherein the fax system sending and receiving system in the dispatching data storage and transmission module has the functions of fax machine sending and receiving and storage, the telephone directory system in the dispatching data storage and transmission module has the function of facilitating a dispatcher to quickly inquire telephone numbers and call, and the intelligent detection signaling system in the dispatching data storage and transmission module has the functions of automatically detecting signaling types and automatically configuring corresponding signaling parameters.
2. The dynamic flexible job shop scheduling method according to claim 1, wherein: the workshop scheduling operation steps are as follows:
the method comprises the following steps: in order to order workpieces according to the Johnson algorithm, it can be described in detail that N workpieces (J { Jl | J1, J2,. till. Jn, l ═ 1,2,. till. N }) are processed on M devices (M ═ { Mk | M1, M2.. till. Mm, k ═ 1,2,. till. M }), each workpiece includes N predetermined processing sequences, and each processing sequence can be processed on a plurality of devices. After the batch is carried out, R-type workpieces are formed, wherein R is { Ri | R1, R2,. Rr, i is 1,2,. R }, the processing time of the jth process of the ith workpiece on the equipment k is Tijk, Tpi represents the finishing time of the last process of the pth batch of the ith workpiece, Ds represents the delivery time of the workpieces s, and Dpi represents the delivery time of the pth batch of the ith workpiece. The scheduling objective is to minimize the maximum completion time and the total delay to obtain a processing queue S1, and the processing sequence of the B-type workpieces in the second processing unit is S1;
step two: firstly, clustering and batching workpieces which are similar in machining process, have the same workpiece size in the same range and are made of the same blank material to reduce the problem solving scale, randomly forming different batches, wherein each workpiece has a respective delivery date, and scheduling according to the earliest delivery date in the batches after batching;
step three: arranging the machine arranged on the first processing unit to process according to FAM rules, wherein the starting time of the next batch of workpieces is more than or equal to the finishing time of the previous batch of workpieces when the same machine is occupied, and the processed workpieces are processed;
step four: then, adjusting the online and offline of the equipment in real time according to the dynamic state, analyzing whether conflicts or potential conflicts occur or not, and scheduling according to a scheduling buffer zone after analysis;
step five: arranging the class B workpieces and the class A workpieces processed in cooperation therewith to be processed on the machine of the second processing unit in the order of S1 according to the LBM rule;
step six: by compiling the scheduling scheme from planning to executing, from executing to checking and from checking to improving, the scheme can be better compiled, and then the scheduling scheme is compiled and the workshop schedule is inquired and compared with each other so as to improve;
step seven: and then checking whether the materials are deficient or not according to the compiled report corresponding to the progress of the workshop, if the materials are deficient, reporting the materials to a main office of the workshop for reporting, if the materials are not deficient, detecting whether damaged equipment occurs or not, if the damaged equipment occurs, maintaining and detecting the equipment through organizational maintenance, if the damaged equipment does not exist, checking whether the productivity is insufficient or not, and if the productivity is not insufficient, scheduling work can be carried out.
3. The dynamic flexible job shop scheduling method according to claim 1, wherein: the operation steps of the telephone directory system are as follows:
the method comprises the following steps: establishing a model, and then inputting a number in the established model;
step two: searching is carried out through the input number, and comparison is carried out through data stored in the model;
step three: then displaying the searched numbers, and distinguishing whether the numbers are single numbers or group numbers, and displaying at this time;
step four: and then dial according to the retrieved number, so that the dispatcher to be dispatched can be better contacted.
CN201911274024.5A 2019-12-12 2019-12-12 Dynamic flexible job shop scheduling method Withdrawn CN111160723A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911274024.5A CN111160723A (en) 2019-12-12 2019-12-12 Dynamic flexible job shop scheduling method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911274024.5A CN111160723A (en) 2019-12-12 2019-12-12 Dynamic flexible job shop scheduling method

Publications (1)

Publication Number Publication Date
CN111160723A true CN111160723A (en) 2020-05-15

Family

ID=70556783

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911274024.5A Withdrawn CN111160723A (en) 2019-12-12 2019-12-12 Dynamic flexible job shop scheduling method

Country Status (1)

Country Link
CN (1) CN111160723A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101364107A (en) * 2008-09-24 2009-02-11 永凯软件技术(上海)有限公司 Dynamic dispatching method with prediction in complex large system environment
CN104392124A (en) * 2014-11-18 2015-03-04 广东工业大学 Three-stage flexible flow workshop scheduling method based on ST heuristic algorithm
CN107862411A (en) * 2017-11-09 2018-03-30 西南交通大学 A kind of extensive flexible job shop scheduling optimization method
CN108009739A (en) * 2017-12-14 2018-05-08 沈阳工业大学 Production-Plan and scheduling integral method between a kind of intelligent machine extra bus
CN108197787A (en) * 2017-12-22 2018-06-22 上海海得控制系统股份有限公司 The coordination scheduling system of flexible automation production line and automatic material flow pipeline
CN108235260A (en) * 2016-12-12 2018-06-29 北京信威通信技术股份有限公司 A kind of system and method for dialing cluster sets of numbers
CN109164766A (en) * 2018-08-22 2019-01-08 上海交通大学 The production control system in multiplexing kind workshop

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101364107A (en) * 2008-09-24 2009-02-11 永凯软件技术(上海)有限公司 Dynamic dispatching method with prediction in complex large system environment
CN104392124A (en) * 2014-11-18 2015-03-04 广东工业大学 Three-stage flexible flow workshop scheduling method based on ST heuristic algorithm
CN108235260A (en) * 2016-12-12 2018-06-29 北京信威通信技术股份有限公司 A kind of system and method for dialing cluster sets of numbers
CN107862411A (en) * 2017-11-09 2018-03-30 西南交通大学 A kind of extensive flexible job shop scheduling optimization method
CN108009739A (en) * 2017-12-14 2018-05-08 沈阳工业大学 Production-Plan and scheduling integral method between a kind of intelligent machine extra bus
CN108197787A (en) * 2017-12-22 2018-06-22 上海海得控制系统股份有限公司 The coordination scheduling system of flexible automation production line and automatic material flow pipeline
CN109164766A (en) * 2018-08-22 2019-01-08 上海交通大学 The production control system in multiplexing kind workshop

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
尹慢: "基于工件与工序分解的大规模柔性作业车间调度方法研究" *

Similar Documents

Publication Publication Date Title
Okamura et al. Analysis of the effect of buffer storage capacity in transfer line systems
CN112001619B (en) Production scheduling method and device, computer storage medium and electronic equipment
CN110955206A (en) Order scheduling and distribution scheduling method and system
CN109615165B (en) Flexible processing scheduling method based on ERP and MES data interaction technology
CN111260181B (en) Workshop self-adaptive production scheduling device based on distributed intelligent manufacturing unit
CN112446526A (en) Production scheduling system and method
CN111538295A (en) Flexible production management system
Makssoud et al. An exact optimization approach for a transfer line reconfiguration problem
US8452438B2 (en) Method for minimizing productivity loss while using a manufacturing scheduler
CN111665811A (en) Flexible job shop rescheduling energy-saving optimization method under dynamic event
CN108445853B (en) Productivity sharing workshop based on cloud data
CN114310423B (en) Processing unit multi-tool magazine linkage configuration method
WO2005060646B1 (en) Flexible distributed manufacturing method and system therefor
CN115358578A (en) Green scheduling method, system and device for mixed flow production of segmented welding wires
CN114037251A (en) Manufacturing system cost minimization resource allocation method based on Petri network
CN111160723A (en) Dynamic flexible job shop scheduling method
CN107577211B (en) Internet of things technology-based pulling control system and method for material in process
CN117520785A (en) Industrial intelligent decision support system and method based on big data analysis
Kabiesz et al. 5S system as a manner for improving working conditions and safety of work in a production company
Krishnan et al. Performance study of flexible manufacturing system scheduling using dispatching rules in dynamic environment
CN107544451B (en) Centralized dispatching system and method for numerical control machine tool in machining workshop
CN115438952A (en) Production scheduling method and related equipment thereof
CN113359638A (en) Production process of metal plate flexible manufacturing system
CN107544452B (en) Promptly add processing workshop numerically-controlled machine tool centralized dispatching method under one-state
Kaltwasser et al. Hierarchical control of flexible manufacturing systems

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
WW01 Invention patent application withdrawn after publication

Application publication date: 20200515

WW01 Invention patent application withdrawn after publication