Loading...
Please wait, while we are loading the content...
Similar Documents
Neighborhoods Revisited: An Experimental Investigation into the Effectiveness of Variable Neighborhood Descent for Scheduling (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Besten, Matthijs Den Stützle, Thomas |
| Abstract | this paper we focus on the application of Variable Neighborhood Descent [3], a particular VNS technique, to scheduling problems in which a solution can be represented as one permutation of all jobs. This class of scheduling problems includes single machine problems as well as a variety of multiple machine problems. In this abstract, we present some results of VND when applied to single machine problems minimizing the total tardiness problem, the total weighted tardiness, and the sum of weighted completion times, as well as to the permutation ow shop problem. In addition we investigate whether VND local search performs better than a single neighborhood local search algorithm when the local search is used as a subprocedure within a metaheuristic using as an example application Iterated Local Search [5] |
| File Format | |
| Publisher Date | 2001-01-01 |
| Access Restriction | Open |
| Subject Keyword | Variable Neighborhood Descent Experimental Investigation Single Machine Problem Local Search Particular Vns Technique Vnd Local Search Performs Single Neighborhood Local Search Algorithm Total Tardiness Problem Permutation Ow Shop Problem Example Application Iterated Local Search Weighted Completion Time Multiple Machine Problem |
| Content Type | Text |
| Resource Type | Article |
