resource allocation and optimal leveling are among the top challenges in project management. this paper presents a dea-based procedure for determining an optimal level of inputs to produce a fixed level of outputs. to achieve this goal, we assume that the levels of outputs can be forecasted in the next season and the procedure will determine optimal level of inputs for all dmus. such as some of...

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

We present a technique to solve the linear integer model with variable bounding. By using continuous optimal solution of model, bounds for basic variables are approximated and then used calculate solution. With known, solving is easier by either branch bound, cut, price, cut or free algorithms. Thus, search large numbers subproblems, which unnecessary common NP Complete models, avoided.

In the past, most threshold models considered a single variable. However, for some practical applications, with two variables may be needed. this paper, we propose two-threshold-variable integer-valued autoregressive model based on binomial thinning operator and discuss of its basic properties, including mean, variance, strict stationarity, ergodicity. We consider conditional least squares (CLS...

We show that a 2-variable integer program de ned by m constraints involving coe cients with at most s bits can be solved with O(m+s logm) arithmetic operations or with O(m+logm log s)M(s) bit operations, where M(s) is the time needed for s-bit integer multiplication.

We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objective function. Our algorithm has worst-case running time in O(N) where N is the number of bits in the input.