despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...

Bi-level programming has been used widely to model interactions between hierarchical decision-making problems, and their solution is challenging, especially when the lower-level problem contains discrete decisions. The of such mixed-integer linear bi-level problems typically need decomposition, approximation or heuristic-based strategies which either require high computational effort cannot gua...

In this paper we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them us...

A standard trick in integer programming is to replace each bounded integer-constrained variable with a small number of binary variables, using the bit representation of the given variable. We show that, in the case of mixed-integer quadratic programs (MIQPs), this process can enable one to obtain stronger linear programming relaxations. Moreover, we give a simple sufficient condition under whic...

the selection of best information system (is) project from many competing proposals is a critical business activity which is very helpful to all organizations. while previous is project selection methods are useful but have restricted application because they handle only cases with precise data. indeed, these methods are based on precise data with less emphasis on imprecise data. this paper pro...