a semi-automatic 9-row transplanter for bare root seedlings has recently been developed at the isfahan center for agricultural research that plants 80 seedlings/m2 using 9 operators at a capacity of 0.3 ha/d (8 h). separating a single seedling from a bunch and dropping it into a distributer cell by hand takes 1 s on average. at a density of 700-800 thousand/ha, the travel speed should not excee...

A variable reluctance machine (VRM) has been proven to be an outstanding candidate for electric vehicle (EV) applications. This paper introduces a new double-stator, 12/14/12-pole three-phase hybrid-excited modular variable reluctance machine (MVRM) for EV applications. In order to demonstrate the superiorities of the proposed structure, the static torque characteristics and dynamic performance...

In this paper, we focus on outsourcing activities optimization problem in single period setting. In some situations, capacity planning or outsourcing is a one-time event and can be modeled as a single period problem. The aim of this research is to balance the trade-off between two echelons of a supply chain consisting of a single outsourcer and a single subcontractor. Each part is composed of a...

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid...

The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...

In this research, we consider an application of the Bayesian Inferences in machine replacement problem. The application is concerned with the time to replace two machines producing a specific product; each machine doing a special operation on the product when there are manufacturing defects because of failures. A common practice for this kind of problem is to fit a single distribution to the co...