Advertisement
Published in:
2012 | OriginalPaper | Chapter
Selection and Scheduling Problem in Continuous Time with Pairwise-Interdependencies
Authors : Ivan Blecic, Arnaldo Cecchini, Giuseppe A. Trunfio
Published in: Computational Science and Its Applications – ICCSA 2012
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We propose a general framework for modelling selection-and-scheduling problem with interdependencies in continuous time. Such problem may frequently arise in many real-world evaluation and decision-making contexts, such as project portfolio selection and scheduling in organisations, urban planning, and scheduling of public policies. For the purpose of conducting computational experiments, we further formulate a specific example model to optimise, whose benefit is to require a relatively limited number of input data. Given the NP-hardness of the problem, we employ the Covariance Matrix Adaptation Evolutionary strategy for solving it, and discuss few results.