An iterated local search algorithm for a place scheduling problem (Q474475): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59031394, #quickstatements; #temporary_batch_1706296832163 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 05:48, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An iterated local search algorithm for a place scheduling problem |
scientific article |
Statements
An iterated local search algorithm for a place scheduling problem (English)
0 references
24 November 2014
0 references
Summary: 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.
0 references