نتایج جستجو برای: among various heuristics techniques

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

Journal: :International Journal of Security and Its Applications 2016

2003
Suwan Runggeratigul

The 0-1 knapsack problem (KP) is widely studied in the last few decades. Despite of their simple structures, KP along with its extended versions belong to the class of NP-hard problems, and several optimization techniques have been developed to solve the problems. Some major examples are branch and bound methods and dynamic programming approaches [6], problemspecific heuristics [6], tabu search...

1994
Guoning Liao Erik R. Altman Vinod K. Agarwal Guang R. Gao

This paper presents a quantitative comparison of a collection of DSP multiprocessor list scheduling heuristics which consider inter-processor communication delays. The following aspects have been addressed: (1) performance in terms of the total execution time (makespan), (2) sensitivity of heuristics in terms of the characteristics of acyclic precedence graphs, including graph size and graph pa...

Journal: :CoRR 2000
Steffen Hölldobler Hans-Peter Störr

The paper reports on first preliminary results and insights gained in a project aiming at implementing the fluent calculus using methods and techniques based on binary decision diagrams. After reporting on an initial experiment showing promising results we discuss our findings concerning various techniques and heuristics used to speed up the reasoning process.

and M. A. Beheshti Nia, I. Nakhaee, M.R. Amin Naseri,

In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...

and M. A. Beheshti Nia, I. Nakhaee, M.R. Amin Naseri,

In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...

2006
Winfried Koeniger Marco Leonardi IZA Bonn

Capital Deepening and Wage Differentials: Germany vs. US Capital deepening may affect the evolution of the wage differential between skilled and unskilled workers differently in countries with different labor market institutions. If labor market institutions raise the relative wage of unskilled workers in Germany, firms have incentives to invest relatively more into capital equipment complement...

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

cultural iran is a scope that is more extended than the political territories of iran as a political unit. this concept means that cultural geography(mehdi moghanlo-1383-1) of iran is greater than its political geography which, according to history, has a long history extending west-east from kandahar to the euphrates and north-south from the persian gulf to the caucasus including transoxiana a...

Journal: :نشریه دانشکده فنی 0
رضا برادران کاظم زاده سیدحسام الدین ذگردی محمدعلی بهشتی نیا

this study considers scheduling in hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. this problem does not study in the literature, so far. flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. after mode...

1999
Saud Ahmed Aldarmi Alan Burns

Scheduling decisions in time-critical systems are very difficult, due to the vast number of systems’ parameters and tasks’ attributes involved in such decisions. Due to the intractability of the problem, time-critical systems often have to resort to heuristic techniques. Value-based scheduling heuristics have been found in the literature to experience a more graceful degradation under overload ...

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

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