Keywords = Particle Swarm Optimization

A two-objective Mathematical Model for Job Scheduling on Parallel Machines and Solving by Particle Swarm Optimization

Articles in Press, Accepted Manuscript, Available Online from 01 July 2025

https://doi.org/10.22116/jiems.2025.498885.1587

Shahram Saeidi

Abstract Time is one of the most valuable assets in industry, and cost is another highly regarded factor. Optimal utilization of these resources can increase efficiency and profit. The parallel machine scheduling problem is a fundamental issue in industry and services. This research proposes a two-objective mathematical model for parallel machine scheduling. The first objective function is defined as the makespan, which is the completion time of the last job. The second objective function is defined as the maximum cost incurred by any single machine, which is a function of the sum of the processing costs of each operation and the fixed cost of purchasing and maintaining the machines. Each job consists of multiple operations, and all operations must be completed to finish the job. Additionally, it is assumed that jobs have priorities, and precedence constraints between operations must be satisfied. Due to the model's non-linearity and the problem's complexity, a metaheuristic algorithm based on the particle swarm optimization (PSO) approach is developed to solve the proposed model by aggregating the objective functions. The proposed method is simulated in MATLAB on three sample instances in small, medium, and large scales. The computational results demonstrate the robustness and efficiency of the proposed method.

A two-objective mathematical model for solving the facility layout problem using fuzzy goal programming and Artificial Bee Colony optimization

Volume 11, Issue 1, July 2024, Pages 127-139

https://doi.org/10.22116/jiems.2024.432953.1544

Shahram Saeidi

Abstract The facility layout problem (FLP) aims to find the location of the facilities so that the departments do not overlap and the desired goals are optimized. The feasibility of proposed solutions in actual conditions is rarely considered in previous studies. This research proposes a two-objective mathematical programming model for solving the FLP to minimize the material handling cost and maximize the total closeness rating between departments, considering the limitations of space and allocable area. The objective functions are aggregated using the fuzzy goal programming approach. Due to the nonlinearity of the proposed model, an algorithm based on the Artificial Bee Colony (ABC) has also been developed to solve the model. The proposed method has been simulated in MATLAB on small, medium, and large samples containing 15, 50, and 100 departments respectively, and the results were compared with that of the PSO. The related aggregated objective function value was obtained as 0.845, 0.837, and 0.836 by the proposed method, and 0.809, 0.789, and 0.839 by the PSO algorithm. Respectively, the computation times were calculated as 15.21, 24.37, and 36.32 seconds in the proposed method, where the PSO obtained the best solutions in 18.22, 32.08, and 46.17 seconds for solving the sample problems. Hence, the calculation results show that the proposed method has a faster calculation time than the PSO and performs better in small and medium examples. Besides, a small variance of obtained solutions in 50 different runs, revealed a high stability of the proposed method.

Just-in-time parallel job scheduling: A novel algorithm

Volume 9, Issue 2, December 2022, Pages 1-12

https://doi.org/10.22116/jiems.2022.346243.1491

Javad Behnamian

Abstract This research extends a two-phase algorithm for parallel job scheduling problem by considering earliness and tardiness as multi-objective functions. Here, it is also assumed that the jobs may use more than one machine at the same time, which is known as parallel job scheduling. In the first phase, jobs are grouped into job sets according to their machine requirements. For this, here, a heuristic algorithm is proposed for coloring the associated graph. In the second phase, job sets will be sequenced as a single machine scheduling problem. In this stage, for sequencing the job sets which are obtained from the first phase, a discrete algorithm is proposed, which comprises two well-known metaheuristics. In the proposed hybrid algorithm, the genetic algorithm operators are used to discretize the particle swarm optimization algorithm. An extensive numerical study shows that the algorithm is very efficient for the instances which have different structures so that the proposed algorithm could balance exploration and exploitation and improve the quality of the solutions, especially for large-sized test problems.

Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment

Volume 4, Issue 1, June 2017, Pages 69-89

https://doi.org/10.22116/jiems.2017.51964

Maryam Shams, Ahmad Jafarzadeh Afshari, Amir Khakbaz

Abstract Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching high efficiency in the cloud computing environment. In this paper, “the cloud resources management problem” is investigated that includes allocation and scheduling of computing resources, such that providers achieve the high efficiency of resources and users receive their needed applications in an efficient manner and with minimum cost. For this purpose, a group technology based non-linear mathematical model is presented with an aim at minimization of load difference of servers, number of transfers between servers, number of active virtual machines, maximum construction time, the cost of performing jobs and active servers energy consumption. To solve the model, a meta-heuristic multi-objective hybrid Genetic and Particle Swarm Optimization algorithm is proposed for resource allocation and scheduling. In order to demonstrate the validity and efficiency of the algorithm, a number of problems with different dimensions are randomly created and accordingly the efficiency and convergence capability of the suggested algorithm is investigated. The results indicated that the proposed hybrid method has had an acceptable performance in generating high quality, diverse and sparse solutions.