%0 Journal Article
%T Further Research on the Sequencing Problem Based on the Smallest Number of Times of Changing Jobs<br>再论以任务切换次数为指标的排序问题
%A YAO Zhongren
%A <br>姚仲仁
%J 系统工程理论与实践
%D 1999
%I 
%X This paper gives a more satisfactory method for solving the sequencing problem based on the smallest number of times of changing jobs.
%K sequencing
%K change
%K structural graph
%K group of machines
%K ``relay race' method for arranging jobs
%K DFS method<br>排序
%K 切换
%K 结构图
%K 机组
%K “接力式”任务安排方法
%K DFS法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=097B8E369FD8FDFC&yid=B914830F5B1D1078&vid=2A8D03AD8076A2E3&iid=E158A972A605785F&sid=7801E6FC5AE9020C&eid=659D3B06EBF534A7&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=2