نتایج جستجو برای: several problem instances are generated and solved

تعداد نتایج: 17099225  

In this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. Single supplier via a flexible flow line production system (FFL), produces several items and delivers them directly to an assembly facility. Based on basic period (BP) strategy, a new mixed zero-one nonlinear programming model has been develop...

Bahman Naderi Esmaeil Najafi Mehdi Yazdani

This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic base...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شاهد - دانشکده فنی و مهندسی 1387

abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - پژوهشکده علوم 1388

heteropoly acids (hpa) and their salts have advantages as catalysts which make them both economically and environmentally attractive, strong br?nsted acidity, exhibiting fast reversible multi-electron redox transformations under rather mild conditions, very high solubility in polar solvents, fairly high thermal stability in the solid states, and efficient oxidizing ability, so that they are imp...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان 1390

section{introduction} the concept of {sl cartan geometry} appeared at the beginning of the twentieth century, when {e}lie cartan was working on the so-called {sl equivalence problem}, the aim of which is to determine whether two given geometric structures can be mapped bijectively onto each other by some diffeomorphism. this problem can be considered in many different contexts, such as ...

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده فنی 1393

a problem of computer vision applications is to detect regions of interest under dif- ferent imaging conditions. the state-of-the-art maximally stable extremal regions (mser) detects affine covariant regions by applying all possible thresholds on the input image, and through three main steps including: 1) making a component tree of extremal regions’ evolution (enumeration), 2) obtaining region ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اراک - دانشکده علوم 1392

the history of plant’s used for mankind is as old as the start of humankind. initially, people used plants for their nutritional proposes but after the discovery of medicinal properties, this natural ?ora became a useful source of disease cure and health improvement across various human communities. berberis vulgaris is one of the medicinal plants used in iranian traditional medicine. berberis ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه ولی عصر (عج) - رفسنجان - دانشکده ریاضی 1392

let h be a separable hilbert space and let b be the set of bessel sequences in h. by using several interesting results in operator theory we study some topological properties of frames and riesz bases by constructing a banach space structure on b. the convergence of a sequence of elements in b is de_ned and we determine whether important properties of the sequence is preserved under the con...

N Salmasi

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید