liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Persson, Jan
Alternative names
Publications (2 of 2) Show all publications
Persson, J., Göthe-Lundgren, M., Lundgren, J. & Gendron, B. (2004). A tabu search heuristic for scheduling the production processes at an oil refinery. International Journal of Production Research, 42(3), 445-471
Open this publication in new window or tab >>A tabu search heuristic for scheduling the production processes at an oil refinery
2004 (English)In: International Journal of Production Research, ISSN 0020-7543, E-ISSN 1366-588X, Vol. 42, no 3, p. 445-471Article in journal (Refereed) Published
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.

National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-22323 (URN)10.1080/00207540310001613656 (DOI)1523 (Local ID)1523 (Archive number)1523 (OAI)
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2017-12-13
Göthe-Lundgren, M., Lundgren, J. T. & Persson, J. A. (2002). An optimization model for refinery production scheduling. International Journal of Production Economics, 78(3), 255-270
Open this publication in new window or tab >>An optimization model for refinery production scheduling
2002 (English)In: International Journal of Production Economics, ISSN 0925-5273, E-ISSN 1873-7579, Vol. 78, no 3, p. 255-270Article in journal (Refereed) Published
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.

Place, publisher, year, edition, pages
Amsterdam, Netherlands: Elsevier, 2002
Keywords
Lot-sizing, Optimization model, Process scheduling, Refinery planning
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-46923 (URN)10.1016/S0925-5273(00)00162-6 (DOI)000176270200003 ()
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2017-12-13Bibliographically approved
Organisations

Search in DiVA

Show all publications