Preferred Language
Articles
/
ijs-7818
Exact and Near Pareto Optimal Solutions for Total Completion Time and Total Late Work Problem
...Show More Authors

     In this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times  simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Nov 01 2010
Journal Name
Al-nahrain Journal Of Science
Chemical Elements Diffusion in the Solar Interior
...Show More Authors

Publication Date
Fri Mar 01 2019
Journal Name
Applied Acoustics
Theoretical model of absorption coefficient of an inhomogeneous MPP absorber with multi-cavity depths
...Show More Authors

View Publication
Scopus (72)
Crossref (62)
Scopus Clarivate Crossref
Publication Date
Fri Jan 10 2025
Journal Name
Journal Of Studies And Researches Of Sport Education
The effect of using the educational bag on the level of learning some offensive skills with the epee weapon
...Show More Authors

View Publication