共查询到17条相似文献,搜索用时 187 毫秒
1.
2.
3.
4.
热轧生产调度是一个复杂的约束组合优化问题,其生产约束包括连续轧制板坯的宽度、厚度和硬度跳变要求,轧制单元的最大长度,产品库存及交货期等。基于多旅行商模型,建立了热轧生产批量调度问题的优化模型,并提出一种混合遗传算法(遗传算法、局部搜索)求解该问题。通过应用串行边重组和并行边重组的遗传交叉算子,算法在优化过程中可以很好地处理调度约束。针对工业数据的仿真结果证明该调度模型和混合遗传算法的并行求解策略可以有效地解决热轧生产批量调度问题。 相似文献
5.
6.
7.
研究了一种新的生产调度问题的优化问题,针对这种新的调度模式,设计了一种两层遗传算法进行优化求解。算法采用了上下两层共同进化,上层遗传算法优化产品生产过程中每类产品对应每台设备所生产的物料类型的分配,下层遗传退火算法优化了所有产品子批量的一个排序。在算法的求解过程中,引入了针对该问题的一个新的批量加工时间计算方法来求得最大完成时间指标的值。最后通过系统仿真论证了算法以及批量完工时间计算的有效性。 相似文献
8.
彭频 《计算机工程与科学》2014,36(10):1961-1965
将轧制批量计划编制问题归结为车辆路径问题,采用粒子群算法对模型求解,设计了轧制批量计划问题的编码方案,阐明了算法的具体实现过程。计算结果表明,利用粒子群算法解决热轧批量计划问题是有效和可行的。 相似文献
9.
10.
11.
This paper considers the rolling batch planning problem of grouping and sequencing a given set of slabs into several rolling units in iron and steel industry. The existing mathematical methods often used for the problem are traveling salesman problem (TSP) and vehicle routing problem (VRP), but these methods are not precise, because the position limitation of some slabs in a rolling unit scheduling is not considered. Therefore we suggest a new model, vehicle routing problem with time window (VRPTW) to describe the rolling batch planning problem, in which the position limitation of slabs are quantified as the time constraints. Several solution methods including the genetic algorithm are presented for solving the problem and the computational results show that the genetic algorithm is superior to other methods.In this paper, the vehicle routing problem with time window (VRPTW) of combinational optimization is used to analyze and model the rolling batch planning problem. Genetic algorithm and heuristic are used to solve the problem. Simulation results based on the actual production data show that this model is precise and the genetic algorithm based method is very promising. 相似文献
12.
轧制批量计划问题的模型及算法研究 总被引:5,自引:0,他引:5
网络建模在系统分析中是最有效的方法之一,广泛地应用于工业工程和生产调度中,应用组合优化中著名的车辆调度问题分析、研究钢生产中传统的轧制批量计划问题,提出一种新的具有优化分割功能的遗传算法,并进行了计算机仿真、仿真结果证实该方法的有效性。 相似文献
13.
A Case Study on Integrated Production Planning and Scheduling in a Three-Stage Manufacturing System 总被引:1,自引:0,他引:1
This paper presents an integrated optimization model of production planning and scheduling for a three-stage manufacturing system, which is composed of a forward chain of three kinds of workshops: a job shop, a parallel flow shop consisting of parallel production lines, and a single machine shop. As the products at the second stage are assembled from the parts produced in its upstream workshop, a complicated production process is involved. On the basis of the analysis of the batch production, a dynamic batch splitting and amalgamating algorithm is proposed. Then, a heuristic algorithm based on a genetic algorithm (known as the integrated optimization algorithm) is proposed for solving the problem. Note to Practitioners-This paper presents a method for integrated production planning and scheduling in a three-stage manufacturing system consisting of a forward chain of three kinds of workshops, which is common in such enterprises as producers of automobiles and household electric appliances, as in the case of an autobody plant usually with the stamping workshop, the welding and assembling workshop, and the painting workshop. Herein, the production planning and scheduling problems are simultaneously addressed in the way that a feasible production plan can be obtained and the inventory reduced. A batch splitting and amalgamating algorithm is proposed for balancing the production time of the production lines. And a case study of the integrated planning and scheduling problem in a real autobody plant verifies the effectiveness of our method 相似文献
14.
15.
基于部分生产重构的冷轧生产重调度方法 总被引:2,自引:2,他引:0
针对冷轧薄板生产过程单纯根据合同流向组织生产会造成合同在各物流流向中分配不均, 以及机组定修和突发故障等情况造成的部分流向生产停滞等问题, 建立了基于部分重构的冷轧生产过程混杂Petri网生产调度模型. 利用提出的有限搜索蚁群算法, 在不同生产流向的可替代机组之间, 根据机组的产能负荷对合同的生产流向进行部分重构, 实现合同生产过程的再规划与动态调度, 解决了部分机组停机定修和突发故障时的产能分配问题. 将本文提出的方法与全流程合同计划方法相结合, 利用上海宝钢冷轧薄板厂的生产数据进行测试, 表明了所提出的方法提高了冷轧全流程合同计划与调度效果的可行性. 相似文献
16.
Yu-Wang Chen Yong-Zai LuGen-Ke Yang Chang-Chun Pan 《Computers & Operations Research》2012,39(2):339-349
A hot strip mill (HSM) produces hot rolled products from steel slabs, and is one of the most important production lines in a steel plant. The aim of HSM scheduling is to construct a rolling sequence that optimizes a set of given criteria under constraints. Due to the complexity in modeling the production process and optimizing the rolling sequence, the HSM scheduling is a challenging task for hot rolling production schedulers. This paper first introduces the HSM production process and requirements, and then reviews previous research on the modeling and optimization of the HSM scheduling problem. According to the practical requirements of hot rolling production, a mathematical model is formulated to describe two important scheduling sub-tasks: (1) selecting a subset of manufacturing orders and (2) generating an optimal rolling sequence from the selected manufacturing orders. Further, hybrid evolutionary algorithms with integration of genetic algorithm (GA) and extremal optimization (EO) are proposed to solve the HSM scheduling problem. Computational results on industrial data show that the proposed HSM scheduling solution can be applied in practice to provide satisfactory performance. 相似文献