flow shop sequencing problem is included in np-hard problems and a number of heuristic methods have been developed to solve it. most of these methods are offered for the crisp processing time. however fuzzy algorithm is appropriate for the problems with fuzzy processing time. this paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...

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

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

gravitational search algorithm (gsa) is one of the newest swarm based optimization algorithms, which has been inspired by the newtonian laws of gravity and motion. gsa has empirically shown to be an efficient and robust stochastic search algorithm. since introducing gsa a convergence analysis of this algorithm has not yet been developed. this paper introduces the first attempt to a formal conve...

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...