We present a Mixed Integer Linear Programming (MILP) approach in order to model the non-linear problem of minimizing tire noise function. In recent work, we proposed an exact solution for Tire Noise Optimization Problem, dealing with APproximation (TNOP-AP). Here study original modeling EXact- or real-noise (TNOP-EX) and propose new scheme obtain TNOP-EX. Relying on TNOP-AP, use Branch&Cut ...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

Mixed-integer conic programming is a generalization of mixed-integer linear programming. In this paper, we present an extension of the duality theory for mixed-integer linear programming (see [4], [11]) to the case of mixed-integer conic programming. In particular, we construct a subadditive dual for mixed-integer conic programming problems. Under a simple condition on the primal problem, we ar...

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

This paper discussed the scheduling problem of outpatients in a radiology center with an emphasis on priority. To more compatibility to real-world conditions, we assume that the elapsed times in different stages to be uncertain that follow from the specific distribution function. The objective is to minimize outpatients’ total spent time in a radiology center. The problem is formulated as a fle...

in this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. the constraints are the warehouse capacity and the batch forms of the order placements. the first objective of this problem is to find the order quantities such that the expected ...

this paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. first, the problem is formulated as a mixed integer linear programming model. then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. two experiments are carried out to evaluate th...