Stavros Vatikiotis

Stavros Vatikiotis

Auto-generated profile, based on publicly available information

Stavros Vatikiotis

Athens University of Economics and Business

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 July 2022 in International Journal of Production Research
Verified
Journal Article
Closed access
IAIoannis Avgerinos
Ioannis Avgerinos
IMIoannis Mourtos
Ioannis Mourtos
SVStavros Vatikiotis
Stavros Vatikiotis
GZGeorgios Zois
Georgios Zois
We examine the parallel machine scheduling problem where a set of jobs are to be processed by a set of unrelated parallel machines. We examine the most general among the variations for which an exact method has been proposed regarding makespan minimisation. This is because, apart from unrelated machines, we allow for (i) job splitting: each job's quantity can be split and processed by multiple machines simultaneously; (ii) sequence- and machine-dependent setup times: the setup time when job j succeeds k is different than the time when k succeeds j and varies also per machine m; and (iii) setup resource constraints: the number of setups that can be performed simultaneously on different machines is restricted. We present novel lower bound formulations and a heuristic that solves instances of up to 1000 jobs in a few minutes at an average gap of less than 20%. Then, we propose a logic-based Benders decomposition, which, coupled with our heuristic, solves instances of up to 200 jobs and 20 machines to near optimality in less than two hours. Our method is used for a broad range of instances from textile manufacturing, thus yielding valuable managerial insights on makespan's versatility under varying machines or resources.

1 November 2023 in International Journal of Production Research
Verified
Journal Article
Closed access
IAIoannis Avgerinos
Ioannis Avgerinos
IMIoannis Mourtos
Ioannis Mourtos
SVStavros Vatikiotis
Stavros Vatikiotis
GZGeorgios Zois
Georgios Zois

30 January 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
SVStavros Vatikiotis
Stavros Vatikiotis
IAIoannis Avgerinos
Ioannis Avgerinos
SPStathis Plitsos
Stathis Plitsos
GZGeorgios Zois
Georgios Zois

31 August 2021
Verified
Book Chapter
Closed access
PDF file
IMIoannis Mourtos
Ioannis Mourtos
SVStavros Vatikiotis
Stavros Vatikiotis
GZGeorgios Zois
Georgios Zois

8 July 2026 in Results in Engineering
Verified
Journal Article
Open access
EKEfthalia Karkou
Efthalia Karkou
Athanasios Angelis-DimakisAthanasios Angelis-Dimakis
Athanasios Angelis-Dimakis
IHIvaylo Hitsov
Ivaylo Hitsov
DGDorien Gaublomme
Dorien Gaublomme
RPRobert Sanfeliu Prat
Robert Sanfeliu Prat
GAGeorge Arampatzis
George Arampatzis

13 July 2023 in arXiv
Verified
Preprint
Open access
PDF file
IAIoannis Avgerinos
Ioannis Avgerinos
IMIoannis Mourtos
Ioannis Mourtos
SVStavros Vatikiotis
Stavros Vatikiotis
GZGeorgios Zois
Georgios Zois
Motivated by the need of quick job (re-)scheduling, we examine an elaborate scheduling environment under the objective of total weighted tardiness minimization. The examined problem variant moves well beyond existing literature, as it considers unrelated machines, sequence-dependent and machine-dependent setup times and a renewable resource constraint on the number of simultaneous setups. For this variant, we provide a relaxed MILP to calculate lower bounds, thus estimating a worst-case optimality gap. As a fast exact approach appears not plausible for instances of practical importance, we extend known (meta-)heuristics to deal with the problem at hand, coupling them with a Constraint Programming (CP) component - vital to guarantee the non-violation of the problem's constraints - which optimally allocates resources with respect to tardiness minimization. The validity and versatility of employing different (meta-)heuristics exploiting a relaxed MILP as a quality measure is revealed by our extensive experimental study, which shows that the methods deployed have complementary strengths depending on the instance parameters. Since the problem description has been obtained from a textile manufacturer where jobs of diverse size arrive continuously under tight deadlines, we also discuss the practical impact of our approach in terms of both tardiness decrease and broader managerial insights.