ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Path-Repair Algorithm for Solving Scheduling Problems
Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms. Both families have their own advantages, Designing hybrid approaches seem promising since those advantages may be combined into a single approach. In this paper, we propose a new hybrid technique which performs an overall local searc...
متن کاملA Combined Algorithm for Solving Job Shop Scheduling Problems
In this paper, a combined algorithm consisting of two stages of approaches is proposed for solving a Job Shop Scheduling Problem (JSSP). The first stage of approach called Semi-active Scheduling Approach (SSA) is proposed for obtaining a local optimal solution in a short time by using the improved local search algorithm and the neighborhood search technique proposed in our earlier paper. The se...
متن کاملFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملSolving Scheduling Problems by
We deene a general methodology to deal with a large family of scheduling problems. We consider the case when some of the constraints are expressed through the minimization of a loss function. We study with more details a benchmark example consisting in some jigsaw puzzle problem with additional constraints. This is the occasion to discuss some algorithmic issues typical of scheduling problems, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Economics
سال: 2015
ISSN: 2500-3925
DOI: 10.21686/2500-3925-2015-3-238-240