Elena Rokou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Elena Rokou has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Konstantinos Kirytopoulos
School of Mechanical Engineering, National Technical University of Athens, 15780 Zografos, Greece
7 shared publications Christos Kiriklidis
Department of Financial Engineering, University of Aegean, Chios, Greece
2 shared publicationsKonstantios Kirytopoulos
Department of Mechanical Engineering, National Technical University of Athens, Greece
2 shared publications- Athanasios C. Spanos
National Technical University Athens School of Mechanical Engineering
1 shared publication Dimitra Voulgaridou
1 shared publication- Emmanouil Dermitzakis
School of Mechanical Engineering, National Technical University of Athens, 15780 Athens, Greece
1 shared publication
Latest Publications
- 1 March 2017
- Published by Elsevier in World Patent Information
- Vol. 48, 78-95
How to prioritize inventions
- 1 March 2017
- Published by Elsevier in World Patent Information
- Vol. 48, 78-95
How to prioritize inventions
- 19 September 2016
- Published by Creative Decisions Foundation in International Journal of the Analytic Hierarchy Process
- Vol. 8 (2)
Why Simplify AHP?
AHP and ANP are very well developed mathematical theories with many practitioners, so why should anyone research methods to simplify the process? We believe there are many reasons to search for simplifications.Our goal is to find ways to make AHP simple and within reach of everybody without any need of specific knowledge by converting AHP from a sophisticated mathematical decision making method to an everyday tool to make quick and informed decisions on almost any subject we can think of. The downside will be loss of precision and accuracy, but we are not usually more precise when deciding without any method at all. That does not mean that for complex problems we will not use the full extent of the method but that in everyday and relatively simple models we do not really need to go to the full method. It seems like using a fighter jet to cross the street when all you need to do is walk (sure it will work, but you will spend the next 6 months in training learning how to fly the thing).
- 19 September 2016
- Published by Creative Decisions Foundation in International Journal of the Analytic Hierarchy Process
- Vol. 8 (2)
Why Simplify AHP?
AHP and ANP are very well developed mathematical theories with many practitioners, so why should anyone research methods to simplify the process? We believe there are many reasons to search for simplifications.Our goal is to find ways to make AHP simple and within reach of everybody without any need of specific knowledge by converting AHP from a sophisticated mathematical decision making method to an everyday tool to make quick and informed decisions on almost any subject we can think of. The downside will be loss of precision and accuracy, but we are not usually more precise when deciding without any method at all. That does not mean that for complex problems we will not use the full extent of the method but that in everyday and relatively simple models we do not really need to go to the full method. It seems like using a fighter jet to cross the street when all you need to do is walk (sure it will work, but you will spend the next 6 months in training learning how to fly the thing).
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21573611,p. 642-646
Multi-project flexible resource profiles project scheduling with Ant Colony Optimization
In today's rapidly evolving management world, the scheduling of multiple projects where each one's execution depends on another's successful completion, is of great importance. This paper presents a hybrid meta-heuristic algorithm composed of an external Genetic Algorithm (GA) and an encapsulated Ant Colony Optimization (ACO) algorithm for the flexible resource constrained multi-project scheduling problem (MPFRCPSP). The proposed idea is grounded on the concept of prioritizing the sub-projects' scheduling based on: a) the number of external (to other sub-projects) relations and b) the resource requirements as compared to the resource shortage for each resource type and each sub-project. The implementation uses the Genetic Algorithm to deal with the classification and prioritization of the projects to be scheduled and the inner ACO algorithm, to perform the activity list optimization for each project. The proposed method was validated using a consistent number of PSP Lib[l] data sets.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21573611,p. 642-646
Multi-project flexible resource profiles project scheduling with Ant Colony Optimization
In today's rapidly evolving management world, the scheduling of multiple projects where each one's execution depends on another's successful completion, is of great importance. This paper presents a hybrid meta-heuristic algorithm composed of an external Genetic Algorithm (GA) and an encapsulated Ant Colony Optimization (ACO) algorithm for the flexible resource constrained multi-project scheduling problem (MPFRCPSP). The proposed idea is grounded on the concept of prioritizing the sub-projects' scheduling based on: a) the number of external (to other sub-projects) relations and b) the resource requirements as compared to the resource shortage for each resource type and each sub-project. The implementation uses the Genetic Algorithm to deal with the classification and prioritization of the projects to be scheduled and the inner ACO algorithm, to perform the activity list optimization for each project. The proposed method was validated using a consistent number of PSP Lib[l] data sets.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21573611,p. 928-932
Supply chain risk management: A method and tool contributing to the operational aspects
The modern supply chains are based on extended organization networks across different businesses and Industries. The uncertainty in these networks becomes a great concern for the management of the chain in a holistic approach. Several studies provide a wide list of risk management strategies and the general strategies for risk management in the supply chain. However, the way that risks should be prioritized, analyzed, treated and followed, is rarely discussed at an operational level. In light of this gap, this paper proposes a simple method supported by a software tool, on how to manage the risks that can lead to the supply chain's disruption at an operational level. The method is `borrowed' by the project management discipline and the way that they manage risks. The main steps of the method cover: a) the identification of the risks related to each echelon of the supply chain, b) the classification of risks c) the analysis and ranking of risks d) the treatment strategies, and e) the follow up of risks. The steps of the method are supported by the proposed software tool.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21573611,p. 928-932
Supply chain risk management: A method and tool contributing to the operational aspects
The modern supply chains are based on extended organization networks across different businesses and Industries. The uncertainty in these networks becomes a great concern for the management of the chain in a holistic approach. Several studies provide a wide list of risk management strategies and the general strategies for risk management in the supply chain. However, the way that risks should be prioritized, analyzed, treated and followed, is rarely discussed at an operational level. In light of this gap, this paper proposes a simple method supported by a software tool, on how to manage the risks that can lead to the supply chain's disruption at an operational level. The method is `borrowed' by the project management discipline and the way that they manage risks. The main steps of the method cover: a) the identification of the risks related to each echelon of the supply chain, b) the classification of risks c) the analysis and ranking of risks d) the treatment strategies, and e) the follow up of risks. The steps of the method are supported by the proposed software tool.
- 16 September 2014
- Published by Taylor & Francis
- p. 2001-2008
On designing educational aids for users’ safety in road tunnels
- 16 September 2014
- Published by Taylor & Francis
- p. 2001-2008
On designing educational aids for users’ safety in road tunnels
- 31 October 2013
- Published by Wiley in International Transactions in Operational Research
- Vol. 21 (3) , 479-499
A new hybrid parallel genetic algorithm for the job‐shop scheduling problem
The job‐shop scheduling problem (JSSP) is considered one of the most difficult NP‐hard problems. Numerous studies in the past have shown that as exact methods for the problem solution are intractable, even for small problem sizes, efficient heuristic algorithms must achieve a good balance between the well‐known themes of exploitation and exploration of the vast search space. In this paper, we propose a new hybrid parallel genetic algorithm with specialized crossover and mutation operators utilizing path‐relinking concepts from combinatorial optimization approaches and tabu search in particular. The new scheme relies also on the recently introduced concepts of solution backbones for the JSSP in order to intensify the search in promising regions. We compare the resulting algorithm with a number of state‐of‐the‐art approaches for the JSSP on a number of well‐known test‐beds; the results indicate that our proposed genetic algorithm compares fairly well with some of the best‐performing genetic algorithms for the problem.
- 31 October 2013
- Published by Wiley in International Transactions in Operational Research
- Vol. 21 (3) , 479-499
A new hybrid parallel genetic algorithm for the job‐shop scheduling problem
The job‐shop scheduling problem (JSSP) is considered one of the most difficult NP‐hard problems. Numerous studies in the past have shown that as exact methods for the problem solution are intractable, even for small problem sizes, efficient heuristic algorithms must achieve a good balance between the well‐known themes of exploitation and exploration of the vast search space. In this paper, we propose a new hybrid parallel genetic algorithm with specialized crossover and mutation operators utilizing path‐relinking concepts from combinatorial optimization approaches and tabu search in particular. The new scheme relies also on the recently introduced concepts of solution backbones for the JSSP in order to intensify the search in promising regions. We compare the resulting algorithm with a number of state‐of‐the‐art approaches for the JSSP on a number of well‐known test‐beds; the results indicate that our proposed genetic algorithm compares fairly well with some of the best‐performing genetic algorithms for the problem.
- 1 October 2013
- Published by Springer Nature in Group Decision and Negotiation
- Vol. 23 (6) , 1369-1384
A Calibrated Group Decision Process
- 1 October 2013
- Published by Springer Nature in Group Decision and Negotiation
- Vol. 23 (6) , 1369-1384
A Calibrated Group Decision Process
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Project Organisation and Management
- Vol. 4 (4) , 306
Embracing real outcomes to future projects: a knowledge management method for schedule development
The aim of this paper is to provide an effective method for schedule reengineering and optimisation through knowledge acquisition and corporate memory creation. The core problem of schedule development is about defining the right activities for inclusion in the schedule, their duration and the right dependencies among project activities. It is shown here that project-oriented organisations specialised in certain domains can have highly accurate project schedules and thus improved efficiency by exploiting past experience. The first part of the proposed method consists of monitoring all the existing processes related to the projects execution and the corresponding knowledge acquisition through monitoring project results. The second part handles the creation of a corporate memory in the form of a set of schedule prototypes, along with all the needed processes for future projects execution. The paper is illustrated with a case study concerning the implementation of the method on the construction sector.
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Project Organisation and Management
- Vol. 4 (4) , 306
Embracing real outcomes to future projects: a knowledge management method for schedule development
The aim of this paper is to provide an effective method for schedule reengineering and optimisation through knowledge acquisition and corporate memory creation. The core problem of schedule development is about defining the right activities for inclusion in the schedule, their duration and the right dependencies among project activities. It is shown here that project-oriented organisations specialised in certain domains can have highly accurate project schedules and thus improved efficiency by exploiting past experience. The first part of the proposed method consists of monitoring all the existing processes related to the projects execution and the corresponding knowledge acquisition through monitoring project results. The second part handles the creation of a corporate memory in the form of a set of schedule prototypes, along with all the needed processes for future projects execution. The paper is illustrated with a case study concerning the implementation of the method on the construction sector.
- 1 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 844-847
Exploring close-optimal solutions for the Time Constrained Scheduling Prolem in project management
This paper presents a new approach for the Time Constraint Project Scheduling Problem (TCPSP). A two stage heuristic algorithm was developed for this problem. During the first stage a genetic algorithm using as fitness function, a function composition of max resource usage and the differences between actual and desirable resource usage, is executed to get a set of solutions. The second stage consists of choosing the best chromosomes and moving the solution's set start times ±1 to randomly generate another set of solutions. Experimental results of the two stage approach are presented and compared to the single genetic algorithm results.
- 1 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 844-847
Exploring close-optimal solutions for the Time Constrained Scheduling Prolem in project management
This paper presents a new approach for the Time Constraint Project Scheduling Problem (TCPSP). A two stage heuristic algorithm was developed for this problem. During the first stage a genetic algorithm using as fitness function, a function composition of max resource usage and the differences between actual and desirable resource usage, is executed to get a set of solutions. The second stage consists of choosing the best chromosomes and moving the solution's set start times ±1 to randomly generate another set of solutions. Experimental results of the two stage approach are presented and compared to the single genetic algorithm results.