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...

In this paper, we address a variant of the vehicle routing problem called the vehicle routing problem with time windows and multiple routes. It considers that a given vehicle can be assigned to more than one route per planning period. We propose a new exact algorithm for this problem. Our...

The paper presents and discusses a structure and components of a distributed decision-making system for complex discrete systems and processes control. The decision-making nucleus of the system--system dynamics Builder (SD Builder)--is described. The SD Builder is based on a hierarchical...

Manufacturing execution system (MES) provides a common and single system to support most manufacturing processes. However, MES applications do not address all of the manufacturing execution processes required to replenish the supply chain while dynamically responding to unpredicted change and...