Combinatorial Optimization Method Considering Distance in Scheduling Problem

Author(s):  
Yuta Obinata ◽  
Kenichi Tamura ◽  
Junichi Tsuchiya ◽  
Keiichiro Yasuda
2015 ◽  
Vol 135 (4) ◽  
pp. 466-467 ◽  
Author(s):  
Masahide Morita ◽  
Hiroki Ochiai ◽  
Kenichi Tamura ◽  
Junichi Tsuchiya ◽  
Keiichiro Yasuda

Author(s):  
Yongyi Shou ◽  
Wenjin Hu ◽  
Changtao Lai ◽  
Ying Ying

A multi-agent optimization method is proposed to solve the preemptive resource-constrained project scheduling problem in which activities are allowed to be preempted no more than once. The proposed method involves a multi-agent system, a negotiation process, and two types of agents (activity agents and schedule agent). The activity agents and the schedule agent negotiate with each other to allocate resources and optimize the project schedule. Computational experiments were conducted using the standard project scheduling problem sets. Compared with prior studies, results of the proposed method are competitive in terms of project makespan. The method can be extended to other preemptive resource-constrained project scheduling problems.


Sign in / Sign up

Export Citation Format

Share Document