A method and system for solving a job shop scheduling problem without delay considering overtime
A technology for scheduling problems and populations, applied in the field of intelligent manufacturing, to achieve the effect of enhancing comprehensive search capabilities, reducing early completion time, and enhancing feasibility
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Publication Date
- 2022-02-08
Smart Images

Figure 1 
Figure 2 
Figure 3
Abstract
Description
technical field
[0001] The invention belongs to the technical field of intelligent manufacturing, and in particular relates to a method and system for solving a job shop scheduling problem without delay considering overtime. Background technique
[0002] The job shop scheduling problem is a typical manufacturing system scheduling problem. With the increase of individual needs of customers and the requirement of low-cost operation of manufacturing enterprises, order-oriented production has become one of the main production modes at present.
[0003] For order-oriented manufacturing systems, meeting the delivery date is an important goal pursued by production operations. If there is an order delay, it will not only affect the goodwill of the company, but also may cause delay penalties. Therefore, the corresponding scheduling problem also usually takes the minimization of delay as the optimization goal. Due to the exogenous and volatile nature of orders, and the endogenous an...
Examples
Embodiment Construction
[0072] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. Based on the implementation manners in the present invention, all other implementation manners obtained by persons of ordinary skill in the art without making creative efforts belong to the scope of protection of the present invention.
[0073] Aiming at the NP-hard problem of considering overtime and no delay in the job shop scheduling problem, the present invention proposes a method for solving the job shop scheduling problem without delay considering overtime, which can not only quickly obtain the near-optimal and feasible scheduling of the problem, but also Smaller total lead time and total overtime hours are available.
[0074] see figure 1 , the invention discloses a method...