THE COMPARISON OF PERMUTATION FLOWSHOP SCHEDULING HEURISTICS FOR LIMITED BUFFER CONSTRAINTS

摘要：

　　This paper focuses on the permutation flow shop scheduling problem with limited buffer constraints which is NP-hard.In this problem, the limited buffer which is not greater than a given upper bound between two consecutive machines is required.It has important applications in a variety of industrial systems.In order to explore an effective solving approach for the problem, some flowshop scheduling constructive heuristics are extended for limited buffer constraints, and compared.Computational tests demonstrate the relationship between problem characteristics and algorithm performance, and show the adaptability of the heuristics.

关键词： Permutation Flowshop Limited Buffer Constraints Heuristic Algorithm

作者: Yanhui Yu Tieke Li Bailin Wang

作者单位: Dongling School of Economics and Management, University of Science and Technology Beijing, Beijing 1 Dongling School of Economics and Management, University of Science and Technology Beijing, Beijing 1

会议类型: 国际会议

会议名称: The 11th International Conference on Industrial Management(第十一届工业管理国际会议)

会议地点: 日本

会议语种:英文

页码: 73-77

在线出版日期: 2012-08-29（万方平台首次上网日期，不代表论文的发表时间）