Reclaimer Scheduling in Dry Bulk Terminals

This paper studies a complex parallel scheduling problem with non-crossing constraint, sequence dependent setup times, eligibility restrictions, and precedence relationships motivated by reclaimer scheduling in dry bulk terminals. In a stockyard of any dry bulk terminal, stockpiles are handled by re...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Ozgur Unsal
Formato: article
Lenguaje:EN
Publicado: IEEE 2020
Materias:
Acceso en línea:https://doaj.org/article/f166b274ef31415290847c38a6424db5
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:f166b274ef31415290847c38a6424db5
record_format dspace
spelling oai:doaj.org-article:f166b274ef31415290847c38a6424db52021-12-01T00:00:25ZReclaimer Scheduling in Dry Bulk Terminals2169-353610.1109/ACCESS.2020.2997739https://doaj.org/article/f166b274ef31415290847c38a6424db52020-01-01T00:00:00Zhttps://ieeexplore.ieee.org/document/9099793/https://doaj.org/toc/2169-3536This paper studies a complex parallel scheduling problem with non-crossing constraint, sequence dependent setup times, eligibility restrictions, and precedence relationships motivated by reclaimer scheduling in dry bulk terminals. In a stockyard of any dry bulk terminal, stockpiles are handled by reclaimers. Therefore, improving the operational efficiency of reclaimers is critical for the overall performance of these terminals which are struggling with increasing workload. We study the variants of this problem with and without stacking operations. For each variant, we present a lower and an upper bound. A strong lower bound is obtained by relaxing the non-crossing constraint and solving the resulting problem to the optimality. While this relaxation still addresses a challenging scheduling problem, proposed arc-time-indexed formulation copes with the instances of practical size. We develop a novel constraint programming formulation to provide an upper bound for the problem. Computational experiments show this robust approach is able to generate near-optimal schedules for different stockyard configurations within a minute.Ozgur UnsalIEEEarticleParallel machines schedulingmathematical programmingreclaimer schedulingbulk terminalsElectrical engineering. Electronics. Nuclear engineeringTK1-9971ENIEEE Access, Vol 8, Pp 96294-96303 (2020)
institution DOAJ
collection DOAJ
language EN
topic Parallel machines scheduling
mathematical programming
reclaimer scheduling
bulk terminals
Electrical engineering. Electronics. Nuclear engineering
TK1-9971
spellingShingle Parallel machines scheduling
mathematical programming
reclaimer scheduling
bulk terminals
Electrical engineering. Electronics. Nuclear engineering
TK1-9971
Ozgur Unsal
Reclaimer Scheduling in Dry Bulk Terminals
description This paper studies a complex parallel scheduling problem with non-crossing constraint, sequence dependent setup times, eligibility restrictions, and precedence relationships motivated by reclaimer scheduling in dry bulk terminals. In a stockyard of any dry bulk terminal, stockpiles are handled by reclaimers. Therefore, improving the operational efficiency of reclaimers is critical for the overall performance of these terminals which are struggling with increasing workload. We study the variants of this problem with and without stacking operations. For each variant, we present a lower and an upper bound. A strong lower bound is obtained by relaxing the non-crossing constraint and solving the resulting problem to the optimality. While this relaxation still addresses a challenging scheduling problem, proposed arc-time-indexed formulation copes with the instances of practical size. We develop a novel constraint programming formulation to provide an upper bound for the problem. Computational experiments show this robust approach is able to generate near-optimal schedules for different stockyard configurations within a minute.
format article
author Ozgur Unsal
author_facet Ozgur Unsal
author_sort Ozgur Unsal
title Reclaimer Scheduling in Dry Bulk Terminals
title_short Reclaimer Scheduling in Dry Bulk Terminals
title_full Reclaimer Scheduling in Dry Bulk Terminals
title_fullStr Reclaimer Scheduling in Dry Bulk Terminals
title_full_unstemmed Reclaimer Scheduling in Dry Bulk Terminals
title_sort reclaimer scheduling in dry bulk terminals
publisher IEEE
publishDate 2020
url https://doaj.org/article/f166b274ef31415290847c38a6424db5
work_keys_str_mv AT ozgurunsal reclaimerschedulingindrybulkterminals
_version_ 1718406176465485824