Skip Navigation

IMA Journal of Management Mathematics 2007 18(2):101-115; doi:10.1093/imaman/dpm016
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by de Paula, M. R.
Right arrow Articles by Pardalos, P. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The authors 2007. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search

Mateus Rocha de Paula**, Martín Gómez Ravetti***, Geraldo Robson Mateus**** and Panos M. Pardalos*****

Computer Science Department, Federal University of Minas Gerais (DCC-UFMG), Belo Horizonte, Minas Gerais, Brazil and Department of Industrialand Systems Engineering, University of Florida (ISE-UF), Gainesville, Florida, USA

** Corresponding author. Email: mahdi{at}dcc.ufmg.br

*** Email: martin{at}dcc.ufmg.br

**** Email: mateus{at}dcc.ufmg.br

***** Email: pardalos{at}ufl.edu


  Abstract

Variable neighbourhood search (VNS) is a modern metaheuristic based on systematic changes of the neighbourhood structure within a search to solve optimization problems. The aim of this paper is to propose and analyse a VNS algorithm to solve scheduling problems with parallel machines and sequence-dependent setup times, which are of great importance on the industrial context. Three versions of a greedy randomized adaptive search procedure algorithm are used to compare with the proposed VNS algorithm to highlight its advantages in terms of generality, quality and speed for large instances.

Keywords: scheduling problems; variable neighbourhood search; GRASP

Received on April 2006. accepted on 9 February 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.