期刊
COMPUTATIONAL MANAGEMENT SCIENCE
卷 3, 期 4, 页码 331-348出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10287-006-0023-y
关键词
Job shop scheduling problem; Makespan; Global equilibrium search; Metaheuristics
资金
- NSF grant
- AirForce grant
The job shop scheduling problem is considered, and an algorithm based on the global equilibrium search method is proposed for its solution. Computational experiments using well-known benchmark problems are presented. Several new upper bounds for these problems are obtained.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据