WO2020164293A1 - Method and system for intelligently generating production scheduling of enterprise - Google Patents

Method and system for intelligently generating production scheduling of enterprise Download PDF

Info

Publication number
WO2020164293A1
WO2020164293A1 PCT/CN2019/120979 CN2019120979W WO2020164293A1 WO 2020164293 A1 WO2020164293 A1 WO 2020164293A1 CN 2019120979 W CN2019120979 W CN 2019120979W WO 2020164293 A1 WO2020164293 A1 WO 2020164293A1
Authority
WO
WIPO (PCT)
Prior art keywords
scheduling
production
production scheduling
machine
routes
Prior art date
Application number
PCT/CN2019/120979
Other languages
French (fr)
Chinese (zh)
Inventor
刘煜
孙再连
梅瑜
Original Assignee
厦门邑通软件科技有限公司
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 厦门邑通软件科技有限公司 filed Critical 厦门邑通软件科技有限公司
Publication of WO2020164293A1 publication Critical patent/WO2020164293A1/en

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
    • 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
    • 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

Definitions

  • the present invention relates to the technical field of production management, in particular to a production scheduling method and system for smart generation enterprises.
  • the current production scheduling plan of various industries is basically the APS system for monthly production scheduling.
  • the present invention provides a smart generation enterprise production scheduling method and system, wherein the method and the scheduling system adopt artificial intelligence thinking and technology in a man-machine game mode, which can affect people who affect production scheduling. Analyze the five major links of machine, material, and law, and automatically generate new production schedules according to changes in scheduling factors.
  • the new production schedule takes the production scheduling evaluation index as the goal, meets the production demand as the premise, takes the change of production scheduling factor as the constraint condition of the game, and adopts the thinking of man-machine game to solve the problem of enterprise production scheduling, reducing complexity to simplicity .
  • the production machine is regarded as a finite state machine or chess piece
  • the M types of products that the production machine can produce are regarded as the M states or M states of the finite state machine or chess piece.
  • the scheduling system can list all feasible routes in advance according to the changes in scheduling factors and the way the production machine moves.
  • the scheduling system learns the production product type, production capacity, and product switching route of each production machine, and transforms it into alternative directions and continuous walking routes for each finite state machine or chess piece .
  • the constraint conditions include changes to the original production plan, raw material reserves, delivery deadlines, equipment conditions, etc.; the constraint conditions restrict the production machine's selection of products to be produced; that is, under the premise of meeting production requirements
  • the production schedule of the previous day is regarded as the current board layout, and the constraint conditions are regarded as the opponents of the scheduling system.
  • the scheduling system exhaustively plans all routes within N days, and eliminates impossible routes with constraints , Restrict the next walking route of the finite state machine or the chess piece; the next walking route is different, corresponding to a different new production schedule.
  • the scheduling system learns historical scheduling and real-time scheduling, that is, learning historical routes and real-time moves of the finite state machine or chess pieces; the scheduling system exhaustively plans all historical routes within N days, Select the historical route with the best production scheduling evaluation index in the history; when the demand and the constraint conditions are not met in the historical route, the route will be given according to the default scheduling plan, which is selected randomly A commonly used move.
  • the production scheduling evaluation index is a rule for evaluating the pros and cons of the new production scheduling, and the production scheduling evaluation index is obtained by a weighted comprehensive scoring of indicators concerned by the user.
  • the indicators include a rebrand score, a pre-inventory score, and a pre-delivery period score.
  • the scheduling evaluation index w1* rebrand score+w2*pre-stock score+w3 pre-delivery period score, where w1, w2 and w3 are the weights of each index.
  • the rebrand score determine whether each production machine has the same brand on the same day as the previous day. If not, record 1; otherwise, record 0. Summarize the number of rebrands of all machines in the planned N days. The total number of cards changed in the new production schedule is arranged in descending order, and the Kth place is scored with K points;
  • Pre-inventory score Calculate the output of each brand after the pre-planned production, deduct the pre-allocation amount of the corresponding brand, and judge whether the difference is within the upper and lower limits of the respective inventory. If the difference is within the upper and lower limits of the respective inventory, mark 1 for the brand, otherwise mark 0, and finally summarize each The pre-stock total fulfillment number of the brand is arranged in ascending order, and the K-th place is scored K.
  • Pre-delivery period score within N days of the plan, first judge whether the delivery period of each brand is within the N-day plan. If a label is calculated for the brand with the delivery period during this period, add 1 if each brand can be delivered in advance. If the delivery can be completed on time, add 0 to accumulate the counts and arrange them in ascending order, and score K for the Kth place.
  • a smart generation enterprise production scheduling system is based on the above-mentioned smart generation enterprise production scheduling method.
  • the present invention proposes a smart generation enterprise production scheduling method and system, which is the first to use human-machine game thinking and technology to solve the problem of enterprise production scheduling.
  • the complexity is simplified, and the unpredictable changes in scheduling factors, such as inserting orders, plan changes, and insufficient raw materials arrival, are all regarded as constraints of the game, that is, as a human-machine game.
  • the opponent’s move, the complex change factor is turned into the opponent’s routine action, the scheduling system will make the next response according to the opponent’s action, give a new production schedule, and at the same time, give a new production schedule,
  • the scheduling recommendations are derived from historical knowledge, satisfy the constraints, and have the best comprehensive indicators.
  • the scheduling recommendations given by it are safe, reasonable, optimal and flexible.
  • Embodiment 1 A smart generation enterprise production scheduling method.
  • the scheduling system adopts artificial intelligence thinking and technology in a human-computer game mode to affect the five major links of human, machine, material, and law that affect scheduling Perform analysis and automatically generate new production schedules based on changes in scheduling factors.
  • the new production schedule takes the production scheduling evaluation index as the goal, meets the production demand as the premise, takes the change of production scheduling factor as the constraint condition of the game, and adopts the thinking of man-machine game to solve the problem of enterprise production scheduling, reducing complexity to simplicity .
  • the production machine is regarded as a finite state machine or chess piece
  • the M types of products that the production machine can produce are regarded as M states or M types of the finite state machine or chess piece.
  • the scheduling system can list all feasible routes in advance according to changes in scheduling factors and the way of production machines.
  • the scheduling system also needs to learn the production capacity of each production machine, product switching routes, and other factors that affect the direction and selection of the finite state machine or chess pieces.
  • the specific use process according to the product Type and plan quantity, get schedule schedule.
  • the constraint conditions include changes to the original production plan, raw material reserves, delivery deadlines, equipment conditions, product types, pre-allocated amounts, and the number of boxes that can be produced.
  • the constraint condition restricts the selection of the production machine by the production machine; that is, under the premise of meeting the production demand, the production schedule of the previous day is regarded as the current board layout, and the constraint condition is regarded as the schedule
  • the scheduling system exhausts all the routes planned in N days, excludes impossible routes with constraint conditions, restricts the finite state machine or the next walking route of the chess pieces, and gives new production scheduling suggestions.
  • the following different walking routes correspond to different new production schedules.
  • Embodiment 2 In order to obtain scheduling suggestions with safety, rationality, optimality, and flexibility, this embodiment is based on Embodiment 1, and the scheduling system learns historical scheduling and real-time scheduling , That is, learn the historical routes and real-time moves of the finite state machine or chess pieces; the scheduling system exhaustively planned all the historical routes within N days, and selects the historical route with the best scheduling evaluation index in the history; when the When the requirements and the constraint conditions are not met in the historical route, the walking method is given according to the default scheduling plan, and the default scheduling plan is to randomly select a common walking method.
  • Embodiment 3 In the first and second embodiments, the scheduling system may provide a variety of scheduling plans for the company to choose from, and the company will choose the best scheduling plan with the highest scheduling evaluation index.
  • a specific calculation method of scheduling evaluation index is given:
  • the scheduling evaluation index is a rule for evaluating the pros and cons of a new production scheduling, and the scheduling evaluation index is obtained by a weighted comprehensive scoring of indicators concerned by the user.
  • the indicators include rebrand score, pre-inventory score, and pre-delivery period score.
  • the scheduling evaluation index w1* re-brand score+w2*pre-inventory score+w3 pre-delivery period score, where w1, w2, and w3 are The weight of each indicator. In other embodiments, or in different enterprises, the corresponding indicators and indicator weights may be different.
  • the re-brand score judge whether each production machine has the same brand on the day and the previous day. If not, record 1, otherwise, record 0. Summarize the number of license changes of all machines within N days of the plan. The total number of card changes in the production schedule is arranged in descending order, and the Kth place is scored with K points;
  • Pre-inventory score Calculate the output of each brand after the pre-planned production, deduct the pre-allocation amount of the corresponding brand, and judge whether the difference is within the upper and lower limits of the respective inventory. If the difference is within the upper and lower limits of the respective inventory, mark 1 for the brand, otherwise mark 0, and finally summarize each The pre-stock total fulfillment number of the brand is arranged in ascending order, and the K-th place is scored K.
  • Pre-delivery period score within N days of the plan, first judge whether the delivery period of each brand is within the N-day plan. If a label is calculated for the brand with the delivery period during this period, add 1 if each brand can be delivered in advance. If the delivery can be completed on time, add 0 to accumulate the counts and arrange them in ascending order, and score K for the Kth place.
  • the fourth embodiment corresponds to a smart generation enterprise production scheduling system, which is based on the smart generation enterprise production scheduling method of the foregoing embodiment.
  • the scheduling system needs to obtain basic information and production scheduling preparations of the enterprise, and prepare the scheduling space and learn the remaining plan set before scheduling.
  • the scheduling system also needs to learn historical scheduling, and update the scheduling knowledge base according to actual schedules that occur every day.
  • the basic information specifically includes the following:
  • Machine capacity table machine name, machine hourly quota, actual daily production time, production mode
  • Product type category, brand number sequence; (product type is the common basic attribute of a type of product with the same production mode. For example: Red wolf and gray wolf are both in the same type of production mode, so they are classified as category 1)
  • Product name category table brand, production mode (each production mode corresponds to Y brand)
  • Inventory upper and lower limit table grade, inventory upper limit, inventory lower limit
  • Constraint configuration table product type, delivery period, pre-allocation, number of boxes that can be produced, estimated material availability date, estimated material production volume
  • the production scheduling preparation specifically includes the following:
  • Production plan Summarize the production plan and production schedule every day, and calculate the remaining production plan.
  • the pre-stock quantity cannot be greater than the upper limit of the stock
  • the production base of a machine is the number of boxes that a machine can produce in one day.
  • S221 Find historical schedules of the same product type that are less than or equal to the maximum cardinality of the remaining plans, and when the constraint conditions are also suitable for the current situation, schedule the details of the historical schedules into the schedule temporary storage area. If there is no historical schedule that meets the conditions, the default scheduling plan is used, and the default scheduling plan meets the constraint conditions and the remaining plan set, regardless of whether it is the rightmost;
  • the present invention proposes a smart generation enterprise production scheduling method and system, which is the first to use human-machine game thinking and technology to solve the problem of enterprise production scheduling.
  • the complexity is simplified, and the unpredictable changes in scheduling factors, such as inserting orders, plan changes, and insufficient raw materials arrival, are all regarded as constraints of the game, that is, as a human-machine game.
  • the opponent’s move, the complex change factor is turned into the opponent’s routine action, the scheduling system will make the next response according to the opponent’s action, give a new production schedule, and at the same time, give a new production schedule,
  • the scheduling recommendations are derived from historical knowledge, satisfy the constraints, and have the best comprehensive indicators.
  • the scheduling recommendations given by it are safe, reasonable, optimal and flexible.

Landscapes

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

Abstract

A method and system for intelligently generating a production scheduling for an enterprise, wherein the described scheduling method and system, by means of a human-machine chess game, automatically generate a new production scheduling according to changes to production scheduling factors. The described new production scheduling uses a production scheduling assessment indicator as a target, uses meeting production requirements as a precondition, uses changes to production scheduling factors as a constraint condition for playing chess, and solves the problem of production scheduling for an enterprise by using the thinking of a human-machine chess game so as to change the complex into the simple; the described new production scheduling considers unpredictable changes to production scheduling factors to be constraint conditions for playing chess, i.e., considers same to be the moves of an opponent during a human-machine chess game, thereby changing complex change factors into routine actions of an opponent; and the scheduling system performs a next step reaction according to the action of an opponent to provide a new production scheduling; meanwhile, a production scheduling suggestion of the new production scheduling is a historical scheduling that originates from historical knowledge, that meets a constraint condition, and that has an optimal comprehensive indicator, and the scheduling suggestion provided thereby is secure, reasonable, optimal and reversible.

Description

                           一种智慧生成企业生产排程方法及系统A smart generation enterprise production scheduling method and system 技术领域Technical field
本发明涉及生产管理技术领域,尤其涉及一种智慧生成企业生产排程方法及系统。The present invention relates to the technical field of production management, in particular to a production scheduling method and system for smart generation enterprises.
背景技术Background technique
目前各工业行业的排产计划基本是APS系统进行月排产。The current production scheduling plan of various industries is basically the APS system for monthly production scheduling.
技术问题technical problem
但是仍经常需要工程师根据经验对生产设备的生产计划进行调整,尤其是经常出现的临时插单、计划变更、辅料到货不及时、原料不足等排产要素变更,都需要经验丰富的、专门负责的老师傅做复杂的干预,如果老师傅不在,则其他人难以处理。上述传统的生产管理方式,效率低,人工成本高,且稳定性差,无法满足市场需求。However, it is still often necessary for engineers to adjust the production plan of production equipment based on experience, especially the frequent changes in scheduling factors such as temporary insertion, plan changes, untimely arrival of auxiliary materials, insufficient raw materials, etc., all require experienced and dedicated responsibility If the master is not present, it will be difficult for others to deal with it. The above-mentioned traditional production management methods have low efficiency, high labor costs, and poor stability, which cannot meet market demands.
技术解决方案Technical solutions
 本发明为解决上述技术问题,提供了一种智慧生成企业生产排程方法及系统,其中,所述方法,排程系统以人机对弈方式采用人工智能思维和技术,对影响排产的人,机,料,法环五大环节做分析,自动根据排产因素变化,生成新的生产排程。In order to solve the above technical problems, the present invention provides a smart generation enterprise production scheduling method and system, wherein the method and the scheduling system adopt artificial intelligence thinking and technology in a man-machine game mode, which can affect people who affect production scheduling. Analyze the five major links of machine, material, and law, and automatically generate new production schedules according to changes in scheduling factors.
所述新的生产排程以排产评价指标为目标,以满足生产需求为前提,以排产因素变化为对弈的约束条件,采用人机对弈的思维解决企业生产排程问题,化繁为简。The new production schedule takes the production scheduling evaluation index as the goal, meets the production demand as the premise, takes the change of production scheduling factor as the constraint condition of the game, and adopts the thinking of man-machine game to solve the problem of enterprise production scheduling, reducing complexity to simplicity .
可选的,在所述人机对弈方式中,将生产机台当成有限状态机或棋子,所述生产机台能够生产的M种产品,当成所述有限状态机或棋子的M种状态或M种走法,排程系统能够根据排产因素变化和生产机台的走法,提前列举出所有的可行路线。Optionally, in the human-machine game mode, the production machine is regarded as a finite state machine or chess piece, and the M types of products that the production machine can produce are regarded as the M states or M states of the finite state machine or chess piece. In this way, the scheduling system can list all feasible routes in advance according to the changes in scheduling factors and the way the production machine moves.
可选的,所述排程系统学习每台所述生产机台的生产产品类型、生产能力、产品切换路线,转化成每个所述有限状态机或棋子的供选择的走向和连续的行走路线。Optionally, the scheduling system learns the production product type, production capacity, and product switching route of each production machine, and transforms it into alternative directions and continuous walking routes for each finite state machine or chess piece .
可选的,所述约束条件包括原生产计划变更、原料储量、交付期限、设备状况等;所述约束条件约束所述生产机台对生产产品的选择;即,在满足生产需求为前提的情况下,将前一天的生产排程当成当前棋盘布局,将所述约束条件当成所述排程系统的对弈对手,所述排程系统穷举计划的N天内所有路线,以约束条件排除不可能路线,限制所述有限状态机或棋子接下去的行走路线;所述接下去的行走路线不同,对应不同的新的生产排程。Optionally, the constraint conditions include changes to the original production plan, raw material reserves, delivery deadlines, equipment conditions, etc.; the constraint conditions restrict the production machine's selection of products to be produced; that is, under the premise of meeting production requirements Next, the production schedule of the previous day is regarded as the current board layout, and the constraint conditions are regarded as the opponents of the scheduling system. The scheduling system exhaustively plans all routes within N days, and eliminates impossible routes with constraints , Restrict the next walking route of the finite state machine or the chess piece; the next walking route is different, corresponding to a different new production schedule.
可选的,所述排程系统学习历史排程和实时排程,即学习所述有限状态机或棋子的历史路线和实时走法;所述排程系统穷举计划的N天内所有历史路线,选择历史中,排产评价指标最好的历史路线;当所述历史路线中没有满足需求和所述约束条件时,按缺省排产方案给出走法,所述缺省排产方案为随机选取一个常用的走法。Optionally, the scheduling system learns historical scheduling and real-time scheduling, that is, learning historical routes and real-time moves of the finite state machine or chess pieces; the scheduling system exhaustively plans all historical routes within N days, Select the historical route with the best production scheduling evaluation index in the history; when the demand and the constraint conditions are not met in the historical route, the route will be given according to the default scheduling plan, which is selected randomly A commonly used move.
可选的,所述排产评价指标是评价新的生产排程优劣的规则,所述排产评价指标由用户关注的指标加权综合打分得到。Optionally, the production scheduling evaluation index is a rule for evaluating the pros and cons of the new production scheduling, and the production scheduling evaluation index is obtained by a weighted comprehensive scoring of indicators concerned by the user.
可选的,所述指标包括换牌得分、预库存得分、预交付期得分,所述排产评价指标=w1* 换牌得分+w2*预库存得分+w3预交付期得分,其中,w1、w2、w3为各个指标的权重。Optionally, the indicators include a rebrand score, a pre-inventory score, and a pre-delivery period score. The scheduling evaluation index=w1* rebrand score+w2*pre-stock score+w3 pre-delivery period score, where w1, w2 and w3 are the weights of each index.
可选的,所述换牌得分:判断各生产机台当天与前一天的牌号是否同一牌号,不是则记 1,否则记0,汇总计划的N天内所有机台的换牌数,对不同的新的生产排程的换牌总数按降序排列,排第K名则打K分;Optionally, the rebrand score: determine whether each production machine has the same brand on the same day as the previous day. If not, record 1; otherwise, record 0. Summarize the number of rebrands of all machines in the planned N days. The total number of cards changed in the new production schedule is arranged in descending order, and the Kth place is scored with K points;
预库存得分:计算预计划安排生产后各牌号的产量,扣除对应牌号的预调拨量,判断该差值是否在各自库存上下限范围内,是则该牌号记1,否则记0,最后汇总各牌号的预库存总满足数,对其按升序排列,排第K名则打K分。Pre-inventory score: Calculate the output of each brand after the pre-planned production, deduct the pre-allocation amount of the corresponding brand, and judge whether the difference is within the upper and lower limits of the respective inventory. If the difference is within the upper and lower limits of the respective inventory, mark 1 for the brand, otherwise mark 0, and finally summarize each The pre-stock total fulfillment number of the brand is arranged in ascending order, and the K-th place is scored K.
预交付期得分:在计划N天内,先判断各牌号交付期是否在这N天计划内,若对交付期在这期间的牌号进行一个标数计算,若各牌号可提前完成交付则加1 ,可按时完成交付则加0,对记数进行累加,按升序排列,排第K名则打K分。Pre-delivery period score: within N days of the plan, first judge whether the delivery period of each brand is within the N-day plan. If a label is calculated for the brand with the delivery period during this period, add 1 if each brand can be delivered in advance. If the delivery can be completed on time, add 0 to accumulate the counts and arrange them in ascending order, and score K for the Kth place.
对应的,一种智慧生成企业生产排程系统,所述排程系统基于上述的一种智慧生成企业生产排程方法。Correspondingly, a smart generation enterprise production scheduling system is based on the above-mentioned smart generation enterprise production scheduling method.
有益效果Beneficial effect
由上述对本发明的描述可知,和现有技术相比,本发明提出的一种智慧生成企业生产排程方法及系统,首创用人机对弈的思维和技术解决企业生产排程的问题。排程过程中,化繁为简,将不可测的排产因素变化,如插单、计划变更,原料到货不及等情况,都看做是对弈的约束条件,即看做是人机对弈中,对手的走法,化复杂的变化因素为对手例行的动作,排程系统根据对手的动作做出下一步反应,给出新的生产排程,同时,给出的新的生产排程,其排程建议是源自于历史知识中,满足约束条件,且综合性指标最优的历史排程,其给出的排程建议,具有安全性、合理性、最优性和可朔性。From the above description of the present invention, it can be seen that compared with the prior art, the present invention proposes a smart generation enterprise production scheduling method and system, which is the first to use human-machine game thinking and technology to solve the problem of enterprise production scheduling. In the scheduling process, the complexity is simplified, and the unpredictable changes in scheduling factors, such as inserting orders, plan changes, and insufficient raw materials arrival, are all regarded as constraints of the game, that is, as a human-machine game. , The opponent’s move, the complex change factor is turned into the opponent’s routine action, the scheduling system will make the next response according to the opponent’s action, give a new production schedule, and at the same time, give a new production schedule, The scheduling recommendations are derived from historical knowledge, satisfy the constraints, and have the best comprehensive indicators. The scheduling recommendations given by it are safe, reasonable, optimal and flexible.
 To
本发明的实施方式Embodiments of the invention
为了使本发明所要解决的技术问题、技术方案及有益效果更加清楚、明白,以下结合实施例,对本发明进行进一步详细说明。应当理解,此处所描述的具体实施例仅用于解释本发明,并不用于限定本发明。In order to make the technical problems, technical solutions and beneficial effects to be solved by the present invention clearer and clearer, the present invention will be further described in detail below in conjunction with embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, but not to limit the present invention.
实施例一:一种智慧生成企业生产排程方法,在所述方法中,排程系统以人机对弈方式采用人工智能思维和技术,对影响排产的人,机,料,法环五大环节做分析,自动根据排产因素变化,生成新的生产排程。所述新的生产排程以排产评价指标为目标,以满足生产需求为前提,以排产因素变化为对弈的约束条件,采用人机对弈的思维解决企业生产排程问题,化繁为简。Embodiment 1: A smart generation enterprise production scheduling method. In the method, the scheduling system adopts artificial intelligence thinking and technology in a human-computer game mode to affect the five major links of human, machine, material, and law that affect scheduling Perform analysis and automatically generate new production schedules based on changes in scheduling factors. The new production schedule takes the production scheduling evaluation index as the goal, meets the production demand as the premise, takes the change of production scheduling factor as the constraint condition of the game, and adopts the thinking of man-machine game to solve the problem of enterprise production scheduling, reducing complexity to simplicity .
具体的,在所述人机对弈方式中,将生产机台当成有限状态机或棋子,所述生产机台能够生产的M种产品,当成所述有限状态机或棋子的M种状态或M种走法,排程系统能够根据排产因素变化和生产机台的走法,提前列举出所有的可行路线。Specifically, in the human-machine game mode, the production machine is regarded as a finite state machine or chess piece, and the M types of products that the production machine can produce are regarded as M states or M types of the finite state machine or chess piece. How to go, the scheduling system can list all feasible routes in advance according to changes in scheduling factors and the way of production machines.
当然,所述排程系统还需学习每台所述生产机台的生产能力、产品切换路线等对所述有限状态机或棋子的走向和选择具有影响的因素,在具体使用过程中,根据产品类型和计划数量,获得排程明细表。Of course, the scheduling system also needs to learn the production capacity of each production machine, product switching routes, and other factors that affect the direction and selection of the finite state machine or chess pieces. In the specific use process, according to the product Type and plan quantity, get schedule schedule.
本实施例中,所述约束条件包括原生产计划变更、原料储量、交付期限、设备状况、产品类型、预调拨量、可生产箱数等。所述约束条件约束所述生产机台对生产产品的选择;即,在满足生产需求为前提的情况下,将前一天的生产排程当成当前棋盘布局,将所述约束条件当成所述排程系统的对弈对手,所述排程系统穷举计划的N天内所有路线,以约束条件排除不可能路线,限制所述有限状态机或棋子接下去的行走路线,给出新的生产排程建议。所述接下去的行走路线不同,对应不同的新的生产排程。In this embodiment, the constraint conditions include changes to the original production plan, raw material reserves, delivery deadlines, equipment conditions, product types, pre-allocated amounts, and the number of boxes that can be produced. The constraint condition restricts the selection of the production machine by the production machine; that is, under the premise of meeting the production demand, the production schedule of the previous day is regarded as the current board layout, and the constraint condition is regarded as the schedule For the opponent of the system, the scheduling system exhausts all the routes planned in N days, excludes impossible routes with constraint conditions, restricts the finite state machine or the next walking route of the chess pieces, and gives new production scheduling suggestions. The following different walking routes correspond to different new production schedules.
实施例二:为了能够得到具有安全性、合理性、最优性和可朔性的排程建议,本实施例在实施例一的基础上,所述排程系统学习历史排程和实时排程,即学习所述有限状态机或棋子的历史路线和实时走法;所述排程系统穷举计划的N天内所有历史路线,选择历史中,排产评价指标最好的历史路线;当所述历史路线中没有满足需求和所述约束条件时,按缺省排产方案给出走法,所述缺省排产方案为随机选取一个常用的走法。Embodiment 2: In order to obtain scheduling suggestions with safety, rationality, optimality, and flexibility, this embodiment is based on Embodiment 1, and the scheduling system learns historical scheduling and real-time scheduling , That is, learn the historical routes and real-time moves of the finite state machine or chess pieces; the scheduling system exhaustively planned all the historical routes within N days, and selects the historical route with the best scheduling evaluation index in the history; when the When the requirements and the constraint conditions are not met in the historical route, the walking method is given according to the default scheduling plan, and the default scheduling plan is to randomly select a common walking method.
实施例三:在实施例一和实施例二中,排程系统可能会给出多种排程计划供企业选择,企业会选择排产评价指标最高的为最优排产计划。本实施例中,给出一种具体的排产评价指标计算方式:Embodiment 3: In the first and second embodiments, the scheduling system may provide a variety of scheduling plans for the company to choose from, and the company will choose the best scheduling plan with the highest scheduling evaluation index. In this embodiment, a specific calculation method of scheduling evaluation index is given:
所述排产评价指标是评价新的生产排程优劣的规则,所述排产评价指标由用户关注的指标加权综合打分得到。The scheduling evaluation index is a rule for evaluating the pros and cons of a new production scheduling, and the scheduling evaluation index is obtained by a weighted comprehensive scoring of indicators concerned by the user.
所述指标包括换牌得分、预库存得分、预交付期得分,所述排产评价指标=w1*换牌得分 +w2*预库存得分+w3预交付期得分,其中,w1、w2、w3为各个指标的权重。在其他实施例中,或者不同的企业中,其对应的指标和指标权重是可能不同的。The indicators include rebrand score, pre-inventory score, and pre-delivery period score. The scheduling evaluation index = w1* re-brand score+w2*pre-inventory score+w3 pre-delivery period score, where w1, w2, and w3 are The weight of each indicator. In other embodiments, or in different enterprises, the corresponding indicators and indicator weights may be different.
其中,所述换牌得分:判断各生产机台当天与前一天的牌号是否同一牌号,不是则记1,否则记0,汇总计划的N天内所有机台的换牌数,对不同的新的生产排程的换牌总数按降序排列,排第K名则打K分;Among them, the re-brand score: judge whether each production machine has the same brand on the day and the previous day. If not, record 1, otherwise, record 0. Summarize the number of license changes of all machines within N days of the plan. The total number of card changes in the production schedule is arranged in descending order, and the Kth place is scored with K points;
预库存得分:计算预计划安排生产后各牌号的产量,扣除对应牌号的预调拨量,判断该差值是否在各自库存上下限范围内,是则该牌号记1,否则记0,最后汇总各牌号的预库存总满足数,对其按升序排列,排第K名则打K分。Pre-inventory score: Calculate the output of each brand after the pre-planned production, deduct the pre-allocation amount of the corresponding brand, and judge whether the difference is within the upper and lower limits of the respective inventory. If the difference is within the upper and lower limits of the respective inventory, mark 1 for the brand, otherwise mark 0, and finally summarize each The pre-stock total fulfillment number of the brand is arranged in ascending order, and the K-th place is scored K.
预交付期得分:在计划N天内,先判断各牌号交付期是否在这N天计划内,若对交付期在这期间的牌号进行一个标数计算,若各牌号可提前完成交付则加1 ,可按时完成交付则加0,对记数进行累加,按升序排列,排第K名则打K分。Pre-delivery period score: within N days of the plan, first judge whether the delivery period of each brand is within the N-day plan. If a label is calculated for the brand with the delivery period during this period, add 1 if each brand can be delivered in advance. If the delivery can be completed on time, add 0 to accumulate the counts and arrange them in ascending order, and score K for the Kth place.
实施例四,对应的,一种智慧生成企业生产排程系统,所述排程系统基于上述实施例的智慧生成企业生产排程方法。The fourth embodiment corresponds to a smart generation enterprise production scheduling system, which is based on the smart generation enterprise production scheduling method of the foregoing embodiment.
在具体应用时,所述排程系统需要获取企业的基础信息和排产准备,并在排程前,做排程空间准备和学习剩余计划集。所述排程系统还需要学习历史排程,每天根据实际发生的排程对排程知识库进行更新。In specific applications, the scheduling system needs to obtain basic information and production scheduling preparations of the enterprise, and prepare the scheduling space and learn the remaining plan set before scheduling. The scheduling system also needs to learn historical scheduling, and update the scheduling knowledge base according to actual schedules that occur every day.
其中,所述基础信息具体包括以下:Wherein, the basic information specifically includes the following:
1、机台产能表:机台名、机台台时定额、实际日可生产时间、生产模式1. Machine capacity table: machine name, machine hourly quota, actual daily production time, production mode
产品类型:类别、牌号序列;(产品类型是一类生产模式相同的产品的共同基本属性。例如:红狼、灰狼都同属于一类生产模式,则归为1类)Product type: category, brand number sequence; (product type is the common basic attribute of a type of product with the same production mode. For example: Red wolf and gray wolf are both in the same type of production mode, so they are classified as category 1)
2、品名类别表:牌号、生产模式(其中每种生产模式对应Y个牌号)2. Product name category table: brand, production mode (each production mode corresponds to Y brand)
] 3、库存上下限表:牌号、库存上限、库存下限] 3. Inventory upper and lower limit table: grade, inventory upper limit, inventory lower limit
4、牌号热销情况:牌号、是与否(该配置表记录当季牌号热销情况,是记1,否则记0)4. Hot-selling status of grades: grade, yes or not (this configuration table records the hot-selling status of the brand in the current season, it is recorded as 1, otherwise it is recorded as 0)
5、约束条件配置表:产品类型、交付期、预调拨量、可生产箱数、预计材料可用日期、预计材料可生产量5. Constraint configuration table: product type, delivery period, pre-allocation, number of boxes that can be produced, estimated material availability date, estimated material production volume
所述排产准备具体包括以下:The production scheduling preparation specifically includes the following:
1、生产计划:每天汇总生产计划和生产排程,计算剩余生产计划。1. Production plan: Summarize the production plan and production schedule every day, and calculate the remaining production plan.
2、约束条件汇总:生产计划、提货计划、库存规则、辅料原料计划具体到每个品名类别。2. Summary of constraint conditions: production plan, picking plan, inventory rules, and auxiliary material plan are specific to each product name category.
(提供1个方法检验当前排程是否符合约束条件。)(Provide a method to check whether the current schedule meets the constraints.)
1)、生产计划:1), production plan:
A .当库存量大于预调拨量与库存下限之和时,不对该牌号进行排产;A. When the inventory is greater than the sum of the pre-allocated amount and the lower limit of the inventory, no production scheduling will be made for this brand;
B .当库存量小于预调拨量与库存下限之和时,库存量小于预调拨量的优先排产,其次才是库存量大于预调拨量但是小于预调拨量与库存下限之和的情况进行排产。B. When the inventory is less than the sum of the pre-allocated amount and the lower limit of inventory, priority is given to scheduling if the inventory is less than the pre-allocated amount, followed by the case where the inventory is greater than the pre-allocated amount but less than the sum of the pre-allocated amount and the lower limit of inventory. Produce.
2)、提货计划:2). Delivery plan:
[0045] 计算牌号当天距离其交付日期的时差,时差小的说明比较迫切优先排产。即按时差升序排列,排名越靠前优先级越高。[0045] Calculate the time difference between the day of the brand and its delivery date. A small time difference indicates that it is urgent to prioritize production. That is, they are arranged in ascending order of time difference, and the higher the ranking, the higher the priority.
3)、库存规则:3). Inventory rules:
A .预库存量不能大于库存上限;A. The pre-stock quantity cannot be greater than the upper limit of the stock;
B .当预库存总量不得超过仓库饱和值。B. When the total amount of pre-stock must not exceed the warehouse saturation value.
4)、辅料原料计划:4), auxiliary material plan:
A .当辅料、原料充足的,优先排产。A. When the auxiliary materials and raw materials are sufficient, priority is given to scheduling.
B .当辅料、原料不足时,按可以排产多少箱数去计划,再根据预计可用日期和可生产量去计划剩余量。B. When auxiliary materials and raw materials are insufficient, plan according to how many boxes can be scheduled, and then plan the remaining quantity according to the estimated available date and production capacity.
3、机台生产基数3. Machine production base
机台生产基数是一个机台一天可以生产的箱数。The production base of a machine is the number of boxes that a machine can produce in one day.
根据剩余生产计划,计算每个品名类别的生产基数。According to the remaining production plan, calculate the production base of each product name category.
所述排程空间准备时,建立X天的排程暂存区,建立空的最优排程表,当前的最有排产评价指标为0。When the scheduling space is prepared, an X-day scheduling temporary storage area is established, an empty optimal scheduling table is established, and the current most efficient scheduling evaluation index is 0.
排程过程中,具体步骤为:During the scheduling process, the specific steps are:
S100:获取最新剩余计划集和最新约束条件;S100: Obtain the latest remaining plan set and the latest constraint conditions;
S200:遍历各品名类别;S200: Traverse each product name category;
S210:获取产品类型;S210: Obtain product type;
S220:遍历该产品类型的排程知识库;S220: Traverse the scheduling knowledge base of the product type;
S221:找出相同产品类型的,且小于等于剩余计划的最大基数的历史排程,当其约束条件也适合于当前情况时,将历史排程的明细排入排程暂存区。如果没有符合条件的历史排程,则使用缺省排产方案,所述缺省排产方案满足约束条件和剩余计划集,不考虑是否最右;S221: Find historical schedules of the same product type that are less than or equal to the maximum cardinality of the remaining plans, and when the constraint conditions are also suitable for the current situation, schedule the details of the historical schedules into the schedule temporary storage area. If there is no historical schedule that meets the conditions, the default scheduling plan is used, and the default scheduling plan meets the constraint conditions and the remaining plan set, regardless of whether it is the rightmost;
S222:如果S221选出的历史排程不符合品名类别的约束条件,回到步骤2 .2 .1,重新获取新的历史排程;S222: If the historical schedule selected in S221 does not meet the constraints of the product name category, go back to step 2.2 .1, Re-obtain a new historical schedule;
S230:计算排产评价指标,如果大于最优排产评价指标,将排程复制到最优排程表;S230: Calculate the scheduling evaluation index, and if it is greater than the optimal scheduling evaluation index, copy the schedule to the optimal scheduling table;
S300:把最优排程表保存到排程系统的数据库中;S300: Save the optimal scheduling table in the database of the scheduling system;
S400:结束。S400: End.
由上述对本发明的描述可知,和现有技术相比,本发明提出的一种智慧生成企业生产排程方法及系统,首创用人机对弈的思维和技术解决企业生产排程的问题。排程过程中,化繁为简,将不可测的排产因素变化,如插单、计划变更,原料到货不及等情况,都看做是对弈的约束条件,即看做是人机对弈中,对手的走法,化复杂的变化因素为对手例行的动作,排程系统根据对手的动作做出下一步反应,给出新的生产排程,同时,给出的新的生产排程,其排程建议是源自于历史知识中,满足约束条件,且综合性指标最优的历史排程,其给出的排程建议,具有安全性、合理性、最优性和可朔性。From the above description of the present invention, it can be seen that compared with the prior art, the present invention proposes a smart generation enterprise production scheduling method and system, which is the first to use human-machine game thinking and technology to solve the problem of enterprise production scheduling. In the scheduling process, the complexity is simplified, and the unpredictable changes in scheduling factors, such as inserting orders, plan changes, and insufficient raw materials arrival, are all regarded as constraints of the game, that is, as a human-machine game. , The opponent’s move, the complex change factor is turned into the opponent’s routine action, the scheduling system will make the next response according to the opponent’s action, give a new production schedule, and at the same time, give a new production schedule, The scheduling recommendations are derived from historical knowledge, satisfy the constraints, and have the best comprehensive indicators. The scheduling recommendations given by it are safe, reasonable, optimal and flexible.
上面对本发明进行了示例性描述,显然本发明具体实现并不受上述方式的限制,只要采用了本发明的方法构思和技术方案进行的各种非实质性的改进,或未经改进将本发明的构思和技术方案直接应用于其它场合的,均在本发明的保护范围之内。The present invention has been described exemplarily above. Obviously, the specific implementation of the present invention is not limited by the above-mentioned manners, as long as various insubstantial improvements made by the method concept and technical solution of the present invention are adopted, or the present invention has not been improved. The concept and technical solution of the invention are directly applied to other occasions, all within the protection scope of the present invention.
 To

Claims (7)

  1. 一种智慧生成企业生产排程方法,其特征在于,排程系统以人机对弈方式,自动根据排产因素变化,生成新的生产排程;所述新的生产排程以排产评价指标为目标,以满足生产需求为前提,以排产因素变化为对弈的约束条件。A method for intelligently generating enterprise production scheduling, which is characterized in that the scheduling system automatically generates a new production schedule based on changes in scheduling factors in a man-machine game mode; the new production schedule uses a scheduling evaluation index as The goal is to meet the production demand as the premise, and the change in production scheduling factors is the constraint of the game.
  2. 根据权利要求1所述的一种智慧生成企业生产排程方法,其特征在于,在所述人机对弈方式中,将生产机台当成有限状态机或棋子,所述生产机台能够生产的M种产品,当成所述有限状态机或棋子的M种状态或M种走法。The production scheduling method of a smart generation enterprise according to claim 1, characterized in that, in the human-machine game mode, the production machine is regarded as a finite state machine or chess piece, and the production machine can produce M The products are regarded as the M states or M moves of the finite state machine or chess pieces.
  3. 根据权利要求2所述的一种智慧生成企业生产排程方法,其特征在于,所述排程系统学习每台所述生产机台的生产产品类型、生产能力、产品切换路线,转化成每个所述有限状态机或棋子的供选择的走向和连续的行走路线。The smart generation enterprise production scheduling method according to claim 2, wherein the scheduling system learns the production product type, production capacity, and product switching route of each production machine, and transforms them into each Alternative directions and continuous walking routes of the finite state machine or chess pieces.
  4. 根据权利要求3所述的一种智慧生成企业生产排程方法,其特征在于,所述约束条件包括原生产计划变更、原料储量、交付期限、设备状况;所述约束条件约束所述生产机台对生产产品的选择;即,在满足生产需求为前提的情况下,将前一天的生产排程当成当前棋盘布局,将所述约束条件当成所述排程系统的对弈对手,所述排程系统穷举计划的N天内所有路线,以约束条件排除不可能路线,限制所述有限状态机或棋子接下去的行走路线;所述接下去的行走路线不同,对应不同的新的生产排程。The production scheduling method of a smart generation enterprise according to claim 3, wherein the constraint conditions include changes to the original production plan, raw material reserves, delivery deadlines, and equipment status; the constraint conditions restrict the production machine The choice of products to be produced; that is, under the premise of meeting production requirements, the production schedule of the previous day is regarded as the current board layout, and the constraint conditions are regarded as the opponent of the scheduling system, and the scheduling system Exhaust all routes within N days of the exhaustive plan, exclude impossible routes with constraint conditions, and restrict the next walking routes of the finite state machine or chess pieces; the next walking routes are different and correspond to different new production schedules.
  5. 根据权利要求4所述的一种智慧生成企业生产排程方法,其特征在于,所述排程系统学习历史排程和实时排程,即学习所述有限状态机或棋子的历史路线和实时走法;所述排程系统穷举计划的N天内所有历史路线,选择历史中,排产评价指标最好的历史路线;当所述历史路线中没有满足需求和所述约束条件时,按缺省排产方案给出走法,所述缺省排产方案为随机选取一个常用的走法。The production scheduling method of a smart generation enterprise according to claim 4, wherein the scheduling system learns historical scheduling and real-time scheduling, that is, learning historical routes and real-time moves of the finite state machine or chess pieces. Method; the scheduling system exhaustively planned all historical routes within N days, select the historical route with the best scheduling evaluation index in the history; when the historical route does not meet the requirements and the constraints, press the default The production scheduling plan provides a walking method, and the default production scheduling plan is to randomly select a commonly used walking method.
  6. 根据权利要求1到5任一项所述的一种智慧生成企业生产排程方法,其特征在于,所述排产评价指标是评价新的生产排程优劣的规则,所述排产评价指标由用户关注的指标加权综合打分得到。The method for intelligently generating enterprise production scheduling according to any one of claims 1 to 5, wherein the scheduling evaluation index is a rule for evaluating the pros and cons of a new production scheduling, and the scheduling evaluation index Obtained by the weighted comprehensive score of the indicators concerned by users.
  7. 一种智慧生成企业生产排程系统,其特征在于,所述排程系统基于权利要求1到6任一项所述的一种智慧生成企业生产排程方法。A production scheduling system for a smart generation enterprise, characterized in that the scheduling system is based on the production scheduling method for a smart generation enterprise according to any one of claims 1 to 6.
PCT/CN2019/120979 2019-02-11 2019-11-26 Method and system for intelligently generating production scheduling of enterprise WO2020164293A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910109544.4A CN109948899A (en) 2019-02-11 2019-02-11 A kind of wisdom generation enterprise's production scheduling method and system
CN201910109544.4 2019-02-11

Publications (1)

Publication Number Publication Date
WO2020164293A1 true WO2020164293A1 (en) 2020-08-20

Family

ID=67007952

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/120979 WO2020164293A1 (en) 2019-02-11 2019-11-26 Method and system for intelligently generating production scheduling of enterprise

Country Status (2)

Country Link
CN (1) CN109948899A (en)
WO (1) WO2020164293A1 (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109948899A (en) * 2019-02-11 2019-06-28 厦门邑通软件科技有限公司 A kind of wisdom generation enterprise's production scheduling method and system
CN111695763B (en) * 2020-04-29 2023-11-24 同济大学 Scheduling system and method based on voice question and answer
CN112132658B (en) * 2020-09-22 2024-05-17 中科云谷科技有限公司 Interaction method for mechanical equipment, cloud server, client and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5826236A (en) * 1994-12-09 1998-10-20 Kabushiki Kaisha Toshiba Method for allocating resources and processes for design and production plan scheduling
US20040030428A1 (en) * 2002-05-03 2004-02-12 Manugistics, Inc. System and method for scheduling and sequencing supply chain resources
CN104573860A (en) * 2014-12-31 2015-04-29 北京农业信息技术研究中心 Automatic large-scale vegetable planting enterprise planting plan generation method
CN105204472A (en) * 2015-09-30 2015-12-30 河南科技大学 Single-piece discrete type production operation scheduling optimization method
CN106408112A (en) * 2016-08-31 2017-02-15 广州亿澳斯软件股份有限公司 Production order production scheduling management method and production scheduling optimizer system
CN109948899A (en) * 2019-02-11 2019-06-28 厦门邑通软件科技有限公司 A kind of wisdom generation enterprise's production scheduling method and system

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008030637A2 (en) * 2006-05-01 2008-03-13 Blueshift Technologies, Inc. Methods and systems for controlling a semiconductor fabrication process
CN101271543A (en) * 2008-04-23 2008-09-24 永凯软件技术(上海)有限公司 Production scheduling system and method using genetic algorithm based on elite solution pool
CN102117371A (en) * 2009-12-31 2011-07-06 北京谊安医疗系统股份有限公司 Operation schedule data processing method and device
CN105427021A (en) * 2015-10-30 2016-03-23 江苏云道信息技术有限公司 Intelligent clothes production scheduling method
CN106446392B (en) * 2016-09-19 2019-07-23 浙江大学 A kind of hybrid system modeling and simulating method of Process-Oriented industry tank field
CN108009682A (en) * 2017-12-01 2018-05-08 郑州云海信息技术有限公司 A kind of station technique DYNAMIC DISTRIBUTION method and system under the big data based on MES

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5826236A (en) * 1994-12-09 1998-10-20 Kabushiki Kaisha Toshiba Method for allocating resources and processes for design and production plan scheduling
US20040030428A1 (en) * 2002-05-03 2004-02-12 Manugistics, Inc. System and method for scheduling and sequencing supply chain resources
CN104573860A (en) * 2014-12-31 2015-04-29 北京农业信息技术研究中心 Automatic large-scale vegetable planting enterprise planting plan generation method
CN105204472A (en) * 2015-09-30 2015-12-30 河南科技大学 Single-piece discrete type production operation scheduling optimization method
CN106408112A (en) * 2016-08-31 2017-02-15 广州亿澳斯软件股份有限公司 Production order production scheduling management method and production scheduling optimizer system
CN109948899A (en) * 2019-02-11 2019-06-28 厦门邑通软件科技有限公司 A kind of wisdom generation enterprise's production scheduling method and system

Also Published As

Publication number Publication date
CN109948899A (en) 2019-06-28

Similar Documents

Publication Publication Date Title
WO2020164293A1 (en) Method and system for intelligently generating production scheduling of enterprise
Hendry et al. Patterns of strategic change in the development of human resource management
Toomey MRP II: planning for manufacturing excellence
Cheng et al. Just-in-time manufacturing: an introduction
Gross et al. Kanban made simple: demystifying and applying Toyota's legendary manufacturing process
Wortman et al. A review of capacity planning techniques within standard software packages
O’Sullivan Framework for managing business development in the networked organisation
CN106846179A (en) A kind of resident load bilayer method for optimizing scheduling based on non-cooperative game
Wearne Control of engineering projects
Gunawardana Introduction of Advanced Manufacturing Technology: a literature review
Bider et al. Adaptive case management as a process of construction of and movement in a state space
Roy et al. The role of discrete event simulation techniques in finite capacity scheduling
CN116957744A (en) Sales service system based on digital manufacturing furniture
Dutton Simulation of an actual production scheduling and work flow control system
Schwember Cybernetics in government: experience with new tools for management in Chile 1971–1973
Shinohara European and Japanese Logistics Paradigms: An Explorative and comparative study of the dynamics of logistics management
Chen The application of decomposition and condensation algorithms to the logical design of resource planning and management (RPM) networks
Niles Stochastic capacity modeling to support demand/capacity gap planning
Caminer LEO and its Applications: the Beginning of Business Computing
Simons Production Network Capacity Modeling for Strategic Network Planning
Lee Transformation: The Holistic-Path Approach
Ottocento et al. International trade between Europe and China in the context of the belt and road initiative: a multi-criteria decision model to compare different freight transport solutions
Vergotte Robustness versus stability measures in proactive scheduling for timetabling applications
Kurtuk et al. Optimising Decision-Making: Devising a Framework Applicable to Project Management Practitioners
Paopongchuang et al. Finite capacity material requirement planning system for supply chain network

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19914917

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19914917

Country of ref document: EP

Kind code of ref document: A1