A Tabu Search Heuristic for Scheduling the Production Processes at an Oil Refinery
| Document type: | Journal Articles |
|---|---|
| Article type: | Original article |
| Peer reviewed: | Yes |
| Author(s): | Jan A. Persson, Maud Göthe-Lundgren, Jan T. Lundgren, Bernard Gendron |
| Title: | A Tabu Search Heuristic for Scheduling the Production Processes at an Oil Refinery |
| Journal: | International Journal of Production Research |
| Year: | 2004 |
| Volume: | 42 |
| Issue: | 3 |
| Pagination: | 445-471 |
| ISSN: | 0020-7543 |
| Publisher: | Taylor & Francis |
| ISI number: | 000187028500002 |
| Organization: | Blekinge Institute of Technology |
| Department: | Department of Software Engineering and Computer Science (Institutionen för programvaruteknik och datavetenskap) Dept. of Software Engineering and Computer Science S-372 25 Ronneby +46 455 38 50 00 http://www.bth.se/eng/ipd/ |
| Language: | English |
| 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. |
| Subject: | Computer Science\General |
| Keywords: | Scheduling, Heuristic programming, Production, Inventory control, Costs, Operations research, Linear programming, Planning |
