In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...

yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in...

presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...

we present an improved version of a full nesterov-todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (bull. iranian math. soc.,40(3), 541-564, (2014)). in the earlier version, each iteration consistedof one so-called feasibility step and a few -at most three -centering steps. here, each iteration consists of only a feasibilitystep. thus, the new alg...

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...

We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...

In this paper an efficient Algorithm based on Zadeh's extension principle has been investigated to approximate fuzzy solution of two-point fuzzy boundary value problems, with fuzzy boundary values. We use finite difference method in term of the upper bound and lower bound of $r$- level of fuzzy boundary values. The proposed approach gives a linear system with crisp tridiagonal coefficients matr...