Material Requirements Planning Using Variable-Sized Bin-Packing Problem Formulation with Due Date and Grouping Constraints
نویسندگان
چکیده
منابع مشابه
On Variable-Sized Bin Packing
In variable sized bin packing, a number of bin types are given and the goal is to pack a list of items by choosing appropriate bins such that the total size of bins used is minimized. In this paper, we present absolute worst-case analysis for on-line algorithms. Then we consider an related problem: how to design k different bin sizes such that for any item list the waste space of bins used is m...
متن کاملA Stochastic Variable Size Bin Packing Problem with Time Constraints
In this paper, we extend the classical Variable Size Bin Packing Problem (VS-BPP) by adding time features to both bins and items. Specifically, the bins act as machines that process the assigned batch of items with a fixed processing time. Hence, the items are available for processing at given times and are penalized for tardiness. Within this extension we also consider a stochastic variant, wh...
متن کاملHeuristics for the variable sized bin-packing problem
The Variable Sized Bin Packing Problem has a wide range of application areas including packing, scheduling, and manufacturing. Given a list of items and variable sized bin types, the objective is to minimize the total size of the used bins. This problem is known to be NP-hard. In this article, we present two new heuristics for solving the problem using a new variation of P systems with active m...
متن کاملAlgorithms for the variable sized bin packing problem
In this paper, we consider the variable sized bin packing problem where the objective is to minimize the total cost of used bins when the cost of unit size of each bin does not increase as the bin size increases. Two greedy algorithms are described, and analyzed in three special cases: (a) the sizes of items and bins are divisible, respectively, (b) only the sizes of bins are divisible, and (c)...
متن کاملThe Bin Packing Problem with Precedence Constraints
Given a set of identical capacitated bins, a set of weighted items and a set of precedences among such items, we are interested in determining the minimum number of bins that can accommodate all items and can be ordered in such a way that all precedences are satisfied. The problem, denoted as the Bin Packing Problem with Precedence Constraints (BPP-P), has a very intriguing combinatorial struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Processes
سال: 2020
ISSN: 2227-9717
DOI: 10.3390/pr8101246