Keywords = Parallel Machines

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.

Ant colony optimization, genetic algorithm and hybrid metaheuristics: A new solution for parallel machines scheduling with sequence-dependent set-up times

Volume 7, Issue 2, August 2020, Pages 223-239

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

Mahdi Nakhaeinejad

Abstract The parallel machine scheduling problem (PMSP) is one of the most difficult classes of problem. Due to the complexity of the problem, obtaining optimal solution for the problems with large size is very time consuming and sometimes, computationally infeasible. So, heuristic algorithms that provide near-optimal solutions are more practical and useful. The present study aims to propose a hybrid metaheuristic approach for solving the problem of unrelated parallel machine scheduling, in which, the machine and the job sequence dependent setup times are considered. A Mixed-Integer Programming (MIP) model is formulated for the unrelated PMSP with sequence dependent setup times. The solution approach is robust, fast, and simply structured. The hybridization of Genetic Algorithm (GA) with Ant Colony Optimization (ACO) algorithm is the key innovative aspect of the approach. This hybridization is made in order to accelerate the search process to near-optimal solution. After computational and statistical analysis, the two proposed algorithms are used to compare with the proposed hybrid algorithm to highlight its advantages in terms of generality and quality for short and large instances. The results show that the proposed hybrid algorithm has a very good performance as regards the instance size and provides the acceptable results.