Solving A Two-Agent Single-Machine Scheduling Problem by A Novel Metaheuristic

The multiple-agent scheduling problems have received increasing attention recently. But most papers in the multi agent environment ignore maintenance activity. For thisreason, this paper deliberates a two-agent single-machine scheduling problem with periodic maintenance activity. Inscheduling problems with two competing agents, each one ofthe agents has his own set of jobs and his own objective function, but both share the same processor. We developdiscrete version of cuckoo optimization algorithm (COA) for the problem. The results of computational experiments show the good performance of the proposed algorithm.

کلیدواژه ها:

Scheduling ، Two agents ، Single machine ، cuckoo optimization algorithm ، maintenance activity