U型钢板桩施工的滑坡动态勘察技术及数值模拟

为节省边(滑)坡灾害的应急加固时间,提高边(滑)坡处置的效率和质量,针对边(滑)坡在勘察阶段提出了基于U型钢板桩施工的动态勘察技术,即在静压植桩机压入U型钢板桩的同时,利用与其配套的压入管理系统设备与软件对压桩数据进行监测和分析,从而反馈出地层强度等信息。数值模拟中,为了能利用工程中所得压桩阻力图谱来反推地层信息,归纳总结了不同土体在桩压入时的应力云图和压桩阻力规律。结果表明:压桩阻力规律与地层信息之间存在对应关系,据此可判断地层强度特征等信息,数值模拟也为后续的现场试验研究提供了依据。     

Efficient algorithms for flexible job shop scheduling with parallel machines

Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 .     

Complexity and workload considerations in product mix decisions under the theory of constraints

The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015     

高校辅导员职业倦怠成因及干预策略

高校辅导员是开展大学生思想政治工作的骨干力量,是大学生思想政治教育和管理工作的组织者、实施者和指导者,其多重角色决定了辅导员工作的复杂性和艰巨性。多数调查表明,高校辅导员工作劳累导致成就感甚微,多数辅导员在工作中出现职业倦怠。本文结合辅导员的工作职责和工作环境,对高校辅导员职业倦怠成因及干预策略进行探讨。     

Scheduling recurrent construction

A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Sojourn times in a two‐stage queueing network with blocking

The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于能力的装备型号体系结构开发方法

为适应装备型号需求生成的复杂性,必须开发面向作战能力应用的装备型号体系结构模型。按照装备型号需求生成工程化思想,建立了结构化的装备型号体系结构开发流程,并对每个环节进行了系统分析。装备型号作战体系结构和系统体系结构开发流程都划分为8个环节,为作战活动分析、系统功能分析提供了可追溯、可验证的模块化开发模式。装备型号体系结构关联开发流程分为4个环节,实现了作战能力对系统实体的关联关系,确保了系统需求对作战需求的支持,提高了装备型号需求成果的系统性和正确性。     

重庆保障性住房套型特点与优化设计

保障性住房建设是我国当前重要的民生问题,其中套型设计是保障性住房建设的主要内容。作为代表模式,研究重庆保障性住房套型特点和优化措施对提升我国保障性住房设计质量具有一定的借鉴和示范意义。在分析影响重庆保障性住房设计的国家宏观住房政策、规范与标准等相关因素的基础上,以重庆保障性住房典型开发项目为案例,着重论述重庆保障性住房套型的平面布局、类型与面积标准、功能构成与空间尺度的主要特点与不足,并从合理确定得房率、空间复合、精细化设计和节能技术推行等4个方面提出优化重庆保障性住房套型紧凑性、灵活性、舒适性和节能性的理念与方法。     

“X个X”型军事缩略语名称研究

缩略型用语在越来越多的情况下被采用。其形式多样,运用灵活,较好地满足了军事语言中管理、宣讲、文秘、研究等语体紧缩、精练的要求。伴随着这一语用形式的不断拓展,规范化使用已成为急需解决的一个重要问题。为此,应深入分析“×个×”型军事缩略名称的特点,总结归纳其主要类型,准确把握缩略语在运用时应注意的问题。