Thumbnail
Access Restriction
Subscribed

Author Arroyo, J.E.C. ♦ dos Santos Ottoni, R. ♦ dos Santos, A.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2011
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Algorithm design and analysis ♦ Schedules ♦ Job shop scheduling ♦ local search heuristics ♦ Approximation algorithms ♦ Minimization ♦ multi-objective optimization ♦ Optimization ♦ job scheduling
Abstract In this paper, we analyze the performance of two multi-objective algorithms based on the Variable Neighborhood Search (VNS). The first algorithm was proposed by Geiger and the second algorithm is proposed in this work. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. We consider minimizing the total weighted earliness/tardiness and the total flow time criteria. The proposed multi-objective VNS algorithm generates good non-dominated solutions (an approximation of the Pareto-optimal solutions) in reasonable computation time. The performance of the algorithms is tested on a set of medium and large size instances. The computational results show that our approach is promising heuristic for multi-objective optimization.
Description Author affiliation: Departamento de Informática, Universidade Federal de Viçosa, Viçosa, MG, Brazil (Arroyo, J.E.C.; dos Santos Ottoni, R.; dos Santos, A.)
ISBN 9781457716768
ISSN 21647151
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2011-11-22
Publisher Place Spain
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
e-ISBN 9781457716768
Size (in Bytes) 607.91 kB
Page Count 6
Starting Page 1116
Ending Page 1121


Source: IEEE Xplore Digital Library