A tabu search heuristic for scheduling the production processes at an oil refinery

A tabu search heuristic for scheduling the production processes at an oil refinery

0.00 Avg rating0 Votes
Article ID: iaor20043588
Country: United Kingdom
Volume: 42
Issue: 3
Start Page Number: 445
End Page Number: 471
Publication Date: Jan 2004
Journal: International Journal of Production Research
Authors: , , ,
Keywords: petroleum
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.