preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...

the pupose of this paper is modeling of partial digest problem (pdp) as a mathematical programming problem. in this paper we present a new viewpoint of pdp. we formulate the pdp as a continuous optimization problem and develope a method to solve this problem. finally we constract a linear programming model for the problem with an additional constraint. this later model can be solved by the simp...

abstract. when a production facility is designed, there are various parameters affecting the number machines such as production capacity and reliability. it is often a tedious task to optimize different objectives simultaneously. the other issue is the uncertainty in many design parameters which makes it difficult to reach a desirable solution. in this paper, we present a new mathematical model...

This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...

zinc is the first modelling language which supports solver and technique independence. this means that a high level conceptual model can be automatically mapped into an appropriate low level design model for a specific solver or technique. to date, zinc uses three different techniques to solve a model: constraint programming (cp), local search (ls), and mixed integer programming (mip). in this ...

The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...