this paper considers the job scheduling problem in virtual manufacturing cells (vmcs) with the goal of minimizing two objectives namely, makespan and total travelling distance. to solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (nsga-ii) and knowledge-based non-dominated sorting genetic algorithm (kbnsga-ii). the difference between these algor...

one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to ...

Dynamic flexible job shop scheduling problems has been one of the important and strongly NP-hard problem of manufacturing systems for many years. Most of the proposed algorithms are based on priority rules; By using these rules, the arrived jobs go to a long queue of waited jobs and sometimes it takes a long time for a job to be processed. In this paper a new approach, integrating of priority r...

this study emphasized the ability of genetic algorithm and cellular automate to simulate urban land use changes by integrating adaptive model. the most important part of modeling is to define transition rules.  in this research, a cellular automata model in dinamica ego software was used coupled with genetic algorithm. according to disability of the software for manipulating large number of var...

Over the past decade, scheduling in grid computing system has been an active research. However, it is still difficult to find an optimal scheduling algorithm to achieve load balancing. Most of the researchers have focus on schedule-based algorithms such as genetic algorithm and particle swarm optimization to solve this problem and us e priority rules algorithms as initial schedule in those algo...

Data transfer is a big overhead for cloud workflows due to pay-as-use business model of cloud environment. In such environment, the cost arising from data transfers between resources as well as execution costs must also be taken into account during scheduling based upon user’s Quality of Service (QoS) constraints. In this paper, we present Priority based Genetic Algorithm BCHGA to schedule work...