Neural Network Formulation of Workload Leveling Technique in Scheduling Problems.
نویسندگان
چکیده
منابع مشابه
Competitive neural network to solve scheduling problems
Most scheduling problems have been demonstrated to be NP-complete problems. The Hop"eld neural network is commonly applied to obtain an optimal solution in various di!erent scheduling applications, such as the traveling salesman problem (TSP), a typical discrete combinatorial problem. Hop"eld neural networks, although providing rapid convergence to the solution, require extensive e!ort to deter...
متن کاملanalysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولAn Improved Augmented Neural-Network Approach for Scheduling Problems
n : Number of tasks m : Number of machines k : Current iteration T : Set of tasks = {1,..,n} M : Set of machines = {1,..,m} Tj : j task node, j ∈ T Mij : Node for machine i connected from Tj, i ∈ M, j ∈ T Lj : Level of Tj, j ∈ T (number of tasks in the remaining path till the final node) LETj : Level with estimated time of Tj, j ∈ T (processing rime of the remaining path) ωj : Weight on the lin...
متن کاملFormulation forSingle - Machine Scheduling Problems : Branch - and
In Van den Akker, Van Hoesel, and Savelsbergh 1994], we have studied a time-indexed formulation for single-machine scheduling problems and have presented a complete characterization of all facet inducing inequalities with right-hand sides 1 and 2 of the convex hull of the monotone extension of the set of feasible schedules. In this paper, we discuss the development of a branch-and-cut algorithm...
متن کاملFormulation forSingle - Machine Scheduling Problems : Column GenerationJ
Time-indexed formulations for single-machine scheduling problems have received a lot of attention, because the linear program relaxations provide strong bounds. Unfortunately, time-indexed formulations have one major disadvantage: their size. Even for relatively small instances the number of constraints and the number of variables can be large. In this paper, we discuss how Dantzig-Wolfe decomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1994
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.60.3678