摘要
针对钢铁行业中的实际问题,探讨满足一定条件的情况下,提出把不可中断Job-Shop问题(NPJSSP)转化为可中断Job-Shop问题(PJSSP)的方法,并利用启发式算法和数学软件Matlab对其大规模的PJSSP进行求解,得到了较优的结果。
The paper discusses how to transfer Non-preemptive Job-Shop Scheduling Problem (NPJSSP) into a Preemptive Job-Shop Scheduling Problem (PJSSP) under certain conditions and uses the heuristic algorithm and Matlab programming to solve the massive preemptive Job-Shop Scheduling Problem.
出处
《物流技术》
2008年第12期120-123,共4页
Logistics Technology
基金
上海市科委重点项目(06JC14064)