An Exact Method and Ant Colony Optimization for Single Machine Scheduling Problem With Time Window Periodic Maintenance

Abstract

This paper considers a time window periodic maintenance strategy with different duration windows and job scheduling activities in a single machine environment. The aim is to minimize the number of tardy jobs through the integration of production scheduling and periodic maintenance intervals. A mixedinteger linear programming model (MILP) is proposed to optimize small-sized test instances. Furthermore, an ant colony optimization (ACO) algorithm is developed to solve larger sized test instances. Subsequently, to measure the efficiency of the solutions obtained by ACO, Moore's algorithm is also developed to benchmark with ACO. To test the efficiency and the effectiveness of the ACO algorithm, a set of data for small and large sized problems was generated in which several parameters were adopted and then ten replicates were solved for each combination. The small sized instances were solved by the MILP. Then, the results obtained showed that the proposed ACO was able to obtain the exact solutions within reasonable CPU times, thus, it outperformed the CPLEX solver with respect to CPU. The large sized instances were solved by the Moore's algorithm and compared to ACO. Then, the results obtained showed that the ACO outperforms Moore's algorithm for all the instances tested. It can be concluded that the developed ACOis very efficient and effective in solving the problem considered in this paper. INDEX TERMS Scheduling, MILP, single machine, periodic Maintenance, ant colony. AHMED BADWELAN received the B.Sc. degree in mechanical engineering from the Faculty of Engineering, University of Aden, in 2012, and the M.S. degree in industrial engineering from King Saud University, Saudi Arabia. He is currently pursuing the Ph.D. degree with the

Multi-Site Aggregate Production Planning Using Particle Swarm Optimization

“…Authors solved production scheduling problems using the Ant Colony Algorithm, which effectively solves the problem. Qamhan et al (2020) solved single-machine scheduling using the ant colony optimization (ACO) algorithm. The findings demonstrated that the suggested ACO was capable of obtaining precise answers in reasonable CPU time.…”

“…The number of production problems can be solved using various methods such as mathematical and the heuristic method. Several methods can be applied in determining the number of production, among others: ant colony algorithm (Qamhan et al, 2020;Wu et al, 2012;Zhang et al, 2020) and PSO (Chakrabortty et al, 2015). Fuzzy linear programming (Vasant et al, 2004), Fuzzy TOPSIS and goal programming (Khemiri et al, 2017), variable neighborhood search (Almada-Lobo et al, 2008), simulated annealing (Baxendale et al, 2021;Tung et al, 2016), and genetic algorithm (Fahimnia et al, 2012;Ramezanian et al, 2012;Yuliastuti et al, 2019).…”

A Data-Driven Maintenance Framework Under Imperfect Inspections for Deteriorating Systems Using Multitask Learning-Based Status Prognostics

“…The inspection and maintenance costs satisfy the following relationship: > > > . For comparison, the average maintenance cost models of the periodic maintenance strategy (PM) [34] and the ideal predictive maintenance strategy (IPM) [35] are derived as follows:…”

Feature-Extraction-Based Iterated Algorithms to Solve the Unrelated Parallel Machine Problem With Periodic Maintenance Activities

“…A more realistic ε-almost periodic maintenance was assumed by Xu et al [5], where the difference in the times of any consecutive maintenance activities of the machine is within ε, and proposed an approximation algorithm to minimize the makespan for the parallel-machine problem. Qamhan et al [16] considered a single-machine problem with time window periodic maintenance where the time between two maintenance activates was a fixed interval (T) and each maintenance activity could start in a time window, i.e., T∓w. Additionally, the time of maintenance activity was not equal.…”