this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialis...

this paper presents a framework for long term transmission expansion planning in competitive, electricity markets. transmission lines and phase shifters are taken into account as expansion options. maximization of the network users' benefits, with satisfying security constraints are considered as the criterion for transmission expansion planning. the elements of the objective function are the...

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

A group of satellites, with either homogeneous or heterogeneous orbital characteristics and/or hardware specifications, can undertake a reconfiguration process due to variations in operations pertaining Earth observation missions. This paper investigates the problem optimizing satellite constellation against two competing mission objectives: 1) maximization total coverage reward, and 2) minimiz...

A famous travelling salesman problem, appearing simple to state but complex solve, has been widely investigated and various algorithms have proposed. In this article, mixed integer linear programming of python (MIP) is used model problem with varying input data. The result shows that small data the modelling code MIP executing quickly converging optimal value, while large scale require plenty c...

Optimization problems are not only formed into a linear programming but also nonlinear programming. In real life, often decision variables restricted on integer. Hence, came the nonlinear programming. One particular form of nonlinear programming is a convex quadratic programming which form the objective function is quadratic and convex and linear constraint functions. In this research designed ...

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