Safety-Level Aware Bin-Packing Approach for Control Functions Assignment
نویسندگان
چکیده
منابع مشابه
Bin Packing
In the bin packing problem, we get a sequence of packets of size r 1 ; r 2 ; r 3 ; : : :, each r i 1, and we must place the packets into bins of size 1 using as few bins as possible. The size of a bin is the accumulated size of all packets in the bin, and the free capacity of a bin is 1 minus its size.
متن کاملStrip Packing vs. Bin Packing
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...
متن کاملA Constraint for Bin Packing
We introduce a constraint for one-dimensional bin packing. This constraint uses propagation rules incorporating knapsack-based reasoning, as well as a lower bound on the number of bins needed. We show that this constraint can significantly reduce search on bin packing problems. We also demonstrate that when coupled with a standard bin packing search strategy, our constraint can be a competitive...
متن کاملHybrid genetic approach for 1-D bin packing problem
This paper deals with the one-dimensional Bin Packing Problem (1-D BPP). Exact solution methods can only be used for very small instances, hence for real-world problems we have to focus on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to this problem, including Genetic Algorithms and Evolutionary Programming. In this paper, we propose a Hybrid Gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.06.132