The wellknown CLSP problem is generalized including sequence dependent setup times and overtimes and modeling it as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes. We develop a heuristics based on Lagrangean relaxation and tabu search for solving the problem. At the end, some computational results are presented.

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

the product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. the assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. the first phase determ...

In this paper, we consider an Airport Gate Assignment Problem that dynamically assigns airport gates to scheduled ights based on passengers' daily origin and destination ow data. The objective of the problem is to minimize the overall connection times that passengers walk to catch their connection ights. We formulate this problem as a mixed 0-1 quadratic integer programming problem and then ref...

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

The general problem in topology optimization is correctly formulated as a doublemin mixed integer nonlinear programming (MINLP) problem based on the minimum total potential energy principle. It is proved that for linear elastic structures, the alternative iteration leads to a Knapsack problem, which is considered to be NP-hard in computer science. However, by using canonical duality theory (CDT...

In this paper a wide class of discrete optimization problems, which can be formulated as a 0-1 linear programming problem is discussed. It is assumed that the objective function costs are not precisely known. This uncertainty is modeled by specifying a finite set of fuzzy scenarios. Under every fuzzy scenario the costs are given as fuzzy intervals. Possibility theory is then applied to chose a ...

In this paper we show that the problem of minimizing a nonlinear objective function subject to a system of fuzzy relational equations with max-min composition can be reduced to a 0-1 mixed integer programming problem. The reduction method can be extended to the case of fuzzy relational equations with max-T composition as well as those with more general composition.

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