摘要
为解决异序排序问题,提出了新的表上作业法。该方法不仅可以解决2×n型异序排序问题,还可以有效地解决带优先加工约束2×n型异序排序问题。该方法简便易行,便于掌握,可获得比较满意的近似最优加工顺序。
A new table method is created to solve job-shop problems, which can effectively solve 2 × n job-shop problems as well as 2 × n job-shop problems with preference sequence restraint. The method is simple and easy to master, by which a comparatively satisfactory solution to scheduling with approximative optimization can be obtained.
出处
《东北林业大学学报》
CAS
CSCD
北大核心
2006年第2期117-119,共3页
Journal of Northeast Forestry University
关键词
异序排序
智能优化算法
表上作业法
排序规则
优先加工约柬
Job-shop problems
Intelligent optimization algorithms
Table method
Scheduling rules
Preference sequence restraint
