Learn More
The resource-constrained project scheduling problem is a notoriously difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms to find optimal or near-optimal solutions. This paper proposes a new heuristic algorithm for this problem based on filter-and-fan method(More)
This paper considers a project scheduling problem with the objective of minimizing resource availability costs required to execute the activities in a project by a given project deadline. The project contains activities interrelated by finish-start-type precedence relations with a time lag of zero, which require a set of renewable resources. Two(More)
Uncertainty is an inevitable element in many practical production planning and scheduling environments. When a due date is predetermined for performing a set of jobs for a customer, production managers are often concerned with establishing a schedule with the highest possible confidence of meeting the due date. In this paper, we study the problem of(More)