小批量多类型PCB板组装生产调度算法研究

文章针对目前电子制造业中常见的小批量、多类型PCB板组装生产过程,研究如何进行生产调度以缩短总生产时间。文章着重考虑了不同PCB板类型转换生产时的调整时间对生产效率的影响,提出了一种能够有效缩短PCB生产调整时间的生产调度启发式算法。仿真数据表明,该算法能够给出较好的生产调度方案,提高PCB组装生产效率。

一种用于VLSI制造业的生产调度算法

介绍了一种用于 VLSI制造业的生产调度算法 ,它包含一个策略部分和一个流程排序部分 ,二者协作实现实际工艺线的生产安排。该算法对于 VLSI企业实现生产品种多样化 ,提高企业的管理水平和管理效率 ,具有重要意义及实用前景 ,是

具有最大作业延迟的生产调度优化算法及仿真

成组作业优化调度问题中的作业根据其加工特点要求可分成若干作业类。同一类的作业连续加工 ,其后的作业不需要机器设置花费 ,而不同类的作业连续加工 ,其后的作业需要机器设置花费。当优化目标是最大作业延迟时 ,单机成组作业优化调度是HP -hard。本文在利用优化性质的基础上 ,提出了一种适于大规模优化调度问题的多项式时间算法。仿真实验表明该算法具有良好的性能。

工业4.0背景下的离散企业生产调度

介绍"工业4.0"背景下企业资源管理(ERP)、制造执行系统(MES)等工业软件和企业资源管理系统、制造执行系统,着重分析和探讨制造执行系统的生产调度算法.合理的调度算法会使得MES系统运行更高效.

An improved cross entropy algorithm for steelmaking-continuous casting production scheduling with complicated technological routes

In order to increase productivity and reduce energy consumption of steelmaking-continuous casting(SCC) production process, especially with complicated technological routes, the cross entropy(CE) method was adopted to optimize the SCC production scheduling(SCCPS) problem. Based on the CE method, a matrix encoding scheme was proposed and a backward decoding method was used to generate a reasonable schedule. To describe the distribution of the solution space, a probability distribution model was built and used to generate individuals. In addition, the probability updating mechanism of the probability distribution model was proposed which helps to find the optimal individual gradually. Because of the poor stability and premature convergence of the standard cross entropy(SCE) algorithm, the improved cross entropy(ICE) algorithm was proposed with the following improvements: individual generation mechanism combined with heuristic rules, retention mechanism of the optimal individual, local search mechanism and dynamic parameters of the algorithm. Simulation experiments validate that the CE method is effective in solving the SCCPS problem with complicated technological routes and the ICE algorithm proposed has superior performance to the SCE algorithm and the genetic algorithm(GA).

An Improved Genetic Algorithm for Solving the Mixed⁃Flow Job⁃Shop Scheduling Problem with Combined Processing Constraints

The flexible job-shop scheduling problem(FJSP)with combined processing constraints is a common scheduling problem in mixed-flow production lines.However,traditional methods for classic FJSP cannot be directly applied.Targeting this problem,the process state model of a mixed-flow production line is analyzed.On this basis,a mathematical model of a mixed-flow job-shop scheduling problem with combined processing constraints is established based on the traditional FJSP.Then,an improved genetic algorithm with multi-segment encoding,crossover,and mutation is proposed for the mixed-flow production line problem.Finally,the proposed algorithm is applied to the production workshop of missile structural components at an aerospace institute to verify its feasibility and effectiveness.

A linear programming model for long-term mine planning in the presence of grade uncertainty and a stockpile

The complexity of an open pit production scheduling problem is increased by grade uncertainty. A method is presented to calculate the cost of uncertainty in a production schedule based on deviations from the target production. A mixed integer linear programming algorithm is formulated to find the min- ing sequence of blocks from a predefined pit shell and their respective destinations, with two objectives： to maximize the net present value of the operation and to minimize the cost of uncertainty. An efficient clustering technique reduces the number of var/ables to make the problem tractable. Also, the parameters that control the importance of uncertainty in the optimization problem are studied. The minimum annual mining capacity in presence of grade uncertainty is assessed. The method is illustrated with an oil sand deposit in northern Alberta.

Modeling and Optimisation of Precedence-Constrained Production Sequencing and Scheduling for Multiple Production Lines Using Genetic Algorithms

This paper presents an integrated methodology for the modelling and optimisation of precedence-constrained production sequencing and scheduling for multiple production lines based on Genetic Algorithms （GA）. The problems in this class are NP-hard combinatorial problems, requiring a triple optimisation at the same time： allocation of resources to each line, production sequencing and production scheduling within each production line. They are ubiquitous to production and manufacturing environments. Due to nature of constraints, the length of solutions for the problem can be variable. To cope with this variability, new strategies for encoding chromosomes, crossover and mutation operations have been developed. Robustness of the proposed GA is demonstrated by a complex and realistic case study.

Genetic algorithm for short-term scheduling of make-and-pack batch production process

This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.

Strategy of changing cracking furnace feedstock based on improved group search optimization

The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is proposed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the "excellent" infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Finally, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is obtained.