Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1177.90151
De Paula, Mateus Rocha; Ravetti, Mart{\'\i}n Gómez; Mateus, Geraldo Robson; Pardalos, Panos M.
Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. (English)
[J] IMA J. Manag. Math. 18, No. 2, 101-115 (2007). ISSN 1471-678X; ISSN 1471-6798/e

Summary: 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.

MSC 2000:: *90B35 Scheduling theory
90C59 Approximation methods and heuristics

Keywords: scheduling problems; variable neighbourhood search; GRASP

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]