نتایج جستجو برای: sd heuristics method

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

Journal: :ژورنال بین المللی پژوهش عملیاتی 0
e. mehdizadeh a. a. atashi –abkenar

aggregate production planning (app) is one of the most important issues carried out in manufacturing environments which seeks efficient planning, scheduling and coordination of all production activities that optimizes the company's objectives. in this paper, we develop a mixed integer linear programming (milp) model for an integrated aggregate production planning system with closed loop su...

Journal: :journal of optimization in industrial engineering 2014
esmaeil mehdizadeh amir fatehi kivi

this paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. the returned products from customers can either be disposed or be remanufactured to be sold as new ones again. due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (sa) al...

2003
Gerth Stølting Brodal Rolf Fagerberg Thomas Mailund Christian N. S. Pedersen Derek Phillips

A widely used method for constructing phylogenetic trees is the neighbour-joining method of Saitou and Nei. We develope heuristics for speeding up the neighbour-joining method which generate the same phylogenetic trees as the original method. All heuristics are based on using a quad-tree to guide the search for the next pair of nodes to join, but differ in the information stored in quad-tree no...

Journal: :International Journal of Interactive Multimedia and Artificial Intelligence 2017

2011
Konstantin Korovin Nestan Tsiskaridze Andrei Voronkov

The conflict resolution method, introduced by the authors in [1] is a new method for solving systems of linear inequalities over the rational and real numbers. This paper investigates various heuristics for optimisation of the method and presents experimental evaluation. The method and heuristics are evaluated against various benchmarks and compared to other methods, such as the FourierMotzkin ...

1995
Robert Cimikowski

We analyze several heuristics for nding a maximum planar subgraph of a nonplanar graph. The problem is NP-hard, although heuristics which perform well in practice have been reported. In particular, we compare the two principle methods, based on path addition and vertex addition, respectively , with an incremental method, a \cycle packing" approach, and a branch-and-cut algorithm. For the incre-...

Journal: :Psychological review 2017
Roger Ratcliff Gail McKoon

Models of the representation of numerosity information used in discrimination tasks are integrated with a diffusion decision model. The representation models assume distributions of numerosity either with means and SD that increase linearly with numerosity or with means that increase logarithmically with constant SD. The models produce coefficients that are applied to differences between two nu...

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

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