Abstract

ABSTRACT Numerous scheduling generation and revision methods have been developed for project scheduling under uncertain environments in previous research. However, most of these methods have yet to address a practical project with more than a hundred activities involving multiple decisions in scheduling generation and execution phases. This study proposes a local search-based scheduling method that comprehensively evaluates a baseline schedule considering decision-making in both the planning and execution phases. The proposed method performs simulations to evaluate schedule robustness accurately using GPU to find a locally optimal solution for large problem instances in a reasonable time. A series of numerical experiments demonstrate that the proposed method can generate a robust schedule for large-scale project instances. These results conclude that the proposed method utilizing the simulation-based evaluation and the GPU acceleration is effective and provide insight into developing a scheduling method for practical projects.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call