This paper investigates a preemptive semi-online scheduling problem on m identical parallel machines where m = 2, 3. It is assumed that all jobs have their proc
Combinatorial optimization problems are found in many application fields such as computer science, engineering and economy. In this paper, a new efficient meta-