Preventive maintenance is the essential part of many maintenance plans. From the production point of view, the flexibility of the maintenance intervals enhances the manufacturing efficiency. On the contrary, the maintenance departments tend to know the timing of the long term maintenance plans as certain as possible. In a single-machine production environment, this paper proposes a simulation–o...

This paper considers the problem of sequencing the processing of incoming mail in a Processing and Distribution Center (P&DC) to match a given outbound truck delivery schedule. Mail arrives at a P&DC from local Associate Offices (AO) or remote P&DCs following an incoming schedule. The mail from an origin has different proportions to different destinations. For each destination, there are trucks...

Classification tree is a widely used machine learning method. It has multiple implementations as R packages; rpart, ctree, evtree, and C5.0. The details of these are not the same, hence their performances differ from one application to another. We interested in performance classification cells using single-cell RNA-Sequencing data. In this paper, we conducted benchmark study 22 Single-Cell RNA-...

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

Large scale DNA sequencing projects require gel readers with high throughput and good base-calling accuracy with as little manual intervention as possible. The automatic sequencing machines now available meet these requirements quite well, indeed, a single ABI 373A machine can read at least around 500 samples/200 000 nt per week. Thus, a full-time sequencing laboratory will need to produce thou...

The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for neig...

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...

This article surveys research on the single surface mount device (SMD) placement machine optimisation problem. We classify the optimisation problem into five sub-problems: feeder setup, component placement sequencing, nozzle optimisation, component retrieval plan and motion control; and analyse issues relevant to each of these. One of the aims of this article is to provide guidance to other res...