Score estimation in the monotone single‐index model

We consider estimation in the single‐index model where the link function is monotone. For this model, a profile least‐squares estimator has been proposed to estimate the unknown link function and index. Although it is natural to propose this procedure, it is still unknown whether it produces index estimates that converge at the parametric rate. We show that this holds if we solve a score equation corresponding to this least‐squares problem. Using a Lagrangian formulation, we show how one can solve this score equation without any reparametrization. This makes it easy to solve the score equations in high dimensions. We also compare our method with the effective dimension reduction and the penalized least‐squares estimator methods, both available on CRAN as R packages, and compare with link‐free methods, where the covariates are elliptically symmetric.     

时间窗口约束下基于改进蚁群算法的协同制造调度研究

与传统调度模式不同,协同制造模式下企业之间的调度模式极其复杂。协同企业间的加工工序路线并不固定,且不同类型产品具有不同的加工路线网络。为此本文针对平衡型、瓶颈型、跳跃型、混合型四类具有典型特点的协同制造网络G_p进行分析和设计;考虑制造企业同类产品合并加工策略,构建基于连续加工量的分段生产成本函数;通过设计合理的订单最早交货时间和最晚交货时间,对订单交货进行时间窗口约束,并在此基础上构建了由制造商生产成本W_c^m、订单等待W_s^k（Q_k, T'_k）和提前完工库存成本W_s^k（Q_k, T″_k）、延期惩罚成本构成W_l^k（Q_k, T'″_k）的目标函数。为求解该模型,创新性将蒙特卡洛思想引入蚁群算法,提高蚂蚁选择合理性,避免局部最优;同时,采用移动窗口[min, max]奖励机制,并且对信息素奖励乘以平衡系数k（N）提高奖励可信度,加快搜索速度并提高求解性能。仿真结果表明,本文构建调度模型合理,可以获得优化的调度结果;同时,本文提出的蚁群改进寻优算法具有良好的求解速度和收敛性,算法具有较好的稳定性。     

供应链中物流及信息流管理

供应链管理使企业在变化的市场环境中有效地与其它企业合作,取得集体竞争优势。本文首先讨论了后勤学与供应链管理的定义和之间的关系。本文认为供应链管理的核心是物流与信息流的控制。物流控制决策主要包括操作层次的库存补充和运输路径规划,以及战略层次的设施地点规划。信息流管理跨越部门与企业的界限将相关的应用集成起来。动态联盟协调各企业内部的生产经营活动,战略性地决定物流与信息流的构形。     

面向成套订单问题的工艺规划与排序的集成研究

本文从工艺规划与排序的集成优化角度研究了成套订单问题^[1],克服了单独研究工艺规划和排序局部优化的局限性.文章中考虑了同一工件内部各道工序之间存在的优先加工限制,以及工件在不同机器上加工需要转移时间和工序间接连加工需要机器调整时间的情况,建立了成套订单问题的集成排序模型,并提出了针对求解大规模问题的基于遗传算法的启发式算法,最后通过一个算例对所研究的集成排序问题和所提出的算法进行了说明,计算结果表明了算法的有效性.     

A Probabilistic Analysis of the Capacitated Facility Location Problem

The solution value of a stochastic version of the capacitated facility location problem is studied. It is shown that, for large numbers of customers n, the value of can be closely approximated by , where the constant is identified as a function of the parameters of the underlying stochastic model. Furthermore, an extensive probabilistic analysis is performed on the difference that includes an exponential inequality on the tail distribution, a classification of the speed of convergence and a central limit theorem.     

Minimizing the Number of Late Jobs under the Group Technology Assumption

We consider the one-machine scheduling problem to minimize the number of late jobs under the group technology assumption, where jobs are classified into groups and all jobs from the same group must be processed contiguously. This problem is shown to be strongly NP-hard, even for the case of unit processing time and zero set-up time. A polynomial time algorithm is developed for the restricted version in which the jobs in each group have the same due date. However, the problem is proved to be ordinarily NP-hard if the jobs in a group have the same processing time as well as the same due date.     

Reassessing Tradeoffs Inherent to Simultaneous Maintenance and Production Planning

Previous work has considered the simultaneous (as opposed to sequential) optimization of a maintenance policy and a production policy in a multi‐product setting with random yield and product mix constraints. One of the sequential approaches to which the simultaneous approach is compared is a so‐called first‐come‐first‐served (FCFS) approach, i.e., an approach that generates randomized production policies that do not depend on the deterioration state of the machine. However, the model formulation for this approach does not generate policies consistent with this FCFS notion. Therefore, we present a revised FCFS model and analyze its performance using an existing experimental design. The results suggest that previous work overestimates the degree to which a FCFS approach is suboptimal, and underestimates the value of simultaneously optimizing the maintenance and production decisions. Lastly, we conduct additional experiments which suggest that the joint impact of using both simultaneous optimization and a deterioration dependent production policy is quite significant.     

等待时间受限的置换流水车间调度启发式算法

针对等待时间受限的置换流水车间调度问题,分析了其可行解与流水车间调度最优解的关系,给出了计算最大完工时间的有向图,证明了等待时间受限的置换流水车间调度问题的可逆性,并以此为基础提出了一种启发式算法.算法首先根据等待时间受限约束与无等待(no-wait)约束的相似特征,生成初始工件序列集;然后利用问题可逆性给出了复杂度为O(n2m)的插入优化机制,进一步优化初始解.数据实验的结果验证了启发式算法的可行性和有效性.     

人行天桥钢斜塔整体竖转提升施工技术

天津泰达人行天桥是一座单斜塔密索钢结构斜拉桥，由于施工过程中泰达大街不能断交，所以钢斜塔的安装就成为本工程的重难点，经过比选分析，采用整体竖转提升法施工，实现了施工不中断交通的目标，避免了高空作业安装，保证了安装精度和安装质量。详细介绍了钢斜塔的构造、提升设计、主要施工过程和施工方法，对今后同类工程施工有一定的借鉴意义。     

Flexible modelling of neuron firing rates across different experimental conditions: an application to neural activity in the prefrontal cortex during a discrimination task

Summary.  In many electrophysiological experiments the main objectives include estimation of the firing rate of a single neuron, as well as a comparison of its temporal evolution across different experimental conditions. To accomplish these two goals, we propose a flexible approach based on the logistic generalized additive model including condition-by-time interactions. If an interaction of this type is detected in the model, we then establish that the use of the temporal odds ratio curves is very useful in discriminating between the conditions under which the firing probability is higher. Bootstrap techniques are used for testing for interactions and constructing pointwise confidence bands for the true odds ratio curves. Finally, we apply the new methodology to assessing relationships between neural response and decision-making in movement-selective neurons in the prefrontal cortex of behaving monkeys.