نتایج جستجو برای: hard problems in class

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

1997
Nevin Heintze David A. McAllester

We prove that certain data-flow and control-flow problems are 2NPDA-complete. This means that these problems are in the class 2NPDA and that they are hard for that class. The fact that they are in 2NPDA demonstrates the richness of the class. The fact that they are hard for 2NPDA can be interpreted as evidence they can not be solved in sub-cubic time — the cubic time decision procedure for an a...

Journal: :journal of industrial engineering, international 2006
r tavakkoli-moghaddam n safaei

this paper presents a genetic algorithm (ga) for solving a generalized model of single-item resource-constrained aggregate production planning (app) with linear cost functions. app belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. we linearize a linear mixed-integer model of app subject to hiring...

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

we have devided the thesis in to five chapters. the first recollects facts from purely algebraic theory of jordan algebras and also basic properties of jb and jb* - algebras which are needed in the sequel. in the second chapter we extend to jb* - algebras, a classical result due to cleveland [8]. this result shows shows the weakness of jb* - norm topology on a jb* - algebera. in chapter three, ...

Journal: :journal of optimization in industrial engineering 2010
parviz fattahi mohammad saidi mehrabad

in this paper, a new approach to overlapping operations in job shop scheduling is presented. in many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. in each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...

Journal: :Discrete Applied Mathematics 2004

2000
Jack H. Lutz Vikram Mhetre Sridhar Srinivasan

This paper investigates the instance complexities of problems that are hard or weakly hard for exponential time under polynomial time many one reductions It is shown that almost every instance of almost every problem in exponential time has essentially maximal instance complexity It follows that every weakly hard problem has a dense set of such maximally hard instances This extends the theorem ...

Journal: :international journal of supply and operations management 2015
abolfazl kazemi vahid khezrian mahsa oroojeni mohammad javad alireza alinezhad

in this study, a bi-objective model for integrated planning of production-distribution in a multi-level supply chain network with multiple product types and multi time periods is presented. the supply chain network including manufacturers, distribution centers, retailers and final customers is proposed. the proposed model minimizes the total supply chain costs and transforming time of products ...

Kazem Abhary Romeo Marian Son Duy Dao

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

Journal: :مدیریت صنعتی 0
حسین صفری دانشیار، مدیریت صنعتی، دانشکدۀ مدیریت دانشگاه تهران، تهران، ایران علیرضا فقیه دانشجوی دکتری مدیریت گرایش تحقیق در عملیات، دانشکدۀ مدیریت، دانشگاه تهران، تهران، ایران

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

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

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