Back to Search
Start Over
An Iterated Local Search Algorithm for a Place Scheduling Problem.
- Source :
- Mathematical Problems in Engineering; 2013, p1-7, 7p
- Publication Year :
- 2013
-
Abstract
- We study the place scheduling problem which has many application backgrounds in realities. For the block manufacturing project with special manufacturing platform requirements, we propose a place resource schedule problem. First, the mathematical model for the place resource schedule problem is given. On the basis of resource-constrained project scheduling problem and packing problem, we develop a hybrid heuristic method which combines priority rules and three-dimensional best fit algorithm, in which the priority rules determine the scheduling order and the three-dimensional best fit algorithm solves the placement. After this method is used to get an initial solution, the iterated local search is employed to get an improvement. Finally, we use a set of simulation data to demonstrate the steps of the proposed method and verify its feasibility. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 1024123X
- Database :
- Complementary Index
- Journal :
- Mathematical Problems in Engineering
- Publication Type :
- Academic Journal
- Accession number :
- 94813649
- Full Text :
- https://doi.org/10.1155/2013/659297