A GRASP+VND algorithm for a class of job scheduling problem in parallel machines
Petróleo Brasileiro S/A (Petrobras) is the biggest Brazilian company in energy business. It acts in exploration, production, refinement, commercialization and transport of petroleum by products in Brazil and other countries. Most of the petroleum production is concentrated in the Campos b...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2010 |
| Country: | Brasil |
| Institution: | Associação Brasileira de Engenharia de Produção (ABEPRO) |
| Repository: | Brazilian Journal of Operations & Production Management (Online) |
| Language: | English |
| OAI Identifier: | oai:ojs.bjopm.org.br:article/82 |
| Online Access: | https://bjopm.org.br/bjopm/article/view/V7N2A4_ |
| Access Level: | Open access |
| Keyword: | Job Scheduling Problem in Parallel Machines GRASP VND Combinatorial Optimization Petrobras |
| Summary: | Petróleo Brasileiro S/A (Petrobras) is the biggest Brazilian company in energy business. It acts in exploration, production, refinement, commercialization and transport of petroleum by products in Brazil and other countries. Most of the petroleum production is concentrated in the Campos basin, where the company port (port of Imbetiba – Macaé/RJ) is located. All the oil rigs supply is done using this port. Researches made at the port of Imbetiba show the need of optimizing, among others, the problem of towboat scheduling. In this problem, the order of towboat attendance must be decided and, according to the material that each one carry, the following restrictions must be respected: each towboat has a subset of piers where it can be attended; each one has a attendance priority; and each one has a minimal time where it can be attended, that is, before this time it cannot be attended. This paper proposes a GRASP algorithm for the problem of towboat scheduling, which utilizes the technique VND as local search. Three neighborhood structures are used: Exchange, Interchange and Relocation. Computational results show that the proposed algorithm is efficient when compared with traditional GRASP algorithms. |
|---|