Selection and scheduling problem in continuous time with pairwise-interdependencies

Authors:
Ivan Blecic;Arnaldo Cecchini;Giuseppe A. Trunfio
Affiliations:
Laboratory of Analysis and Models for Planning (LAMP), Department of Architecture and Planning, University of Sassari, Alghero, Italy;Laboratory of Analysis and Models for Planning (LAMP), Department of Architecture and Planning, University of Sassari, Alghero, Italy;Laboratory of Analysis and Models for Planning (LAMP), Department of Architecture and Planning, University of Sassari, Alghero, Italy
Venue:
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part II
Year:
2012

Citing 5
Cited 0

An improved discrete dynamic programming algorithm for allocating resources among interdependent projects

Management Science
A multiple criteria decision model for information system project selection

Computers and Operations Research
Completely Derandomized Self-Adaptation in Evolution Strategies

Evolutionary Computation
Shark

The Journal of Machine Learning Research
Solving a comprehensive model for multiobjective project portfolio selection

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.