A5063820346- Advanced Graph Theory Research
- Game Theory and Voting Systems
- Complexity and Algorithms in Graphs
- Optimization and Packing Problems
- graph theory and CDMA systems
- Scheduling and Optimization Algorithms
- Constraint Satisfaction and Optimization
- Digital Transformation in Industry
- Auction Theory and Applications
- Vehicle Routing Optimization Methods
- Game Theory and Applications
- Assembly Line Balancing Optimization
- Scheduling and Timetabling Solutions
- Optimization and Search Problems
- Flexible and Reconfigurable Manufacturing Systems
- Advanced Manufacturing and Logistics Optimization
- Computational Geometry and Mesh Generation
- Optimization and Mathematical Programming
- Green IT and Sustainability
- Formal Methods in Verification
- Energy Efficiency and Management
- Names, Identity, and Discrimination Research
- VLSI and FPGA Design Techniques
- Manufacturing Process and Optimization
- Recycling and Waste Management Techniques
Athens University of Economics and Business
2014-2024
University of Patras
2005-2008
London School of Economics and Political Science
2002-2005
University of Portsmouth
2003
In the era of Industry 4.0, Digital Twins (DTs) pave way for creation Cognitive Factory. By virtualizing and twinning information stemming from real digital world, it is now possible to connect all parts production process by having virtual copies physical elements interacting with each other in realms. However, this alone does not imply cognition. Cognition requires modelling only characteristics but also behavior processes. The latter can be founded upon data-driven models produced via...
Energy and carbon management systems (ECMS) are a class of green information that has the potential to increase environmental sustainability in organizations across supply chains. Employing design science research approach, we define scope ECMS chain context, identify requirements, an expository instantiation, develop theory, including key constructs principles. We instantiate this theory four contexts validate revise proposed two rounds. six system components data collection, energy...
The many-to-many stable matching problem (MM), defined in the context of a job market, asks for an assignment workers to firms satisfying quota each agent and being stable, pairwise or setwise, with respect given preference lists relations. In this paper, we propose time-optimal algorithm that identifies all worker–firm pairs assignments under stability, individual preferences, max-min criterion. We revisit poset graph rotations obtain optimal enumerating solutions MM improved finding...
We consider Pareto optimal matchings (POMs) in a many-to-many market of applicants and courses where have preferences, which may include ties, over individual lexicographic preferences sets courses. Since this is the most general setting examined so far literature, our work unifies generalizes several known results. Specifically, we characterize POMs introduce Generalized Serial Dictatorship Mechanism with Ties (GSDT) that effectively handles ties via properties network flows. show GSDT can...
We examine the parallel machine scheduling problem where a set of jobs are to be processed by unrelated machines. most general among variations for which an exact method has been proposed regarding makespan minimisation. This is because, apart from machines, we allow (i) job splitting: each job's quantity can split and multiple machines simultaneously; (ii) sequence- machine-dependent setup times: time when j succeeds k different than varies also per m; (iii) resource constraints: number...
This paper examines flexible job shop scheduling problems with multiple resource constraints. A unified solution framework is presented for modelling various types of non-renewable, renewable and cumulative resources, such as limited capacity machine buffers, tools, utilities work in progress buffers. We propose a Constraint Programming (CP) model CP-based Adaptive Large Neighbourhood Search (ALNS-CP) algorithm. The ALNS-CP uses long-term memory structures to store information about the...
In the setting of stable matching (SM) problem, it has been observed that some man-woman pairs cannot be removed although they participate in no matching, since such a removal would alter set solutions. These are yet to identified. Likewise (and despite sizeable literature), fundamental characteristics SM polytope (e.g., its dimension, facets, etc.) have not established. current work, we show these two seemingly distant open issues closely related. More specifically, identify with...
Motivated by the need of quick job (re-)scheduling, we examine an elaborate scheduling environment under objective total weighted tardiness minimisation. The examined problem variant moves well beyond existing literature, as it considers unrelated machines, sequence-dependent and machine-dependent setup times, a renewable resource constraint on number simultaneous setups. For this variant, provide relaxed MILP to calculate lower bounds, thus estimating worst-case optimality gap. As fast...