nowadays project management is a key component in introductory operations management. the educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. in this paper, we evaluated project’s completion time utilizing the q-learning algorithm. so the ...

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

Dynamic Load Balancing (DLB) is sine qua non in modern distributed systems to ensure the efficient utilization of computing resources therein. This paper proposes a novel framework for hybrid dynamic load balancing. Its framework uses a Genetic Algorithms (GA) based supernode selection approach within. The GA-based approach is useful in choosing optimally loaded nodes as the supernodes directly...

Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...

Abstract: Urban canyon is categorized as hard environment for positioning of a dynamic vehicle due to low number and also bad configuration of in-view satellites. In this paper, a tuning procedure is proposed to adjust the important factors in Kalman Filter (KF) using Genetic Algorithm (GA). The authors tested the algorithm on a dynamic vehicle in an urban canyon with hard condition and compare...

Two single machine scheduling problems with fuzzy processing times and fuzzy due dates are considered. In both we define the fuzzy tardiness of a job in a given sequence as a fuzzy maximum of zero and the difference between the fuzzy completion time and the fuzzy due date of this job. In the first problem we minimize the maximal expected value of a fuzzy tardiness and in the second we minimize ...

this paper uses integrated data envelopment analysis (dea) models to rank all extreme and non-extreme efficient decision making units (dmus) and then applies integrated dea ranking method as a criterion to modify genetic algorithm (ga) for finding pareto optimal solutions of a multi objective programming (mop) problem. the researchers have used ranking method as a shortcut way to modify ga to d...

proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

Abstract. In this research we concentrate on developing and analyzing a programming model for a version of uncertain vehicle routing problems (VRPs). The customers demands are random fuzzy variables and the travel times between customers follow given probability distributions. Vehicles set out from a single depot, serve a number of customers and upon completion of their service, return to the d...