Minimizing total absolute deviation completion times on Single Machine scheduling under availability constraint

this paper considers a single machine scheduling problem with the multiple availability constraints that minimizes the total absolute deviation completion times. We prove problem is NP-hard in the strong sense. Thus, because of the intensive computation, we develop discrete version of cuckoo optimization algorithm (COA) for the problem.The results of computational experiments show the good performance of the proposed algorithm.

کلیدواژه ها:

Scheduling ، single machine ، availability constraint ، cuckoo optimization algorithm (COA) ، total absolute deviation completion times