Using Gravitational Search Algorithm for in Advance Reservation of Resources in Solving the Scheduling Problem of Works in Workflow Workshop Environment

Tavakkolai, Hamid; Ali, Asghar; Hosseinabadi, Ali Asghar Rahmani; Yadollahi, Mohammadreza; Mohammadpour, Touraj

doi:10.17485/ijst/2015/v8i11/71761

Cited by 8 publications

(3 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The velocity of each particle (Equation ( 22) ) could be calculated by computing the coefficient of the present velocity of the particle and acceleration of the particle. The new position of the particle i in the dimension d is obtained using Equation (23).…”

Section: Laws Of Motionmentioning

confidence: 99%

See 1 more Smart Citation

Hybrid Gravitational Search Algorithm to Solve the Task Scheduling Problem of Two-Machine Flow Shop

Pirozmand

Mirkamali

Słowik

2022

Preprint

View full text Add to dashboard Cite

The main goal of any task scheduling problem is to map several tasks to proper processors so that it could optimize one or more objectives at an acceptable time under some constraints. In this paper, the problem of scheduling n independent work with different due times on Two -Machines in the sequential flow shop environment is investigated. To solve this problem, we propose a hybrid metaheuristic algorithm that combines the Simulated Annealing (SA) with Gravitational Search Algorithm (GSA) called SA_GSA. The proposed hybrid algorithm starts the above problem by defining two stages. First, we generate an initial solution of the problem using the SA algorithm, then we run the GSA algorithm on the generated solution. To evaluate the answers, the criterion of the minimum weight of delays and delays of tasks has been used as an objective function, which is considered in line with the goals of timely production systems. The proposed algorithm is presented in 4 scenarios, which are obtained by considering two different modes for the Markov chain and how to reduce the temperature. Finally, according to the analysis of the results and the quality of the results, the best scenario is introduced as the final result. Experimental results show that the performance of the proposed algorithm in finding the optimal answers in most of the problems could compete with state-of-the-art.

show abstract

Section: Laws Of Motionmentioning

confidence: 99%

“…where ri and rj are the random numbers by uniform distribution in the interval of (0,1). Like in [22,23] to adjust the gravitational constant Equation ( 24) is used.…”

Section: Laws Of Motionmentioning

confidence: 99%

Hybrid Gravitational Search Algorithm to Solve the Task Scheduling Problem of Two-Machine Flow Shop

Pirozmand

Mirkamali

Słowik

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…For this reason, the formulation of the OSSP is more complicated than the job shop scheduling problem (JSSP) and the flexible job shop scheduling problem (FJSSP) problems. In the OSP, each machine can process at most one job at a time, and each job can also be processed at most on a single machine at a time [14][15][16].…”

Section: Introductionmentioning

confidence: 99%

An improved bat optimization algorithm to solve the tasks scheduling problem in open shop

Shareh

Bargh

Hosseinabadi

et al. 2020

Neural Comput & Applic

View full text Add to dashboard Cite

The open shop scheduling problem involves a set of activities that should be run on a limited set of machines. The purpose of scheduling open shops problem is to provide a timetable for implementation of the entire operation so that the total execution time is reduced. The tasks scheduling problem in open shops is important in many applications due to the arbitrariness of the processing sequence of each job and lack of a prioritization of its operations. This is an NP-hard problem and obtaining an optimal solution to this problem requires a high time complexity. Therefore, heuristic techniques are used to solve these problems. In this paper, we investigate the tasks scheduling problem in open shops using the Bat Algorithm (BA) based on ColReuse and substitution meta-heuristic functions. The heuristic functions are designed to increase the rate of convergence to the optimal solution. To evaluate the performance of the proposed algorithm, standard open shop benchmarks were used. The results obtained in each benchmark are compared with those of the previous methods. Finally, after analyzing the results, it was found that the proposed BA had a better performance and was able to generate the best solution in all cases.

show abstract

Imperialist Competition Based Clustering Algorithm to Improve the Lifetime of Wireless Sensor Network

Rostami

Badkoobe

Mohanna

et al. 2017

Soft Computing Applications

View full text Add to dashboard Cite

Using Gravitational Search Algorithm for in Advance Reservation of Resources in Solving the Scheduling Problem of Works in Workflow Workshop Environment

Cited by 8 publications

References 55 publications

Hybrid Gravitational Search Algorithm to Solve the Task Scheduling Problem of Two-Machine Flow Shop

Hybrid Gravitational Search Algorithm to Solve the Task Scheduling Problem of Two-Machine Flow Shop

An improved bat optimization algorithm to solve the tasks scheduling problem in open shop

Imperialist Competition Based Clustering Algorithm to Improve the Lifetime of Wireless Sensor Network

Contact Info

Product

Resources

About