the problem of scheduling with multi agent has been studiedfor more than one decade and significant advances have been madeover the years. however, most work has paid more attention to the conditionthat machines are available during planning horizon. motivatedby the observations, this paper studies a two-agent scheduling modelwith multiple availability constraint. each agent aims at minimizing ...

purpose: neuromyelitis opitca (nmo) is an autoimmune disease that relates to deposition of anti-aquaporin-4 (aqp4) igg in the central nervous system (cns). however, called seronegative nmo when patients are negative for aqp4 antibody. nevertheless, nmo is most probably an antibody mediated disease. the aim of this study was to assess the association between seronegative nmo disease and variatio...

alignment is presented. The proposed “homopolymer-length-filter” replaces homopolymers with single characters in both the reads and the reference. In some sequencing technologies, this filter removes many of the machine-induced sequencing errors, but still allows the filtered read to be aligned to the filtered reference. In some sequencing and alignment technologies, this filter can increase th...

The discrete lotsizing and scheduling problem for one machine with sequence dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is analyzed. The batch sequencing problem is solved with a branch & bound algorithm which is accelerated by b...

We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity re...