نتایج جستجو برای: objective cell formation problem

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

2003
Shinya Watanabe Tomoyuki Hiroyasu Mitsunori Miki

1 Graduate Student, Department of Knowledge Engineering and Computer Sciences, Doshisha University ,1-3 Tatara Miyakodani,Kyo-tanabe, Kyoto, 610-0321, JAPAN [email protected] http://mikilab.doshisha.ac.jp/~sin/ 2 Department of Knowledge Engineering and Computer Sciences, Doshisha University ,1-3 Tatara Miyakodani,Kyo-tanabe, Kyoto, 610-0321, JAPAN [email protected],[email protected]...

2018
Doruk Oner Altuug Karakurt Atilla Eryilmaz Cem Tekin

In this paper, we introduce the COmbinatorial Multi-Objective Multi-Armed Bandit (COMOMAB) problem that captures the challenges of combinatorial and multi-objective online learning simultaneously. In this setting, the goal of the learner is to choose an action at each time, whose reward vector is a linear combination of the reward vectors of the arms in the action, to learn the set of super Par...

Journal: :Optimization Letters 2017
Alexander Dolgui Mikhail Y. Kovalyov Alain Quilliot

We study a 0-1 knapsack problem, in which the objective value is forbidden to take some values. We call gaps related forbidden intervals. The problem is NP-hard and pseudopolynomially solvable independently on the measure of gaps. If the gaps are large, then the problem is polynomially non-approximable. A non-trivial special case with respect to the approximate solution appears when the gaps ar...

2007
Andrey Ghulchak

In this paper, we approach a multi-objectiveH problem with several H constraints from the Banach duality point of view. The problem is reduced to an abstract norm minimization problem, and the dual problem is derived using the classical Banach result. It completes the primal-dual pair which can be used to solve the problem numerically by finitedimensional approximations. While the approximation...

Objective(s):Various methods for repairing bone defects are presented. Cell therapy is one of these methods. Bone marrow stromal cells (BMSCs) seem to be suitable for this purpose. On the other hand, lots of biomaterials are used to improve and repair the defect in the body, so in this study we tried to produce a similar structure to the bone by the chitosan and hydroxyapatite. Materials and Me...

Journal: Nanomedicine Journal 2016

Objective(s): For the development of reliable, ecofriendly, less expensive process for the synthesis of silver nanoparticles and to evaluate the bactericidal, and cytotoxicity properties of silver nanoparticles synthesized from root extract of Croton bonplandianum, Baill. Materials and Methods: The synthesis of silver nanoparticles by plant part of Croton bonplandianum was carried out.  The for...

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

2000
Richard A. Watson

1 Sub-Problems and Objectives Divide and conquer techniques in problem solving are familiar and intuitive; first find the solution to sub-problems and then re-use these to find solutions to the whole problem. For example, we may decompose the problem of designing a vehicle into designing the engine and designing the body. It is acknowledged that most real-world problems (vehicles included) do n...

2014
Aldy Gunawan Hoong Chuin Lau

Physician scheduling is the assignment of physicians to perform different duties in the hospital timetable. In this paper, the goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We present a mathematical programming model to represent the problem as a bi-objective optimization problem. Three different metho...

Journal: :Expert Syst. Appl. 2015
Manoj Agarwal Nitin Agrawal Shikhar Sharma Lovekesh Vig Naveen Kumar

Consider a system with M robots each having K resource types and N tasks having a vector of Kresource types. A coalition scheme represents a grouping of a given set of robots into disjoint subsets where each subset (coalition ) is assigned one task. Thus for N tasks we have N coalition schemes, represented as CS = {C1, C2,,....CN}, In this problem we have considered the following two conflictin...

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

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