A Branch and Bound Approach to Solve the Preemptive Resource Leveling Problem
نویسندگان
چکیده
منابع مشابه
Using Hopfield to Solve Resource-Leveling Problem
Although the traditional permute matrix coming along with Hopfield is able to describe many common problems, it seems to have limitation in solving more complicated problem with more constrains, like resource leveling which is actually a NP problem. This paper tries to find a better solution for it by using neural network. In order to give the neural network description of resource leveling pro...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملA branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
The linear ordering problem consists in finding a linear order at minimum remoteness from a weighted tournament T, the remoteness being the sum of the weights of the arcs that we must reverse in T to transform it into a linear order. This problem, also known as the search of a median order, or of a maximum acyclic subdigraph, or of a maximum consistent set, or of a minimum feedback arc set, is ...
متن کاملa frame semantic approach to the study of translating cultural scripts in salingers franny and zooey
the frame semantic theory is a nascent approach in the area of translation studies which goes beyond the linguistic barriers and helps us to incorporate cognitive and cultural factors to the study of translation. based on rojos analytical model (2002b), which centered in the frames or knowledge structures activated in the text, the present research explores the various translation problems that...
15 صفحه اولAn Effective Branch-and-Bound Algorithm to Solve the k-Longest Common Subsequence Problem
In this paper, we study the Longest Common Subsequence problem of multiple sequences. Because the problem is NPhard, we devise an effective Branch-and-Bound algorithm to solve the problem. Results of extensive computational experiments show our method to be effective not only on randomly generated benchmark instances, but also on real-world protein sequence instances.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Manufacturing Engineering
سال: 2013
ISSN: 2314-5781
DOI: 10.1155/2013/930920