摘要
面向作业的调度(ｊｏｂｏｒｉｅｎｔｅｄｓｃｈｅｄｕｌｉｎｇ，简称ＪＯＳ）在实际作业车间（ｊｏｂｓｈｏｐ）调度中得到普遍的应用，它的基本思想是将作业一个个地安排到工作机器上．该文提出了一种基于计算机ＪＯＳ系统的快速调度算法，该算法指定作业操作的可行调度起始和结束时间以正排工序或逆排工序方式将它们安排到有限能力的工作机器上．通过记录和修改每一机器有效时间槽的办法来减少操作在每一机器上搜索可行时间槽的时间从而大大提高了计算效率．实际系统应用表明，此算法对于大规模调度具有很强的优越性．
Job oriented scheduling (JOS) has been the most commonly used technique in actual job shopscheduling. It loads jobs one by one onto machines. In this paper, the authors present a fast scheduling algorithmof computer-based JOS system, the algorithm assigns feasible schedule start and finish times to the operations of ajob by loading them forward or backward onto the capacity constrained machines. The computation time to findthe feasible time slot on the machine is reduced by log and modify each machine's feasible time slot. Thus, thecomputational efficiency is substantially improved. Experimental testing shows that the algorithm has significantmerits for large size problems.
出处
《软件学报》
EI
CSCD
北大核心
1999年第10期1073-1077,共5页
Journal of Software
基金
国家自然科学基金
关键词
JobShop调度
作业车间调度
算法
计算机
Job oriented scheduling (JOS), heuristics algorithm, time slot, job shop scheduling.
