免疫遗传算法对精轧机组负荷分配的优化

提出基于1GA模型的热连轧精轧机组负荷分配的智能优化新方法,该方法具有计算精度高、速度快等特点,且适合在线计算.实验数据对比分析结果表明了该方法的有效性,为热连轧精轧机组轧制规程的智能优化设计提供了一条新途径.     

混合Flowshop双目标调度问题的双向仿真方法

针对JIT生产方式的混合Flowshop系统双目标调度问题，提出一种基于前向和反向仿真组合的双向仿真调度方法。用启发式算法进行前向仿真获得工件离开系统的时刻，并将其作为反向仿真的开工时刻。按工件的反向路由（加工顺序）进行反向仿真，以获得工件正向进入系统的较好时刻，从而减少工件的等待和平均的flowtime。仿真结果表明，该方法 能够较好地解决混合Flowshop的双目标调度问题。     

基于遗传算法的ERP生产计划排单模型

以某家具制造企业为实际背景 ,讨论ERP生产计划排单模型的建立及算法设计 .在所建模型中 ,对染色体采用工件编码规则进行编码 ,提出了掺杂人工基因重组的交叉方法 ,并且给出了选择、交叉和变异的具体算子 ,利用自适应遗传算法可实现生产计划的自动生成及调度     

各机器上具有相同加工时间F1oW Shop 调度问题

由m台机器构成的Flow Shop，当工件在各机器上加工时间相同时，直觉上，等价于单机问题。本文推测单机情形最优解的性质及其确定策略也应适合此调度模型。本文就一些目标函数验证了这一推测。     

基于遗传算法的柔性调度系统模型及其应用

以一个车间作业调度问题为例，探讨了一种借助遗传算法优化调度系统的模型。模型中考虑了基于工序的调度编码和遗传操作改进，以及在适应度函数中如何加入柔性处理等问题。实例模型计算结果表明了该模型的优越性。     

并行系统的一种组合式软硬件划分技术

研究并行系统的软硬件划分方法，建立了一种基于并行语言PL的代数语义的形式化软硬件体系结构，提出了一种基于基本调度块（BSB）的并行系统优化划分方法，该方法首先将PL程序分解为BSB，然后考察BSB的软硬件度量，最后利用启发式方法求出优化的软硬件划分方案，语法制导的划分规则可以用于系统的划分和软硬件成分的组合，本文提出的软硬件划分方法将系统的结构划分和功能划分有机地结合，具有实用价值。     

大系统分解协调法和非线性规划法应用于电力系统经济调度

讨论了含梯级水电站的大型水火电力系统有功功率最优分配的数学模型，考虑了水电厂上、下游水位的变化、梯级水电厂间的水流时间延迟等因素。通过两次运用对偶分解原理将整个系统分解成一个三级协调系统而得到三级计算结构，文中讨论了各级采用的非线性规划的多种最优化计算方法，并对实际电力系统进行试算和分析，文章对大系统分解协调法，乘子法和一种新变尺度法在水火电力系统短期经济调度中的应用作了探讨。     

间歇生产过程优化调度的新方法

提出间歇生产过程在线生产调度校正的评价指标．该指标较好地综合间歇过程等待时间和操作单元闲置时间对经济效益的影响，然后提出基于预测的短期生产调度在线校正算法POMA．访真结果表明，POMA算法具有很好的效果和很强的鲁棒性，     

An approximation algorithm for the generalized assignment problem

The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing jobj on machinei requires timep _ij and incurs a cost ofc _ij ; each machinei is available forT _i time units, and the objective is to minimize the total cost incurred. Our main result is as follows. There is a polynomial-time algorithm that, given a valueC, either proves that no feasible schedule of costC exists, or else finds a schedule of cost at mostC where each machinei is used for at most 2T _i time units.We also extend this result to a variant of the problem where, instead of a fixed processing timep _ij , there is a range of possible processing times for each machine—job pair, and the cost linearly increases as the processing time decreases. We show that these results imply a polynomial-time 2-approximation algorithm to minimize a weighted sum of the cost and the makespan, i.e., the maximum job completion time. We also consider the objective of minimizing the mean job completion time. We show that there is a polynomial-time algorithm that, given valuesM andT, either proves that no schedule of mean job completion timeM and makespanT exists, or else finds a schedule of mean job completion time at mostM and makespan at most 2T. Research partially supported by an NSF PYI award CCR-89-96272 with matching support from UPS, and Sun Microsystems, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.Research supported in part by a Packard Fellowship, a Sloan Fellowship, an NSF PYI award, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.     

Periodic maintenance and repair rate control in stochastic manufacturing systems

In this paper, we consider a periodic preventive maintenance, repair, and production model of a flexible manufacturing system with failure-prone machines, where the control variables are the repair rate and production rate. We use periodic preventive maintenance to reduce the machine failure rates and improve the productivity of the system. One of the distinct features of the model is that the repair rate is adjustable. Our objective is to choose a control process that minimizes the total cost of inventory/shortage, production, repair, and maintenance. Under suitable conditions, we show that the value function is locally Lipschitz and satisfies an Hamilton-Jacobi-Bellman equation. A sufficient condition for optimal control is obtained. Since analytic solutions are rarely available, we design an algorithm to approximate the optimal control problem. To demonstrate the performance of the numerical method, an example is presented.Research of this author was supported by the Natural Sciences and Engineering Research Council of Canada, Grant OGP0036444.Research of this author was supported in part by the University of Georgia.Research of this author was supported in part by the National Science Foundation, Grant DMS-92-24372.