Decentralized RCMPSPTT with cost of idleness

Considering the cost of idleness of resources in decentralized multi-project scheduling problem with transfer time has an important impact on the coordination decision results. Based on multi-agent system, the local scheduling model is established to optimize the single project completion time. Initial local scheduling can be solved by genetic algorithm. The global coordination decision model is established to optimize the multi-project total cost by fully considering the tardiness cost of project, the cost of global resources transfer and the cost of idleness of global resources. The sequential game-based negotiation mechanism with greedy transfer strategy is designed to coordinate the allocation and transfer of global resources, and then the local scheduling of each project is modified. According to the computational results of instances in multi project scheduling problems library (MPSPLIB), it is reasonable to take into account the cost of idleness of global resources when coordinating global resources; compared with the results obtained by non-game distributed randomly coordination mechanism, it demonstrates that the sequential game-based negotiation approach can reduce the total cost for multi-project effectively.