We propose a decomposition algorithm for a special class of nonconvex mixed integer nonlinear programming problems which have an assignment constraint. If the assignment decisions are decoupled from the remaining constraints of the optimization problem, we propose to use a column enumeration approach. The master problem is a partitioning problem whose objective function coefficients are compute...

ABSTRACT A new method called variable reduction method for a classes of pure integer linear programming problems in single stage, is introduced which is better than the cutting plane method and the branch bound method. Both easy to understand and to apply, the variable reduction method can serve as an effective tool for solving integer linear programming problems while making the method accessi...

resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...

A rescheduling algorithm for trains on a single-track railway was developed in case of disturbances that would cause conflicts between trains. This is based mixed integer linear programming (MILP) with speed-up routines. The model considers station capacities explicitly (i.e., the number available tracks meeting and overtaking operations). Because too hard solvers (CPLEX this study) to tackle, ...

    Dynamic cellular manufacturing systems,   Mixed-integer non-linear programming,   Production planning, Manufacturing attributes   This paper presents a novel mixed-integer non-linear programming model for the design of a dynamic cellular manufacturing system (DCMS) based on production planning (PP) decisions and several manufacturing attributes. Such an integrated DCMS model with an extensi...