Solving a Permutation Flow Shop Problem with Blocking and Transportation Delays

More precisely, at each node of the search tree, we solve a robust Basic Cyclic Scheduling Problem (BCSP), which corresponds to the CJSP without resource constraints, using a

As the left branch associated to each variable corresponds to the value assigned to this variable in the previous best solution, the selection rules determine the neighborhood of

For each instance, we give the best found lower (LB1) and upper (UB1) bounds, the total number of branch and bound nodes (#nodes), the total CPU time in seconds (CPU), the initial

In this paper we propose two tools to improve the performance of the NEH-based heuristics: the use of the reversibility property of problems considered and a new tie- breaking

Table 4 reports the size of the critical tree for five branching rules (two static rules Forward, Alternate, and three dynamic strategies MaxSum, MinMin and MinBranch) and two

It takes as input a problem, the variable heuristic, value heuristic, best solution found thus far, the maximum objective value allowed, and a time limit (t2 for dichotomic

A dynamic energy aware job shop scheduling model is studied which seeks a trade-off among the total tardiness, the energy cost and the disruption to the original schedule;.. A

The idea used in the second approach (node based) to accelerate the bounding on GPU using several threads organized in one GPU block gave good results (18 times faster) compared to