نتایج جستجو برای: integer linear programming problem
تعداد نتایج: 1523879 فیلتر نتایج به سال:
Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...
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...
We present here a full multifibre optical WDM network design problem formulated as an integer linear problem. The design problem consists in laying out ducts, fibres, routes, and wavelengths, given a set of nodes, the duct and fibre prices, and the traffic demands. We compare different methods for solving the design problem. These are integer linear programming, simulated annealing, and simulat...
in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...
The minimum common string partition problem is an NP-hard combinatorial optimization problem with applications in computational biology. In this work we propose the first integer linear programming model for solving this problem. Moreover, on the basis of the integer linear programming model we develop a deterministic 2-phase heuristic which is applicable to larger problem instances. The result...
This paper is about a computer application for planning maintenance of aircraft fleet in what regards allocation skilled technicians. The formalization this mathematical programming problem written as minimizing one. decision variables are the data number available technicians, working hours needed to accomplish maintenance, costs due daily operation facilities, and downtime. Although, non-line...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید