A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems
Texte intégral
Figure
Documents relatifs
Using these variants, we explore different forms to improve the lower bounds and to update the initial set of binary variables. The various performances of the described
A set of tasks A = {1,. , n}, consuming a continuous, cumulative and renewable resource of capacity B, has to be scheduled. We suppose there is no precedence constraints between
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
The contributions made in this study are follows: we model the deterministic OT scheduling problem, integrating allocation and sequencing decisions in the same model; we
An iterative algorithm has been proposed to compute the so- lution of separable convex optimization problems with linear and box constraints.. It is particularly interesting since
We observe that, in terms of number of (not necessarily optimal) integer solutions found, the OOE model or its variant OOE Prec outperform the other formulations on instance sets
However, for hard instances with a considerable number of disjunctions, such as the instances with 10 tasks and 3 machines, the execution times of the MILP rocket up and it is
The resolution scheme proposed is based on two main ideas: (i) the piece-wise bounding of the nonlinear energy efficiency function, then (ii) the reformulation of the problem,