基于活动重心定理的关键链识别法

针对关键链识别这一关键链调度理论的基本问题,建立了以活动重心为优先规则的两阶段关键链识别启发式求解方法。并运用数理统计学假设检验方法,以Patterson110问题集为样本,将新构建的算法与三种基于较好优先规则的启发式算法进行了比较,统计数据说明论文构建的迭代重心法有一定的先进性,同时极大地简化了关键链的识别过程。     

插单扰动下流水线生产与维护的重调度优化北大核心CSSCI

研究了拉式生产模式下考虑重调度需求的生产调度与预防性维护的联合优化问题。针对新工件突然到达对生产计划造成扰动的情况,对流水车间的重调度问题进行建模,优化目标兼顾生产、维护以及调度稳定性三个方面,其中调度稳定性指标特别考虑了设备维护计划的偏离成本。算法方面,根据模型的特点对遗传算法进行改进,对初始种群制定调度偏离约束的启发式规则,并引入最大公共序列交叉算子,设计了一种有效适用于该问题的改进算法IPC-LCSC GA。算例验证结果表明,在对具有维护计划的生产系统进行重调度时,与右移重调度以及不考虑维护稳定性的重调度相比,本文模型表现更优。     

插单扰动下流水线生产与维护的重调度优化

研究了拉式生产模式下考虑重调度需求的生产调度与预防性维护的联合优化问题。针对新工件突然到达对生产计划造成扰动的情况,对流水车间的重调度问题进行建模,优化目标兼顾生产、维护以及调度稳定性三个方面,其中调度稳定性指标特别考虑了设备维护计划的偏离成本。算法方面,根据模型的特点对遗传算法进行改进,对初始种群制定调度偏离约束的启发式规则,并引入最大公共序列交叉算子,设计了一种有效适用于该问题的改进算法IPC-LCSC GA。算例验证结果表明,在对具有维护计划的生产系统进行重调度时,与右移重调度以及不考虑维护稳定性的重调度相比,本文模型表现更优。     

研发型企业多项目人力资源调度研究——基于蚁群优化的超启发式算法

现阶段,研发型企业的项目处于多项目环境下,为了解决多项目并行时人力资源争夺问题,本文针对该类企业多项目管理中人力资源调度进行优化研究,以考虑项目延期惩罚成本的最小总成本为目标函数,将现实问题抽象建模。基于国内外的研究提出了一种超启发式算法进行求解,该算法将人力资源调度问题分为项目活动分配和人员选择项目活动两个部分,采用蚁群优化作为高层启发式策略搜索低层启发式规则,再进一步根据规则解构造出可行解。最后本研究设计多组仿真实验与启发式规则进行对比,结果表明该算法有较好的搜索性能,为人力资源的调度问题提供了新的解决方案。     

集装箱码头岸吊作业调度建模及调度策略研究

岸吊作业调度对集装箱码头整体运营效率具有重要影响.综合考虑岸吊实际作业中的特有约束,包括预定义顺序约束、依赖于作业次序的设备调整时间、岸吊干涉约束,建立岸吊作业调度问题的混合整数规划模型.针对混合装卸模式,使用启发式算法生成预定义作业顺序,在此基础上采用基于连续贝作业策略的启发式算法对问题进行求解.数据实验结果显示基于SPT规则和连续贝作业的启发式算法能有效利用混合装卸带来的时间节省,减少设备调整时间,对实际岸吊作业调度具有指导意义.     

基于粒子群算法的半导体制造设备预维修调度

对半导体制造设备的预维修调度问题进行了研究,建立了半导体制造设备预维修调度的数学模型,分别提出了用于求解该问题的启发式方法和粒子群算法方案,阐明了两种算法方案的具体实现过程。通过对仿真实例进行计算和结果比较,表明了粒子群算法优于启发式方法,取得了不错的优化效果。     

钢管冷区生产调度的一种启发式算法

基于国内大型钢铁公司的实际操作,运用离散化时间的方法把钢管冷区生产调度抽象为可中断Job-Shop问题.同时考虑前置库存限制、生产尽可能连续、部分人工调度等约束条件,以最小化中断次数和尽可能满足人工调度为目标,建立相应的数学模型.再依据约束条件的主次性设计生产调度规则(赋值规则和生产规则),根据实际生产流程设计启发式算法.运用该算法对该问题的大规模算例进行求解,其结果在满足了约束条件情况下达到比较理想的中断次数.     

面向柔性作业调度问题的启发性规则改进遗传算法

对柔性作业调度问题,提出了一种启发性规则的改进遗传求解方法,此方法从启发性规则出发产生初始调度解。通过对初始调度解进行比较而产生初始种群。对初始种群通过启发规则的改进遗传算法进行优化计算,对染色体进行交叉、变异、交换和选择操作,应用启发式规则搜索关键工序并提高关键工序的交换、变异操作概率,在变异操作中利用启发式规则对变异过程加以引导,从而得到优化解。将此方法运用于一系列典型柔性调度问题进行了实验求解,并将求解结果与其他的计算方法进行了比较,表明此方法能提高求解效率,适合复杂的柔性作业调度问题求解。     

多资源作业车间的混合自适应GA优化调度

针对多资源约束的车间调度问题,将启发式算法和自适应GA优化方法结合起来,提出了混合自适应GA方法,建立了多资源约束的车间优化调度模型.根据启发式调度算法中优先规则对调度目标的影响,设计了新的编码规则.采用正弦函数作为自适应因子,使得交叉概率和变异概率随群体的适应度自动改变,提高了运算的效率,克服了启发式算法和普通GA的缺陷.通过实例仿真并与其他算法比较结果表明,混合自适应GA算法可以很好的解决作业车间在机床、刀具等多种生产资源约束下的优化调度,并在评价指标上较其他算法更优.     

基于多重约束的飞机移动装配线作业调度优化

基于对飞机移动装配线作业多重约束的分析,建立了作业调度优化问题的整数规划模型,提出了组合优先规则WRST以及基于此规则的启发式算法.WRST综合考虑了最迟完成时间、资源以及空间稀缺度三个指标;而算法设计包括基于WRST规则的作业拓扑排序和作业资源分配两阶段.数值试验结果显示基于WRST规则的启发式算法求解质量高,求解速...     

Formation of independent flow-line cells based on operation requirements and machine capabilities

In this paper we study the generalized grouping problem of cellular manufacturing. We propose an operation-sequence-based method for forming flow-line manufacturing cells. Process planning in the form of selection of the machine for each operation is included in the problem formulation. Input requirements include the set of operation requirements for each part type, and operation capabilities for all available machine types. The objective is to find the minimum-cost set of flow-line cells that is capable of producing the desired part mix. A similarity coefficient based on the longest common operation subsequence between part types is defined and used to group parts into independent, flow-line families. An algorithm is developed for finding a composite operation supersequence for each family. Given machine options for each operation in this sequence, the optimal machine sequence and capacity for each cell is then found by solving a shortest path problem on an augmented graph. The method is shown to be efficient and computational results are reported.     

考虑负荷实际分布的分时段CRP改进算法

在分析ERP中CRP算法存在不足的基础上,研究了CRP中工作中心负荷的计算方法,指出标准CRP算法在计算工作中心负荷时与实际负荷分布存在明显偏差,在此基础上提出了考虑负荷实际分布的分时段CRP改进算法,建立了基于这一原理的CRP算法模型,并以实际案例验证了这一改进算法的正确性与价值,对相关问题进行了讨论.     

Material and capacity requirements planning with dynamic lead times

Traditional material requirements planning (MRP) does not consider the finite capacity of machines, and assumes fixed lead times. This paper develops an approach (material and capacity requirements planning; MCRP) to integrate capacity planning into MRP. To obtain a capacity feasible production plan, different measures for capacity adjustment such as alternative routeings, safety stock, lot splitting and lot summarisation, are discussed. Additionally, lead times are no longer assumed to be fixed. They are calculated dynamically with respect to machine capacity utilisation. A detailed example is presented to illustrate how the MCRP approach works successfully.     

A beam search-based algorithm and evaluation of scheduling approaches for flexible manufacturing systems

This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and sequence flexibilities and generates machine and automated guided vehicle (AGV) schedules for a given scheduling period. A new deadlock resolution mechanism is also developed as an integral part of the proposed algorithm. The performance of the algorithm is compared with several machine and AGV dispatching rules using mean flow time, mean tardiness and makespan criteria. It is also used to examine the effects of scheduling factors (i.e., machine and AGV load levels, routing and sequence flexibilities, etc.) on the system performance. The results indicate that the proposed scheduling algorithm yields considerable improvements in system performance over dispatching rules under a wide variety of experimental conditions.     

Open-pit block sequencing optimization: A mathematical model and solution technique

This study presents a comprehensive mathematical formulation model for a short-term open-pit mine block sequencing problem, which considers nearly all relevant technical aspects in open-pit mining. The proposed model aims to obtain the optimum extraction sequences of the original-size (smallest) blocks over short time intervals and in the presence of real-life constraints, including precedence relationship, machine capacity, grade requirements, processing demands and stockpile management. A hybrid branch-and-bound and simulated annealing algorithm is developed to solve the problem. Computational experiments show that the proposed methodology is a promising way to provide quantitative recommendations for mine planning and scheduling engineers.     

Economic design of unit load-based FMSs employing AGVs for transport

A methodology to economically configure an automated guided vehicle based flexible manufacturing system (FMS) in terms of machine and material handling requirements is presented. The procedure uses the concept of simultaneous design to determine the number of machines required at each workstation in the FMS and the number of automated guided vehicles required to service the material handling needs of the system. The technique integrates decisions on machine requirements, vehicle requirement, and vehicle/container carrying capacity into a single cost model. Solution to the model automatically yields the best resource configuration for the shop that achieves the set production target while minimizing total manufacturing cost. A hybrid algorithm that combines numerical search, simulation, and statistical analysis is employed for solving the problem. The application of the design procedure is demonstrated with an example problem. Sensitivity analysis on machine and vehicle requirements due to changes in job attributes and unit transport quantities are also performed.     

GA-based adaptive setup planning toward process planning and scheduling integration

Setup planning of a part for more than one available machine is a typical combinatorial optimisation problem under certain constraints. It has significant impact not only on the whole process planning but also on scheduling, as well as on the integration of process planning and scheduling. Targeting the potential adaptability of process plans associated with setups, a cross-machine setup planning approach using genetic algorithms (GA) for machines with different configurations is presented in this paper. First, based on tool accessibility analysis of different machine configurations, partially sequenced machining features can be grouped into certain setups; then by responding to the requirements from a scheduling system, optimal or near-optimal setup plans are selected for certain criteria, such as cost, makespan and/or machine utilisation. GA is adopted for the combinatorial optimisation, which includes gene pool generation based on tool accessibility examination, setup plan encoding and fitness evaluation, and optimal setup plan selection through GA operations. The proposed approach is implemented in a GA toolbox, and tested using a sample part. The results demonstrate that the proposed approach is applicable to machines with varying configurations, and adaptive to different setup requirements from a scheduling system due to machine availability changes. It is expected that this approach can contribute to process planning and scheduling integration when a process plan is combined with setups for alternative machines during adaptive setup planning.     

Modeling the planning and scheduling across the outsourcing supply chain: a Chaos-based fast Tabu–SA approach

Planning and Scheduling are the interrelated manufacturing functions and should be solved simultaneously to achieve the real motives of integration in manufacturing. In this paper, we have addressed the advanced integrated planning and scheduling problem in a rapidly changing environment, where the selection of outsourcing machine/operation, meeting the customers (single or multiple) due date, minimizing the makespan are the main objectives while satisfying several technological constraints. We developed a mixed integer programming model for integrated planning and scheduling across the outsourcing supply chain and showed how such models can be used to make strategic decisions. It is a computationally complex and mathematically intractable problem to solve. In this paper, a Chaos-based fast Tabu-simulated annealing (CFTSA) incorporating the features of SA, Tabu and Chaos theory is proposed and applied to solve a large number of problems with increased complexity. In CFTSA algorithm, five types of perturbation schemes are developed and Cauchy probability function is used to escape from local minima and achieve the optimal/near optimal solution in a lesser number of iterations. An intensive comparative study shows the robustness of proposed algorithm. Percentage Heuristic gap is used to show the effectiveness and two ANOVA analyses are carried out to show the consistency and accuracy of the proposed approach.     

Dynamic cellular manufacturing system design considering alternative routing and part operation tradeoff using simulated annealing based genetic algorithm

In this paper, an integrated mathematical model of multi-period cell formation and part operation tradeoff in a dynamic cellular manufacturing system is proposed in consideration with multiple part process route. This paper puts emphasize on the production flexibility (production/subcontracting part operation) to satisfy the product demand requirement in different period segments of planning horizon considering production capacity shortage and/or sudden machine breakdown. The proposed model simultaneously generates machine cells and part families and selects the optimum process route instead of the user specifying predetermined routes. Conventional optimization method for the optimal cell formation problem requires substantial amount of time and memory space. Hence a simulated annealing based genetic algorithm is proposed to explore the solution regions efficiently and to expedite the solution search space. To evaluate the computability of the proposed algorithm, different problem scenarios are adopted from literature. The results approve the effectiveness of the proposed approach in designing the manufacturing cell and minimization of the overall cost, considering various manufacturing aspects such as production volume, multiple process route, production capacity, machine duplication, system reconfiguration, material handling and subcontracting part operation.     

The customer satisfaction-oriented planning method for redesign parameters of used machine tools

Performance recovery is the main emphasis in most remanufactured machine tools, rather than the effective combination of customer requirements (CRs) and redesign processes. Because of this, remanufactured machine tools do not reach their potential competitiveness, highly restricting the implementations to recover used machine tools. To help remedy this, fuzzy nonlinear regression is applied to the fuzzy relationships between CRs and redesign parameters, and the fuzzy correlations among redesign parameters are analysed by fully considering the uncertainties between CRs and redesign parameters. Improved planning equations based on fuzzy nonlinear regression are proposed by injecting fuzziness into the original planning equations. The redesign process of a machine tool is taken as an example to implement the proposed method. The results show that the improved planning equations can obtain higher customer satisfaction compared to the unimproved planning equations. This can provide new thinking to effectively combine CRs and redesign processes.