The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization

A cook has to prepare n cakes using an oven with two racks. According to the recipe, the i-th cake has to be baked for exactly a _i minutes. Cakes to be cooked are taken from a table and carried to the oven, and once cooked are carried back to the table by means of a trolley that can carry two cakes at a time. What is the minimum number q ^* of round trips required of the cook? This problem has application to the operation scheduling of transportation systems and to material cutting. A different problem arises according to whether the cook accepts or not to stay near the oven for awhile with the trolley. If the trolley cannot be idle at the oven, an optimum schedule with no oven idle-time always exists: consequently, the trolley schedule is trivial, and the problem is transformed into a set packing. For this case, we propose and test a heuristic method which generates all of the promising columns of the set packing, and solves the resulting problem by branch-and-bound. Instead, if the trolley can be idle at the oven for a limited amount of time, a problem arises to find an optimal schedule of the trolley: in this case we show how to use a scaling technique in order to obtain a very good feasible solution by the method above.     

加氢裂化工艺辅助操作与管理专家系统的开发与应用

近来，专家系统技术的利用已成火炼油与石油化工专家们感兴趣的问题。本文评述了国外这些领域中专家系统应用的进展概况。同时，对我们开发的专家系统工具ＦＥＸＳ的性能作了简介。详述了工业加氢裂化装置辅助操作与管理专家系统的研制过程和系统配置，讨论了系统开发的经验。最后，评价了该技术在炼油与石油化工业中的应用前景。     

天生桥梯级水电站联合调度决策支持系统建设经验

决策支持系统是水库优化调度实用化的发展方向，对于提高水电站生产效益和水库调度管理水平具有重要意义。结合国电公司重点科技项目“天生桥梯级水电站联合调度决策支持系统”的开发，阐述了开发水电调度决策支持系统实现水库调度实用化的经验:正确反映用户需求、增强用户对系统的控制、用模拟仿真弥补优化调度的不足、用数据库技术扩展水库优化调度实用化功能。     

Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.     

Integration of batching and scheduling for hot rolling production in the steel industry

This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic has been developed and tested on instances collected from practical production data. The experimental results show that the proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional serial method.     

武钢 3×10~4m~3/h 空分手动变负荷生产的探索与实践

对武钢引进的两台３×１０４ｍ３／ｈ空分设备，为改变其自动变负荷生产调节范围小、时间长的问题，采用了人工手动变负荷的操作方法。实践表明：扩大了增减产范围，缩短了调节时间，有十分明显的综合经济效益，可供大型空分变负荷生产借鉴参考。     

Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy

This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times.     

Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times

In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems.     

前向人工神经网络模型用于时间序列分析

介绍前向人工神经网络模型，并与传统的统计学线性模型进行比较。为了适应时间序列变量的特点，对逆传播模型进行了改进，并对太阳黑子活动的观察值这一典型的时间序列进行了分析，并检验了模型的预测能力，取得了较好的结果     

Oracle 9i Data Guard技术在水调自动化系统中的应用与实施

水调自动化系统是电网运行的重要生产系统,该系统对数据库备份、数据完整性、实时性和并发访问能力等都提出了较高的要求,如何科学地应用商用数据库提供的高级功能构建稳定、可靠、高效的水调自动化系统,成为一个新课题.文中针对该问题,分析比较了多种常见的高可用数据库方案,最终选择应用Oracle Data Guard技术,构建高性能、高可用、低成本、易维护的水调自动化系统.