Minimizing makespan on a single machine subject to random breakdowns

We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan.     

Sequencing games without initial order

In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (Eur J Oper Res 40:344–351, 1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times.     

Electrical biosensing with synthetic nanopores and nanochannels

The integration of constriction structures such as nanopores and nanochannels into fluidic devices discloses powerful biosensing capabilities that can be tuned to a wide range of analytes through conceptually simple size calibrations. The practical implementation of this tuning requires a nontrivial manipulation of matter at nanoscale with further requirements for low complexity and low-cost procedures that may be adapted to industrial production. Here, we review the recent progress on the fabrication techniques of nanopores and nanochannels, together with the efforts to realize their full biosensing potential by understanding and amending the problems still afflicting the measurement performed during operation.     

Match statistics for sequence-based alleles in profiles from forensic PCR-mps kits

The first autosomal sequence-based allele (aka SNP-STR haplotype) frequency database for forensic massively parallel sequencing (MPS) has been published, thereby removing one of the remaining barriers to implementing MPS in casework. The database was developed using a specific set of flank trim sites. If different trim sites or different kits with different primers are used for casework, then SNP-STR haplotypes may be detected that do not have frequencies in the database. We describe a procedure to address calculation of match probabilities when casework samples are generated using an MPS kit with different trim sites than those present in the relevant population frequency database. The procedure provides a framework for comparison of any MPS kit or database combination while also accommodating comparison of MPS and CE profiles.     

肝素非还原端饱和结构的紫外吸收研究及在肝素寡糖测序中的应用

为了进一步探讨非还原端饱和结构的肝素寡糖在UV 232 nm的吸收情况, 制备了4种饱和结构的肝素二糖, 并用离子对反相液相色谱/离子阱飞行时间质谱(RPIP-LC/MS-IT-TOF)光电二极管阵列检测器分析了它们在UV 232 nm的吸收情况. 分析结果表明, 饱和结构的肝素二糖在UV 232 nm的检出限为9 μg(S/N=10), UV 232 nm/UV 206 nm约为不饱和结构肝素二糖UV 232 nm的7%~40%. 结果还表明, 肝素二糖UV 232 nm的吸收强度受亚硫酸基团(SO₃^2?)影响较大. 另外, 通过比较不饱和结构的肝素/硫酸类肝素(Hep/HS)标样二糖发现, 含N-未取代葡萄糖胺(GlcNH₃⁺)基团的二糖在UV 232 nm的吸收值较低. 最后, 通过简单的UV检测方法, 结合 HNO₂(pH=4.0)裂解法和RPIP-LC/MS-IT-TOF分析, 简化了含GlcNH₃⁺肝素六糖的测序方法. 本研究为以后用 HNO₂(pH=1.5)裂解法对混合组分N-硫酸化的肝素寡糖结构序列分析提供了可能.     

Sequencing games with repeated players

Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations. In max-RP sequencing situations it is assumed that each player’s cost function is linear with respect to the maximum completion time of his jobs, whereas in min-RP sequencing situations the cost functions are linear with respect to the minimum completion times. For both classes, following explicit procedures to go from the initial processing order to an optimal order for the coalition of all players, equal gain splitting rules are defined. It is shown that these rules lead to core elements of the associated RP sequencing games. Moreover, it is seen that min-RP sequencing games are convex. We thank two referees for their valuable suggestions for improvement. Financial support for P. Calleja has been given by the Ministerio de Educación y Ciencia and FEDER under grant SEJ2005-02443/ECON, and by the Generalitat de Catalunya through a BE grant from AGAUR and grant 2005SGR00984.     

Order sequencing on a unidirectional cyclical picking line

A real life order-picking configuration that requires multiple pickers to cyclically move around fixed locations in a single direction is considered. This configuration is not the same, but shows similarities to, unidirectional carousel systems described in literature. The problem of minimising the pickers’ travel distance to pick all orders on this system is a variant of the clustered travelling salesman problem. An integer programming (IP) formulation of this problem cannot be solved in a realistic time frame for real life instances of the problem. A relaxation of this IP formulation is proposed that can be used to determine a lower bound on an optimal solution. It is shown that the solution obtained from this relaxation can always be transformed to a feasible solution for the IP formulation that is, at most, within one pick cycle of the lower bound. The computational results and performance of the proposed methods as well as adapted order sequencing approaches for bidirectional carousel systems from literature are compared to one another by means of real life historical data instances obtained from a retail distribution centre.     

基于集值统计的模糊神经网络专家系统及其应用

建立基于集值统计的模糊神经网络专家评审系统，并应用于科研项目评审工作，实际应用表明该系统是可行的。     

基于区间AHP与粗糙集的决策系统的排序

针对决策系统中属性值以区间数形式给出的多指标决策问题,根据区间层次分析法(IAHP)与粗糙集的特点,提出了一种合理的排序方法.在保持分类能力不变的前提下,利用粗糙集理论中的知识约简方法,删除其中不相关或不重要的知识,结合区间层次分析法计算权重进行有效的排序.最后,给出算例说明了该方法的可行性和有效性.     

Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied problem is constructed.