Details
| Original language | English |
|---|---|
| Pages (from-to) | 27-42 |
| Number of pages | 16 |
| Journal | European Journal of Operational Research |
| Volume | 292 |
| Issue number | 1 |
| Early online date | 12 Oct 2020 |
| Publication status | Published - 1 Jul 2021 |
| Externally published | Yes |
Abstract
Keywords
- Mixed-integer linear programming, Scheduling, Sequence-dependent setup times, Shift scheduling, Underground mining
ASJC Scopus subject areas
- Decision Sciences(all)
- Information Systems and Management
- Computer Science(all)
- General Computer Science
- Mathematics(all)
- Modelling and Simulation
- Decision Sciences(all)
- Management Science and Operations Research
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: European Journal of Operational Research, Vol. 292, No. 1, 01.07.2021, p. 27-42.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers
AU - Seifi, Cinna
AU - Schulze, Marco
AU - Zimmermann, Jürgen
N1 - Publisher Copyright: © 2020 Elsevier B.V.
PY - 2021/7/1
Y1 - 2021/7/1
N2 - In this paper, we introduce a mixed-integer linear program for a shift scheduling problem in a German potash mine. In particular, we consider a short-term (work shift) production scheduling problem, where drill-and-blast mining operations have to be assigned to machines and workers simultaneously. Since we deal with several sequence-dependent setup, changeover, and removal times, TSP-variables are used in the mathematical program to determine the processing-sequence of the operations on each worker and each machine, respectively. In addition, several mining-specific requirements are taken into account to obtain a solution that can be put into practice. Computational experiments are conducted on problem instances of realistic size derived from real-world data. The results show that our new mixed-integer linear formulation outperforms both existing solution procedures for the problem at hand.
AB - In this paper, we introduce a mixed-integer linear program for a shift scheduling problem in a German potash mine. In particular, we consider a short-term (work shift) production scheduling problem, where drill-and-blast mining operations have to be assigned to machines and workers simultaneously. Since we deal with several sequence-dependent setup, changeover, and removal times, TSP-variables are used in the mathematical program to determine the processing-sequence of the operations on each worker and each machine, respectively. In addition, several mining-specific requirements are taken into account to obtain a solution that can be put into practice. Computational experiments are conducted on problem instances of realistic size derived from real-world data. The results show that our new mixed-integer linear formulation outperforms both existing solution procedures for the problem at hand.
KW - Mixed-integer linear programming
KW - Scheduling
KW - Sequence-dependent setup times
KW - Shift scheduling
KW - Underground mining
UR - http://www.scopus.com/inward/record.url?scp=85095601018&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2020.10.007
DO - 10.1016/j.ejor.2020.10.007
M3 - Article
VL - 292
SP - 27
EP - 42
JO - European Journal of Operational Research
JF - European Journal of Operational Research
SN - 0377-2217
IS - 1
ER -