摘要：In order to enhance the utilization of single-ann cluster tools and optimize the scheduling problems of dynamic reaching wafers with residency time and continuous reentrancy constraints, a structural heuristic scheduling algorithm is presented. A nonlinear programming scheduling model is built on the basis of bounding the scheduling problem domain. A feasible path search scheduling method of single-arm robotic operations is put forward with the objective of minimal makespan. Finally, simulation experiments are designed to analyze the scheduling algorithms. Results indicate that the proposed algorithm is feasible and valid to solve the scheduling problems of multiple wafer types and single-ann clusters with the conflicts and deadlocks generated by residency time and continuous reentrancy constraints.

摘要：This work develops an optimization-based methodology for the design and scheduling of batch water recycle networks. This task requires the identification of network configuration, fresh-water usage, recycle assignments from sources to sinks, wastewater discharge, and a scheduling scheme. A new source-tank-sink representation is developed to allow for storage and dispatch tanks. The problem is solved in stages by first eliminating scheduling constraints and determining minimum usage of fresh water and wastewater discharge. An iterative procedure is formulated to minimize the total annual cost of the system by trading off capital versus operating costs. The work overcomes limitations in previous literature work including restricted recycle within the same cycle, lumped balances that may not lead to feasible solutions, and unrealistic objective functions. A case study is solved to illustrate the usefulness of the devised procedure.

摘要：A hybrid optimization approach combining a particle swarm algorithm, a genetic algorithm, and a heuristic interleaving algorithm is proposed for scheduling tasks in the multifunction phased array radar. By optimizing parameters using chaos theory, designing the dynamic inertia weight for the particle swarm algorithm as well as introducing crossover operation and mutation operation of the genetic algorithm, both the efficiency and exploration ability of the hybrid algorithm are improved. Under the frame of the intelligence algorithm, the heuristic interleaving scheduling algorithm is presented to further use the time resource of the task waiting duration. A large-scale simulation demonstrates that the proposed algorithm is more robust and efficient than existing algorithms.

摘要：Chemical batch processes have become significant in chemical manufacturing. In these processes, large numbers of chemical products are produced to satisfy human demands in daily life. Recently, economy globalization has resulted, in growing worldwide competitions in *** chemical .process industry. In order to keep competitive in the global marketplace, each company must optimize its production management and set up a reactive system for market fluctuation. scheduling is the core of production management in chemical processes. The goal of this paper is to review the recent developments in this challenging area. Classifications of batch scheduling problems and optimization methods are introduced. A comparison of six typical models is shown in a general benchmark example from the literature. Finally, challenges and applications in future research are discussed.

摘要：This paper is concerned with the optimization of the workforce scheduling for solving maintenance problems. To achieve this aim an optimsation software for (5, 7) problem was developed. The programme was written in Quick Basic. The software was designed to produce a seven day schedule for organization operating a seven day week. Hence organization operating a five day schedule wishing to change to a seven day schedule we find this software very useful. The Quick-Basic computer programme was based on Alfares [1, 2] algorithm for solving (5,7) schedule problem. Data collected from Afam power station, Nigeria was used as input data. The test result shows the software is capable of determining workforce size and assigning workers to day-off pattern. The seven-day schedule produced savings of 11% maintenance labour cost when compared with the 5-day schedule currently being practiced by the Power station [3].

摘要：In order to master the future operation and stability of power grid exactly, and gasp the weak point accurately, the requirement of power data quality become strict, and the data timeliness of power gird change into outstandingly more and more, because of this, in this paper propose the SMS notifying method of intra-day scheduling data based on safely data principle. The principle is mainly complied with the data source existed or not, the data is coincident to the power grid model, the data is unbroken or not and it is reasonable with the physical reality, then it can obtain better convergence and reasonable intra-day check power data. In order to accelerate the information and network pace of the power grid, the SMS notifying can monitoring data quality without time delay. It dredge the vast path for the future power market into use with the wide range, then, can more effective to ensure the convergence and accuracy of safe check calculation, it provides an effective guarantee with the safe and stable operation of the power grid, in the same way, it is also an efficient method to provides effective guarantee for power grid safe operation from the data source.

摘要：In the imaging observation system, imaging task scheduling is an important topic. Most scholars study the imaging task scheduling from the perspective of static priority, and only a few from the perspective of dynamic priority. However,the priority of the imaging task is dynamic in actual engineering. To supplement the research on imaging observation, this paper proposes the task priority model, dynamic scheduling strategy and Heuristic algorithm. At first, this paper analyzes the relevant theoretical basis of imaging observation, decomposes the task priority into four parts, including target priority, imaging task priority, track, telemetry & control(TT&C)requirement priority and data transmission requirement priority, summarizes the attribute factors that affect the above four types of priority in detail, and designs the corresponding priority model. Then, this paper takes the emergency tasks scheduling problem as the background, proposes the dynamic scheduling strategy and heuristic algorithm. Finally, the task priority model,dynamic scheduling strategy and heuristic algorithm are verified by experiments.

摘要：NAREGI is a 5-year Japanese National Grid Project during 2003--2007, whose chief aim is to develop a set of grid middleware to serve as a basis for future e-Science. NAREGI also aims to lead the way in standardization of grid middleware, based on the OGSA architecture. Its super-scheduler is based on the proposed OGSA-EMS Architecture, in that it becomes the first working implementation that implements the documented component relationships within the OGSA-EMS architecture document v.l.0. Through the efforts and experience in the design and implementation, it has been confirmed that the documented OGSA-EMS architecture is quite feasible, but will require significant amount of refinement and speed improvements to finalize its detailed specifications. The super-scheduler also supports co-allocation across multiple sites to support automated execution of grid-based MPIs that execute across machines. Such a resource allocation requires sophisticated interactions between the OGSA-EMS components not covered in the current OGSA-EMS architecture, some of which are non-trivial. Overall, job scheduling with OGSA-EMS has proven to not only work, but also that its job allocation and execution time is within reasonable bounds.

摘要：Owing to limited bandwidth, high bit error rate, and bursty error in the wireless environment, the performance of the transmission control protocol （TCP） degrades greatly in wireless networks. Up to now, many researchers have contributed greatly to the wireless TCP field. However, in most of their works, the wireless TCP module usually works in the TCP layer and has no idea of the actual time of the packet transmission, which is determined by the Scheduler in the media access control （MAC） layer, and this will bring the inaccuracy to the local retransmission fimeout and induce the redundant local retransmission. In this article, a coordinator is introduced into the base-station （BS）, which can provide efficient cooperation between the TCP module and the scheduler module. On the bais of the performance analysis and simulation results, the proposed method is shown to eliminate redundant local retransmission, increase throughput, and improve TCP-level fairness in wireless networks. Moreover, this scheme is orthogonal to those existing wireless TCP schemes, thus it can give great compatibility to the current networks, and further enhance the performance of TCP under the condition that the performance improvement benefiting from the existing approaches will not be affected.

摘要：Within the project preparation phase, experienced professionals manually map design information onto process information with the aim to develop realistic and practical schedules. Unfortunately, the mapping itself is neither part of any underlying data model nor is it supported by current scheduling tools. As a consequence the process of setting up the data model for a schedule is still not supported formally. Huhnt and Enge described a modelling technique that addresses the missing linkage between design and process information[1]. The approach makes use of so called component types. These are template sub-processes that describe the fabrication procedure of typical building components. Decomposing the building into com-ponents and assigning a component type to each component allows for formal support while scheduling. Depending on the decomposition of the building into components and the complexity of the involved component types the specification effort differs. The question about optimal component types arises: Which layout of building components and component types results in minimal specification effort? This paper presents a branch and bound algorithm to determine optimal component types. For a given schedule, which has been modelled based on component types, all possible decompositions into sub-processes are determined. During the decomposition process the encountered configurations are compared. Those with minimal specifica-tion effort are registered. Theoretical and practical examples are examined and discussed.