GA for the Resource Sharing and Scheduling Problem Academic Article uri icon

abstract

  • Abstract In this paper we consider the resource-sharing and scheduling problem, with makespan minimization as an objective. Although this problem was optimally solved through a customized branch-and-bound algorithm, its complexity motivated the use of heuristics such as genetic algorithms. A previous genetic algorithm used for solving this problem was significantly faster than the branch-andbound algorithm; however, it suffered from a high rate of infeasible offspring. We propose a new genetic approach, which produces only …

publication date

  • January 1, 2010