liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Göthe-Lundgren, Maud
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Lundgren, Jan T.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Persson, Jan A.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    An optimization model for refinery production scheduling2002In: International Journal of Production Economics, ISSN 0925-5273, E-ISSN 1873-7579, Vol. 78, no 3, p. 255-270Article in journal (Refereed)
    Abstract [en]

    In this paper we describe a production planning and scheduling problem in an oil refinery company. The problem concerns the planning and the utilization of a production process consisting of one distillation unit and two hydro-treatment units. In the process crude oil is transformed to bitumen and naphthenic special oils. The aim of the scheduling is to decide which mode of operation to use in each processing unit at each point in time, in order to satisfy the demand while minimizing the production cost and taking storage capacities into account. The production cost includes costs for changing mode and for holding inventory. We formulate a mixed integer linear programming model for the scheduling problem. The model can be regarded as a generalized lot-sizing problem, where inventory capacities are considered and more than one product is obtained for some modes of operation. A number of modifications and extensions of the model are also discussed. It is shown how the optimization model can be used as a viable tool for supporting production planning and scheduling at the refinery, and that it is possible to analyze scheduling scenarios of realistic sizes. It is also shown that the model can support shipment planning and strategic decisions concerning new products and investments in storage capacity. © 2002 Elsevier Science B.V. All rights reserved.

  • 2.
    Persson, Jan
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Göthe-Lundgren, Maud
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Lundgren, Jan
    Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
    Gendron, Bernard
    A tabu search heuristic for scheduling the production processes at an oil refinery2004In: International Journal of Production Research, ISSN 0020-7543, E-ISSN 1366-588X, Vol. 42, no 3, p. 445-471Article in journal (Refereed)
    Abstract [en]

    In this paper we present a tabu search heuristic which can be used for scheduling the production at an oil refinery. The scheduling problem is to decide which production modes to use at the different processing units at each point in time. The problem is a type of lot-sizing problem where costs of changeovers, inventories and production are considered. In the suggested tabu search heuristic we explore the use of variable neighbourhood, dynamic penalty and different tabu lists. Computational results are presented for different versions of the heuristic and the results are compared to the best-known lower bound for a set of scheduling scenarios.

1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf