Hamid Tavakkolai ¹, Ali Asghar Rahmani Hosseinabadi ¹, Mehdi Yadollahi ¹, Touraj Mohammadpour ¹

Affiliations
1 Department of Computer, Islamic Azad University Ayatollah Amoli Branch, Amol, IR

Abstract

The scheduling problem of N independent works on M machines in the environment of permutation workflow workshop along with processing time and the desired delivery date are types of static problems, and except the machinery limitation as resources, no other limitation governs on it. Due to the importance of on time completion of work and minimizing delivery time of work, checking them is necessary in real word situations and will be properly effective on orders expedition and customer satisfaction. In this paper, one purpose of minimizing the sum of delays and on times (ΣE/T), is factor of recourses in advance reservation. The other main purpose is to present a new method called TIME_GSA using the Gravitational Search Algorithm (GSA) in order to solve the scheduling problem of works in workflow workshop environment, based on minimizing criteria of the sum of works delays and on times for resources in advance reservation. In this article, a novel optimization algorithm in the basis of gravitation law and mass interactions is presented to resolve the above problem. The suggested algorithm utilizes two of four basic factors connected to velocity and gravitational force in physics, based on random search concepts. The searcher agents are a group of masses which interact with each other based on the Newtonian gravitation and the laws of motion. The suggested procedure is compared with GA algorithm; the results approve the excellent performance of the suggested procedure to resolve the above problem.

Keywords

GSA Algorithm, Resources Reservation, Scheduling, Workflow Workshop

Full Text

   

Hamid Tavakkolai ¹, Nader Yadollahi ², Mehdi Yadollahi ¹, Ali Asghar Rahmani Hosseinabadi ³, Maryam Kardgar ³

Affiliations
1 Department of Computer, Islamic Azad University Ayatollah Amoli Branch, Amol, IR
2 Computer Engineering Department of Yazd University, Yazd, IR
3 Young Research Club, Behshahr Branch, Islamic Azad University, Behshahr, IR

Abstract

A wireless sensor network consists hundreds or thousands of sensors with limited computing power and memory, which give the information from the environment and then analyze and process the data and also send the sensed data to other nodes or basic stations. In these networks, sensing nodes have with a limited battery to provide the energy. Since in these networks, energy is considered as a challenging problem, we decided to propose a new algorithm based on the gravitational search algorithm to prolong the network lifetime and achieve maximum coverage of target area. Performance of the proposed algorithm is evaluated through simulations and compared to GA algorithm. Experimental results show that the proposed algorithm has more appropriate sensor selection to compared algorithm. In fact, total coverage increased by 2 percentage and we have 5 percentages more alive sensors in network when reached to coverage threshold.

Keywords

Gravitational Search Algorithm, Sensor Selection, Surveillance, Wireless Multimedia Sensor Network

Full Text