Memetic algorithmfor unrelated parallel machine scheduling problemwith grey processing times

Oğuzhan Ahmet ARIK

Purpose – This paper aims to provide a promising memetic algorithm (MA) for an unrelated parallel machine scheduling problem with grey processing times by using a simple dispatching rule in the local search phase of the proposed MA. Design/methodology/approach – This paper proposes a MA for an unrelated parallel machine scheduling problem where the objective is to minimize the sum of weighted completion times of jobs with uncertain processing times. In the optimal schedule of the problem’s single machine version with deterministic processing time, the machine has a sequence where jobs are orde ...Daha fazlası