A reclaimer scheduling problem arising in coal stockyard management

Angelelli, Enrico; Kalinowski, Thomas; Kapoor, Rupam

doi:10.1007/s10951-015-0436-y

Cited by 27 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Examples include ROM stockpiles in copper production and dry bulk terminals in iron and coal production. Reclaimer scheduling in dry bulk terminals has been well explored [1,18], where they are mainly a variation of the parallel machine scheduling problem. However, the main shortcoming in these studies is that they adopt a supply chain model that considers the stockpiles as a whole.…”

Section: Related Workmentioning

confidence: 99%

Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple Reclaimers

Assimi¹,

Koch²,

Garcia³

et al. 2021

Preprint

View full text Add to dashboard Cite

Stockpiles are essential in the mining value chain, assisting in maximising value and production. Quality control of taken minerals from the stockpiles is a major concern for stockpile managers where failure to meet some requirements can lead to losing money. This problem was recently investigated using a single reclaimer, and basic assumptions. This study extends the approach to consider multiple reclaimers in preparing for short and long-term deliveries. The engagement of multiple reclaimers complicates the problem in terms of their interaction in preparing a delivery simultaneously and safety distancing of reclaimers. We also consider more realistic settings, such as handling different minerals with different types of reclaimers. We propose methods that construct a solution step by step to meet precedence constraints for all reclaimers in the stockyard. We study various instances of the problem using greedy algorithms, Ant Colony Optimisation (ACO), and propose an integrated local search method determining an efficient schedule. We fine-tune and compare the algorithms and show that the ACO combined with local search can yield efficient solutions.

show abstract

Section: Related Workmentioning

confidence: 99%

Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple Reclaimers

Assimi¹,

Koch²,

Garcia³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Babu et al (2015) minimized the delay of the bulk material ships by developing two heuristic-based greedy algorithms which considered the influence of stockyard planning and train scheduling. Angelelli et al (2016) studied the problem of scheduling reclaimers in the stockyard of a coal export terminal and developed a constant factor approximation algorithm to solve it. Kalinowski et al (2017) proposed a mixedinteger formulation for the reclaimer scheduling problem in the coal stockyard.…”

Section: Literature Reviewmentioning

confidence: 99%

Storage space allocation problem at inland bulk material stockyard

Sun

Meng

Tang

et al. 2020

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

“…Angelelli et al [13] introduce an abstract scheduling problem inspired by the reclaiming operations. They present complexity results and an approximation algorithm for a specific setting with two reclaimers mounted on a rail track which is located in-between two pads.…”

Section: Related Workmentioning

confidence: 99%

Reclaimer Scheduling in Dry Bulk Terminals

Unsal

2020

IEEE Access

View full text Add to dashboard Cite

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.

show abstract

A reclaimer scheduling problem arising in coal stockyard management

Cited by 27 publications

References 22 publications

Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple Reclaimers

Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple Reclaimers

Storage space allocation problem at inland bulk material stockyard

Reclaimer Scheduling in Dry Bulk Terminals

Contact Info

Product

Resources

About