We introduce a natural but seemingly yet unstudied generalization of the problem scheduling jobs on single machine so as to minimize number tardy jobs. Our lies in simultaneously considering several instances at once. In particular, we have n clients over period m days, where each client has job with its own processing time and deadline per day. goal is provide schedule for that guaranteed thei...

In this paper, we consider the scheduling problem in which the jobs are first processed on a single machine and then delivered in batches by a single vehicle with limited capacity to the respective customers located at the vertices of a star-shaped network. The goal is to minimize the makespan. We present a 3/2-approximation algorithm for the identical job size case and a 2-approximation algori...

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...

honey is a sweet and viscous liquid made by bees from nectar of flowers. the emitted smell by honey depending on flower variety can be different. these factors led to use of machine olfactory system based on metal oxide sensors(mos) in order to classify different floral origin honeys. seven samples of different floral origins of honey with a total of 70 samples from each of 10 samples were test...

In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs.  The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...

This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...