Machine scheduling in underground mining: an application in the potash industry

Research output: Contribution to journalArticleResearchpeer review

Authors

  • Cinna Seifi
  • Marco Schulze
  • Julia Rieck
  • Jürgen Zimmermann

External Research Organisations

  • Clausthal University of Technology
View graph of relations

Details

Original languageEnglish
Pages (from-to)365-403
Number of pages39
JournalOR spectrum
Volume38
Issue number2
Publication statusPublished - 2016
Externally publishedYes

Abstract

In this paper, a scheduling problem that occurs in potash mining is introduced, where a block excavation sequence has to be found taking into account a limited number of underground machines as well as safety-related restrictions. The aim is to minimize the maximum completion time of excavations, i.e., the makespan. The resulting problem can be transformed into a hybrid flow shop scheduling problem with reentry, unrelated machines, and job-precedences. A mixed-integer linear model is presented and small-scale instances are solved with CPLEX. In order to tackle medium- and large-scale instances heuristically, a basic and an advanced multistart algorithm are developed, based on a specific priority rule-based construction procedure. In addition, a modified version of the Giffler and Thompson procedure is applied. Computational experiments are conducted on problem instances derived from real-world data in order to evaluate the performances of the proposed solution procedures.

Keywords

    Hybrid flow shop, Mixed-integer linear program, Multi-start, Priority rule-based procedure, Reentrant flows, Underground mining

ASJC Scopus subject areas

Cite this

Machine scheduling in underground mining: an application in the potash industry. / Seifi, Cinna; Schulze, Marco; Rieck, Julia et al.
In: OR spectrum, Vol. 38, No. 2, 2016, p. 365-403.

Research output: Contribution to journalArticleResearchpeer review

Seifi, C, Schulze, M, Rieck, J & Zimmermann, J 2016, 'Machine scheduling in underground mining: an application in the potash industry', OR spectrum, vol. 38, no. 2, pp. 365-403. https://doi.org/10.1007/s00291-015-0414-y
Seifi C, Schulze M, Rieck J, Zimmermann J. Machine scheduling in underground mining: an application in the potash industry. OR spectrum. 2016;38(2):365-403. doi: 10.1007/s00291-015-0414-y
Seifi, Cinna ; Schulze, Marco ; Rieck, Julia et al. / Machine scheduling in underground mining: an application in the potash industry. In: OR spectrum. 2016 ; Vol. 38, No. 2. pp. 365-403.
Download
@article{fdebca2fded94c2da4ca33cd2f7f8020,
title = "Machine scheduling in underground mining: an application in the potash industry",
abstract = "In this paper, a scheduling problem that occurs in potash mining is introduced, where a block excavation sequence has to be found taking into account a limited number of underground machines as well as safety-related restrictions. The aim is to minimize the maximum completion time of excavations, i.e., the makespan. The resulting problem can be transformed into a hybrid flow shop scheduling problem with reentry, unrelated machines, and job-precedences. A mixed-integer linear model is presented and small-scale instances are solved with CPLEX. In order to tackle medium- and large-scale instances heuristically, a basic and an advanced multistart algorithm are developed, based on a specific priority rule-based construction procedure. In addition, a modified version of the Giffler and Thompson procedure is applied. Computational experiments are conducted on problem instances derived from real-world data in order to evaluate the performances of the proposed solution procedures.",
keywords = "Hybrid flow shop, Mixed-integer linear program, Multi-start, Priority rule-based procedure, Reentrant flows, Underground mining",
author = "Cinna Seifi and Marco Schulze and Julia Rieck and J{\"u}rgen Zimmermann",
note = "Publisher Copyright: {\textcopyright} 2015, Springer-Verlag Berlin Heidelberg.",
year = "2016",
doi = "10.1007/s00291-015-0414-y",
language = "English",
volume = "38",
pages = "365--403",
journal = "OR spectrum",
issn = "0171-6468",
publisher = "Springer Verlag",
number = "2",

}

Download

TY - JOUR

T1 - Machine scheduling in underground mining: an application in the potash industry

AU - Seifi, Cinna

AU - Schulze, Marco

AU - Rieck, Julia

AU - Zimmermann, Jürgen

N1 - Publisher Copyright: © 2015, Springer-Verlag Berlin Heidelberg.

PY - 2016

Y1 - 2016

N2 - In this paper, a scheduling problem that occurs in potash mining is introduced, where a block excavation sequence has to be found taking into account a limited number of underground machines as well as safety-related restrictions. The aim is to minimize the maximum completion time of excavations, i.e., the makespan. The resulting problem can be transformed into a hybrid flow shop scheduling problem with reentry, unrelated machines, and job-precedences. A mixed-integer linear model is presented and small-scale instances are solved with CPLEX. In order to tackle medium- and large-scale instances heuristically, a basic and an advanced multistart algorithm are developed, based on a specific priority rule-based construction procedure. In addition, a modified version of the Giffler and Thompson procedure is applied. Computational experiments are conducted on problem instances derived from real-world data in order to evaluate the performances of the proposed solution procedures.

AB - In this paper, a scheduling problem that occurs in potash mining is introduced, where a block excavation sequence has to be found taking into account a limited number of underground machines as well as safety-related restrictions. The aim is to minimize the maximum completion time of excavations, i.e., the makespan. The resulting problem can be transformed into a hybrid flow shop scheduling problem with reentry, unrelated machines, and job-precedences. A mixed-integer linear model is presented and small-scale instances are solved with CPLEX. In order to tackle medium- and large-scale instances heuristically, a basic and an advanced multistart algorithm are developed, based on a specific priority rule-based construction procedure. In addition, a modified version of the Giffler and Thompson procedure is applied. Computational experiments are conducted on problem instances derived from real-world data in order to evaluate the performances of the proposed solution procedures.

KW - Hybrid flow shop

KW - Mixed-integer linear program

KW - Multi-start

KW - Priority rule-based procedure

KW - Reentrant flows

KW - Underground mining

UR - http://www.scopus.com/inward/record.url?scp=84960333201&partnerID=8YFLogxK

U2 - 10.1007/s00291-015-0414-y

DO - 10.1007/s00291-015-0414-y

M3 - Article

VL - 38

SP - 365

EP - 403

JO - OR spectrum

JF - OR spectrum

SN - 0171-6468

IS - 2

ER -