onr:"swepub:oai:DiVA.org:liu-70842"
Sökning: onr:"swepub:oai:DiVA.org:liu-70842" > Open-Pit Production...
- 1 av 1
- Föregående post
- Nästa post
- Till träfflistan
| Fältnamn | Indikatorer | Metadata |
|---|---|---|
| 000 | 02800nam a2200349 4500 | |
| 001 | oai:DiVA.org:liu-70842 | |
| 003 | SwePub | |
| 008 | 110920| | |||||||||||000 ||eng| | |
| 024 | 7 | a https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-708422 URI |
| 040 | a (SwePub)liu | |
| 041 | a engb eng | |
| 042 | 9 SwePub | |
| 072 | 7 | a vet2 swepub-contenttype |
| 072 | 7 | a ovr2 swepub-publicationtype |
| 100 | 1 | a Amankwah, Henryu Linköpings universitet,Optimeringslära,Tekniska högskolan4 aut0 (Swepub:liu)henam89 |
| 245 | 1 0 | a Open-Pit Production Scheduling - Suggestions for Lagrangian Dual Heuristic and Time Aggregation Approaches |
| 338 | a print2 rdacarrier | |
| 520 | a Open-pit production scheduling deals with the problem of deciding what and when to mine from an open-pit, given potential profits of the different fractions of the mining volume, pit-slope restrictions, and mining capacity restrictions for successive time periods. We give suggestions for Lagrangian dual heuristic approaches for the open-pit production scheduling problem. First, the case with a single mining capacity restriction per time period is considered. For this case, linear programming relaxations are solved to find values of the multipliers for the capacity restrictions, to be used in a Lagrangian relaxation of the constraints. The solution to the relaxed problem will not in general satisfy the capacity restrictions, but can be made feasible by adjusting the multiplier values for one time period at a time. Further, a time aggregation approach is suggested as a way of reducing the computational burden of solving linear programming relaxations, especially for largescale real-life mine problems. For the case with multiple capacity restrictions per time period we apply newly developed conditions for optimality and nearoptimality in general discrete optimization problems to construct a procedure for heuristically constructing near-optimal intermediate pits. | |
| 650 | 7 | a NATURVETENSKAPx Matematik0 (SwePub)1012 hsv//swe |
| 650 | 7 | a NATURAL SCIENCESx Mathematics0 (SwePub)1012 hsv//eng |
| 653 | a Open-pit mining | |
| 653 | a mine scheduling | |
| 653 | a Lagrangian relaxation | |
| 653 | a maximum flow | |
| 653 | a time aggregation | |
| 653 | a MATHEMATICS | |
| 653 | a MATEMATIK | |
| 700 | 1 | a Larsson, Torbjörnu Linköpings universitet,Optimeringslära,Tekniska högskolan4 aut0 (Swepub:liu)torla64 |
| 700 | 1 | a Textorius, Björnu Linköpings universitet,Tillämpad matematik,Tekniska högskolan4 aut0 (Swepub:liu)bjote47 |
| 700 | 1 | a Rönnberg, Elinau Linköpings universitet,Optimeringslära,Tekniska högskolan4 aut0 (Swepub:liu)eliro15 |
| 710 | 2 | a Linköpings universitetb Optimeringslära4 org |
| 856 | 4 8 | u https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70842 |
Till lärosätets databas
- 1 av 1
- Föregående post
- Nästa post
- Till träfflistan
Hitta mer i SwePub
- Av författaren/redakt...
- Amankwah, Henry
- Larsson, Torbjör ...
- Textorius, Björn
- Rönnberg, Elina
- Om ämnet
-
- NATURVETENSKAP
- NATURVETENSKAP
- och Matematik
- Av lärosätet
- Linköpings universitet
Sök utanför SwePub
- Sök vidare i:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - Nationella bibliotekssystem
- LIBRIS.kb.se
