生态环境的规划设计

本文论述了生态环境规划设计的基本理论、以生态理论为指导,提出了营造生态环境的几种方法。     

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

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

A classification of predictive-reactive project scheduling procedures

The vast majority of the project scheduling research efforts over the past several years have concentrated on the development of workable predictive baseline schedules, assuming complete information and a static and deterministic environment. During execution, however, a project may be subject to numerous schedule disruptions. Proactive-reactive project scheduling procedures try to cope with these disruptions through the combination of a proactive scheduling procedure for generating predictive baseline schedules that are hopefully robust in that they incorporate safety time to absorb anticipated disruptions with a reactive procedure that is invoked when a schedule breakage occurs during project execution. In this paper we discuss the results obtained by a large experimental design set up to evaluate several predictive-reactive resource-constrained project scheduling procedures under the composite objective of maximizing both the schedule stability and the timely project completion probability.     

Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines

We consider the scheduling of orders in an environment with m uniform machines in parallel. Each order requests certain amounts of k different product types. Each product type can be produced by any one of the m machines. No setup is required if a machine switches over from one product type to another. Different product types intended for the same order can be produced at the same time (concurrently) on different machines. Each order is released at time zero and has a positive weight. Preemptions are allowed. The completion time of an order is the finish time of the product type that is completed last for that order. The objective is to minimize the total weighted completion time. We propose heuristics for the non-preemptive as well as the preemptive case and obtain worst case bounds that are a function of the number of machines as well as the differences in the speeds of the machines. Even though the worst-case bounds we showed for the two heuristics are not very tight, our experimental results show that they yield solutions that are very close to optimal.     

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.     

Evaluating reactivity to ecological momentary assessment during smoking cessation.

Ecological momentary assessment (EMA) consists of assessing phenomena in real time in the natural environment. EMA allows for more fine-grained analyses of addictive behavior and minimizes threats to internal validity, such as recall biases and errors. However, because of the intensive monitoring involved in EMA, measurement reactivity is a concern. To test whether EMA with palmtop personal computers induces reactivity, the authors compared smoking-related outcomes between smokers using EMA and those not using EMA during a quit attempt. The use of no-EMA control groups has been rare in reactivity investigations to date. The EMA protocol included event-contingent assessments (smoking episodes, urge episodes) and random assessments. Outcomes included biologically confirmed abstinence and self-report measures of withdrawal, self-efficacy, motivation, affect, and temptations. Participants were smokers motivated to quit (N = 96). They were randomized to 1 of 3 groups: EMA for the week preceding a planned quit date, EMA for the week following the quit date, and no EMA. Abstinence rates did not differ between the groups at Day 7 or at Day 28 postcessation. For the 20 subscales assessed at each of 3 assessment times, there were significant differences between participants with and without EMA experience for 3 subscales at the 1st of 3 assessment times, and significant differences for 3 different subscales at the 3rd assessment time. These differences suggest some reactivity to EMA, although the inconsistent pattern across time indicates that further research is needed to definitively conclude that EMA induces reactivity. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

生态公路概念浅析

通过对生态公路概念的分析,深入剖析了生态公路的内涵,总结了生态公路的特征,从宏观上科学地把握了生态公路的思想精髓,从而进行总结,为生态公路的进一步发展奠定了理论基础。     

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.     

土工格室在生态防洪工程中的应用

河北省迁安市滦河生态防洪工程是河北省重点工程建设项目，在建设中采用土工格室生态护岸工程技术，不仅大大提高了工程建设的速度和质量，而且延长了堤坝使用寿命，减少了维护成本，收到了环保、生态等方面的综合效益。     

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.