Mohamed Ali Aloulou

Learn More
We consider the single machine scheduling problem with dynamic job arrival and total weighted tardiness and makespan as objective functions. The machine is subject to disruptions related to late raw material arrival and machine breakdowns. We propose a proactive-reactive approach to deal with possible perturbations. In the proactive phase, instead of(More)
In combinatorial optimization, and particularly in location problems, the most used robustness criteria rely either on maximal cost or on maximal regret. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called lexicographic α-robustness, which compensates for the drawbacks of the(More)
We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called(More)
We propose a predictive-reactive approach for the single machine problem. It constructs a set of schedules following a partial order and, every time a decision should be taken, uses the temporal flexibility and the flexibility in job sequencing introduced to provide the decision-maker a set of alternatives, compatible with the modeled constraints.
In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in non-preemptive disjunctive scheduling. A flexible solution represents a set of semi-active schedules and is characterized by a partial order on each machine. A flexible solution can be used on-line to absorb the impact of some data disturbances related(More)
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work is to provide the decision-maker a characterization of possible modifications of the predictive schedule while preserving optimality. In the context of machine scheduling, the(More)