Blecic, Ivan and Cecchini, Arnaldo and Trunfio, Giuseppe Andrea (2012) Selection and scheduling problem in continuous time with Pairwise-interdependencies. In: ICCSA 2012: 12. International Conference on Computational Science and its applications: proceedings: part II, 18-21 June 2012, Salvador de Bahia, Brazil. Berlin - Heidelberg, Springer. p. 481-491. (Lecture Notes in Computer Science, 7334/2012). ISSN 0302-9743. ISBN 978-3-642-31074-4. eISBN 978-3-642-31075-1. Conference or Workshop Item.
Full text not available from this repository.
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.
I documenti depositati in UnissResearch sono protetti dalle leggi che regolano il diritto d'autore
Repository Staff Only: item control page