Further Research on the Sequencing Problem Based on the Smallest Number of Times of Changing Jobs
再论以任务切换次数为指标的排序问题

Keywords: sequencing,change,structural graph,group of machines,``relay race' method for arranging jobs,DFS method
排序,切换,结构图,机组,“接力式”任务安排方法,DFS法

Full-Text   Cite this paper   Add to My Lib

Abstract:

This paper gives a more satisfactory method for solving the sequencing problem based on the smallest number of times of changing jobs.

Full-Text