|
|
|
|
solving the flow-shop scheduling problem using a hybrid nature-inspired optimization algorithm
|
|
|
|
|
|
|
|
نویسنده
|
nazif habibeh
|
|
منبع
|
دوازدهمين همايش ملي رياضي دانشگاه پيام نور - 1404 - دوره : 12 - دوازدهمين همايش ملی ریاضی دانشگاه پيام نور - کد همایش: 04250-24418 - صفحه:0 -0
|
|
چکیده
|
The fssp is one of the essential kinds of wide-range scheduling issues with many real-world applications. technically, the scheduling problem deals with allocating resources to a given number of tasks to optimize one or several objectives. in this paper, to promote the respective strengths and minimize the weaknesses, aco and pso are combined to solve this problem. the aco algorithm directs the motion locally through pheromones in the mutual area. also, by the random interaction between the solutions utilizing the pso, the global maximum is achieved. the computational analysis indicates that the suggested aco-pso algorithm performs better than the available ones significantly.
|
|
کلیدواژه
|
flow shop scheduling problem; aco; pso.
|
|
آدرس
|
, iran
|
|
پست الکترونیکی
|
h_nazif@pnu.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|