research interests have been focused on the concept of penalizing jobs both for being early and for being tardy because not only of modern competitive industrial challenges of providing a variety of products at a very low cost by smoothing productions but also of its increasing and exciting computer applications. here, sequencing approaches of the mixed- model just-in-time production systems is...

Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss dec...

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. the optimality of such optimizations is largely defined through the pareto optimality. multiple objective integer linear programs (moilp) are special cases of multiple criteria decision making problems. numerous algorithms have been desig...

One of the main challenges designing effective reverse logistic network is to predict amount product which reach end their useful life. Thus, in this study, we propose fuzzy multi-objective mixed integer linear programming (Fuzzy-MOMILP) model returned considered as an uncertain parameter. In order solve proposed multi objective mathematical model, a solution approach applied. The Fuzzy-MOMILP ...

We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...

presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...