转换
任务(项目管理)
工作站
蚁群优化算法
计算机科学
数学优化
时间范围
直线(几何图形)
过程(计算)
成交(房地产)
运筹学
算法
工程类
数学
经济
系统工程
电信
操作系统
传输(电信)
财务
几何学
作者
Erkan Çelik,Yakup Kara,Yakup Atasagun
标识
DOI:10.1080/00207543.2014.917768
摘要
In real world, line balancing involves existing lines in existing factories and the line typically needs to be rebalanced rather than balanced. Rebalancing of a U-line can be defined as a changeover process from its initial configuration to a new configuration for a while due to the reasons such as demand variations, changes in product design and changes in task times, etc. This study defines U-line rebalancing problem with stochastic task times and proposes a solution procedure based on ant colony optimisation. The objective of the proposed algorithm is to minimise total cost of rebalancing which is the sum of task transposition costs, workstation opening/closing costs and operating costs of workstations for a particular planning horizon. A comprehensive experiment is conducted to generate problem instances and to compare rebalancing costs of U-lines by means of several factors. A total of 6600 rebalancing solutions are obtained and several comparisons are performed.
科研通智能强力驱动
Strongly Powered by AbleSci AI