An Iterated Local Search Algorithm for a Place Scheduling Problem. (28th October 2013)

• Record Type: Journal Article
• Authors: Hu, Shicheng; Zhang, Zhaoze; He, Qingsong; Sun, Xuedong
• Other Names: Yin Yunqiang Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2013(2013)
• Publication Date: 2013-10-28
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2013/659297
• Languages: English
• ISSNs: 1024-123X

Abstract

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.