Please use this identifier to cite or link to this item: https://ruomoplus.lib.uom.gr/handle/8000/1715
Title: Advanced Algorithms for the Reclaimer Scheduling Problem with Sequence-Dependent Setup Times and Availability Constraints
Authors: Benbrik, Oualid 
Benmansour, Rachid 
Elidrissi, Abdelhak 
Sifaleras, Angelo 
Author Department Affiliations: Department of Applied Informatics 
Author School Affiliations: School of Information Sciences 
Keywords: Reclaimer Scheduling
Bulk Ports
Sequence-Dependent Setup Times
Machine Eligibility Restrictions
Variable Neighborhood Search
Heuristics
Issue Date: 17-Jun-2024
Publisher: Springer
Series/Report no.: Lecture Notes in Computer Science
ISSN: 0302-9743
1611-3349
Volume: 14753
Start page: 291
End page: 308
Abstract: 
Scheduling of reclaimers activities in dry bulk terminals significantly impact terminal throughput, a crucial performance indicator for such facilities. This study addresses the Reclaimer Scheduling Problem (RSP) while considering periodic preventive maintenance activities for reclaimers. These machines are integral for reclaiming dry bulk materials stored in stockyards, facilitating their loading onto vessels via ship-loaders. The primary aim of the objective function entails the minimization of the overall completion time, commonly referred to as the makespan. Since this problem is
NP-hard, we propose a novel greedy constructive heuristic. The solutions obtained from this heuristic serve as the starting point for an efficient General Variable Neighborhood Search (GVNS) algorithm to handle medium-scale instances resembling real stockyard configurations. Computational experiments are conducted by comparing the proposed methods across various problem instances. The results demonstrate that the developed GVNS, coupled with the constructive heuristic for initial solution finding, efficiently improves scheduling efficacy. Thus, it emerges as a new state-of-the-art algorithm for this problem.
URI: https://ruomoplus.lib.uom.gr/handle/8000/1715
ISBN: 978-3-031-62911-2
978-3-031-62912-9
DOI: 10.1007/978-3-031-62912-9_28
Rights: Attribution-NonCommercial-NoDerivatives 4.0 Διεθνές
Corresponding Item Departments: Department of Applied Informatics
Appears in Collections:Book chapters

Files in This Item:
File Description SizeFormat
Advanced_Algorithms_for_the_Reclaimer_Scheduling_Problem.pdf974,16 kBAdobe PDF
View/Open
Show full item record

Page view(s)

17
checked on Jul 25, 2024

Download(s)

3
checked on Jul 25, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons