Johnson's algorithm (JA) is perhaps the most classical algorithm in the scheduling area. JA gives the optimal solution to the two machine flow shop to minimize the makespan in polynomial time. Researchers have tried to extend this notorious result to obtain polynomial time algorithms for more...

An iterative scheme which is based on a dynamic fixation of the variables is developed to solve the 0-1 multidimensional knapsack problem. Such a scheme has the advantage of generating memory information, which is used on the one hand to choose the variables to fix either permanently or...

In this paper, we propose an oscillation strategy heuristic combined with mathematical programming for disruption management in the airline industry (DMAI). The goal of this problem is to resume normal operations as quickly as possible during the recovery period while minimising the resulting...