Gregory A. Kasapidis

ORCID: 0000-0002-5272-9261
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Assembly Line Balancing Optimization
  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization
  • Transportation Systems and Logistics
  • Flexible and Reconfigurable Manufacturing Systems
  • Metaheuristic Optimization Algorithms Research
  • Vehicle Routing Optimization Methods
  • Supply Chain Resilience and Risk Management
  • Optimization and Packing Problems
  • Digital Transformation in Industry
  • Scheduling and Timetabling Solutions

University of Liverpool
2023-2024

Athens University of Economics and Business
2021-2023

John Wiley & Sons (United States)
2023

Hudson Institute
2023

Liechtenstein Institute
2023

This paper aims at linking the work presented in Dauzère‐Pérès et al. (1998) and more recently Kasapidis (2021) on multiresource flexible job‐shop scheduling problem with nonlinear routes or equivalently arbitrary precedence graphs. In particular, we present a mixed integer linear programming (MIP) model constraint (CP) to formulate problem. We also compare theorems introduced propose new theorem extension. Computational experiments were conducted assess efficiency effectiveness of all...

10.1111/poms.13977 article EN cc-by-nc Production and Operations Management 2023-03-13

A common assumption in the shop scheduling literature is that processing order of operations each job sequential; however, practice, there can be multiple connections and finish‐to‐start dependencies among job. This paper studies flexible problems with arbitrary precedence graphs. Rigorous mixed integer constraint programming models are presented, as well an evolutionary algorithm proposed to solve large‐scale problems. The heuristic solution framework equipped efficient evolution local...

10.1111/poms.13501 article EN Production and Operations Management 2021-06-18

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...

10.1016/j.ejor.2024.08.010 article EN cc-by European Journal of Operational Research 2024-08-12
Coming Soon ...