Salh, H., Ramadan, A. (2022). Heuristic Approaches for Solving bi-objective Single Machine Scheduling Problems. , 19(2), 55-63. doi: 10.33899/iqjoss.2022.176202
Hawzhin Abduljabar Salh; Ayad Mohammed Ramadan. "Heuristic Approaches for Solving bi-objective Single Machine Scheduling Problems". , 19, 2, 2022, 55-63. doi: 10.33899/iqjoss.2022.176202
Salh, H., Ramadan, A. (2022). 'Heuristic Approaches for Solving bi-objective Single Machine Scheduling Problems', , 19(2), pp. 55-63. doi: 10.33899/iqjoss.2022.176202
Salh, H., Ramadan, A. Heuristic Approaches for Solving bi-objective Single Machine Scheduling Problems. , 2022; 19(2): 55-63. doi: 10.33899/iqjoss.2022.176202

Heuristic Approaches for Solving bi-objective Single Machine Scheduling Problems

IRAQI JOURNAL OF STATISTICAL SCIENCES
Article 4, Volume 19, Issue 2, Autumn 2022, Page 55-63  XML PDF (938 K)
Document Type: Research Paper
DOI: 10.33899/iqjoss.2022.176202
Authors
Hawzhin Abduljabar Salh 1; Ayad Mohammed Ramadan2
1Sulaimani University College Of Science, Kirkuk Road, Sulaimani
2Sulaimani University, College Of Science, Mathematics Department.
Abstract
In this research paper, n jobs have to be scheduled on one-machine to minimize the sum of maximum earliness and maximum tardiness. We solved a series of bi-criteria scheduling problems that related to minimize the sum of the maximum earliness and tardiness. Three new algorithms were presented, two for hierarchical objective and one for the simultaneous objective. Using the results of these algorithms, we minimize the sum of maximum earliness and maximum tardiness. This objective considered as one of the NP-hard problem, and it is also irregular, so this objective missed some helpful properties of regularity. The proposed algorithms had simple structures, and simple to implement. Lastly, they tested for different n.
 
Keywords
Scheduling problems; Multi-objective function; Hierarchical objective; Simultaneous objective
Statistics
Article View: 59
PDF Download: 114