A genetic algorithm for resource-constrained scheduling

TLDR: Jakiela et al. as discussed by the authors presented a genetic algorithm approach to resource-constrained scheduling using a direct, time-based representation, which was applied to over 1000 small job shop and project scheduling problems (10-300 activities, 3-10 resource types).

Abstract: This work describes a genetic algorithm approach to resource-constrained scheduling using a direct, time-based representation. Whereas traditional solution methods are typically sequencebased, this representation encodes schedule information as a dual array of relative delay times and integer execution modes. The representation supports multiple execution modes, preemption, non-uniform resource availability/usage, a variety of resource types, probabilistic resource performance models, overlapping precedence relationships, and temporal constraints on both tasks and resources. In addition, the representation includes time-varying resource availabilities and requirements. Many objective measures can be defined such as minimization of makespan, maximization of net present value, or minimization of average tardiness. Multiple, possibly conflicting objectives are supported. The genetic algorithm adapts to dynamic factors such as changes to the project plan or disturbances in the schedule execution. In addition to the scheduling representation, this thesis presents a structured method for defining and evaluating multiple constraints and objectives. The genetic algorithm was applied to over 1000 small job shop and project scheduling problems (10-300 activities, 3-10 resource types). Although computationally expensive, the algorithm performed fairly well on a wide variety of problems. With little attention given to its parameters, the algorithm found solutions within 2% of published best in 60% of the project scheduling problems. Performance on the jobshop problems was less encouraging; in a set of 82 jobshop problems with makespan as the single performance measure, the algorithm found solutions with makespan 2 to 3 times the published best. On project scheduling problems with multiple execution modes, the genetic algorithm performed better than deterministic, bounded enumerative search methods for 10% of the 538 problems tested. The test runs were performed with minimal attention to tuning of the genetic algorithm parameters. In most cases, better performance is possible simply by running the algorithm longer or by varying the selection method, population size or mutation rate. However, the results show the flexibility and robustness of a direct representation and hint at the possibilities of integrating the genetic algorithm approach with other methods. Thesis Committee: Mark Jakiela , Associate Professor of Mechanical Engineering, MIT Woodie Flowers, Pappalardo Professor of Mechanical Engineering, MIT Stephen Graves, Professor of Management Science, Sloan School of Management Karl Ulrich, Associate Professor of Operations and Information Management, The Wharton School This document is available from ftp://lancet.mit.edu/pub/mbwall/phd/thesis.ps.gz effective 1 August 1996, Hunter Associate Professor of Mechanical Design and Manufacturing, Mechanical Engineering, Washington University, St. Louis.