Publication:
Reclaimer scheduling in dry bulk terminals

Thumbnail Image

Organizational Units

Program

School College Institute

GRADUATE SCHOOL OF SCIENCES AND ENGINEERING

KU-Authors

KU Authors

Co-Authors

Advisor

Publication Date

Language

Embargo Status

NO

Journal Title

Journal ISSN

Volume Title

item.page.alternative

Abstract

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.

Source:

Publisher:

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computer science, Engineering, Telecommunications

Citation

Has Part

Source:

IEEE Access

Book Series Title

Edition

DOI

10.1109/ACCESS.2020.2997739

item.page.datauri

Rights

Rights URL (CC Link)

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

2

Downloads

View PlumX Details