An Iterated Local Search Algorithm for a Place Scheduling Problem
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 give...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2013/659297 |
id |
doaj-ea648d84cab34a54b29a4629b7125783 |
---|---|
record_format |
Article |
spelling |
doaj-ea648d84cab34a54b29a4629b71257832020-11-25T02:47:05ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472013-01-01201310.1155/2013/659297659297An Iterated Local Search Algorithm for a Place Scheduling ProblemShicheng Hu0Zhaoze Zhang1Qingsong He2Xuedong Sun3School of Economics and Management, Harbin Institute of Technology, Weihai 264209, ChinaSchool of Economics and Management, Harbin Institute of Technology, Weihai 264209, ChinaSchool of Economics and Management, Harbin Institute of Technology, Weihai 264209, ChinaSchool of Software, Sun Yat-sen University, Guangzhou 510275, ChinaWe 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.http://dx.doi.org/10.1155/2013/659297 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Shicheng Hu Zhaoze Zhang Qingsong He Xuedong Sun |
spellingShingle |
Shicheng Hu Zhaoze Zhang Qingsong He Xuedong Sun An Iterated Local Search Algorithm for a Place Scheduling Problem Mathematical Problems in Engineering |
author_facet |
Shicheng Hu Zhaoze Zhang Qingsong He Xuedong Sun |
author_sort |
Shicheng Hu |
title |
An Iterated Local Search Algorithm for a Place Scheduling Problem |
title_short |
An Iterated Local Search Algorithm for a Place Scheduling Problem |
title_full |
An Iterated Local Search Algorithm for a Place Scheduling Problem |
title_fullStr |
An Iterated Local Search Algorithm for a Place Scheduling Problem |
title_full_unstemmed |
An Iterated Local Search Algorithm for a Place Scheduling Problem |
title_sort |
iterated local search algorithm for a place scheduling problem |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2013-01-01 |
description |
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. |
url |
http://dx.doi.org/10.1155/2013/659297 |
work_keys_str_mv |
AT shichenghu aniteratedlocalsearchalgorithmforaplaceschedulingproblem AT zhaozezhang aniteratedlocalsearchalgorithmforaplaceschedulingproblem AT qingsonghe aniteratedlocalsearchalgorithmforaplaceschedulingproblem AT xuedongsun aniteratedlocalsearchalgorithmforaplaceschedulingproblem AT shichenghu iteratedlocalsearchalgorithmforaplaceschedulingproblem AT zhaozezhang iteratedlocalsearchalgorithmforaplaceschedulingproblem AT qingsonghe iteratedlocalsearchalgorithmforaplaceschedulingproblem AT xuedongsun iteratedlocalsearchalgorithmforaplaceschedulingproblem |
_version_ |
1724754672688824320 |