Search
CSV
RISMinimizing the total weighted late work in scheduling of identical parallel processors with communication delays
mathematical programming model and a branch-and-bound algorithm have been developed for the proposed problem. Comparing the results obtained by the proposed branch-and-bound algorithm with those obtained by CPLEX, indicates the effectiveness of the method....
Maximizing Service Level in a β-robust Job Shop Scheduling Model
>
service level, defined as probability of the makespan not exceeding the given due date. We develop
a branch-and-bound algorithm to solve the problem. Using a set of generated benchmark instances, the performance of the developed algorithm has been...
Transshipment scheduling at a single station with release date and inventory constraints
instances. Regarding the computational results, it is revealed that the simple developed heuristic algorithm is very fast and efficient. Also, the branch-and-bound algorithm outperforms the dynamic programming
algorithm....
Fortnightly course scheduling problem: a case study
model is developed for the problem and is solved using ILOG CPLEX 12.1 solver. Also, a branch-and-bound algorithm is developed to find optimal solutions in which both lecturers and students\\\\\\\\\\\\\\' preferences are considered. Regarding...
A branch-and-bound algorithm for scheduling of new product development projects
the expected net
present value. We assume that the activity payoff is obtained as soon as any single
technology is completed successfully. We formulate the problem and develop a two phase solution procedure, consisting of a branch-and-bound...
Minimizing total weighted late works in the resource-constrained project scheduling problem
is to schedule each activity such that the total weighted late works is minimized. A set of priority rules are designed to quickly generate a set of initial solutions. Also, In order to solve the problem optimally, a depth-first branch-and-bound is applied based...
An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem
. The objective is to determine a schedule with minimal total weighted resource tardiness penalty costs. For this purpose, we present a branch-and-bound algorithm in which the branching scheme starts from a graph representing a set of conjunctions (the classical...
A bridging model for branch-and-bound algorithmson multi-core architectures
By emerging the multi-core architectures, the efficient exploitation of these architectures becomes a very serious issue. The evolution of these architectures goes towards increasing the number of cores and levels of cache. ...