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

in a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. in this paper, we consider...

‎a full nesterov-todd (nt) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using euclidean jordan algebra‎. ‎two types of‎ ‎full nt-steps are used‎, ‎feasibility steps and centering steps‎. ‎the‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

in this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. utilizing the generalized characterization theorem. then a novel hybrid method based on learning algorithm of fuzzy neural network for the solution of differential equation with fuzzy initial value is presented. here neural network is considered as a part of large eld called n...

an important section of range-doppler imaging algorithm in sar systems which needs large number of resources, memories and solution time, is fft on the azimuth dimension. in this paper, by decomposing the fft relation, and converting to smaller dimension ffts, implementation has been simplified. the proposed method, based on removing the extra phase factors reduces the resources, memories and s...

This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...

An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...

In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...