转盘上单机排序问题的可解情形  

The Cases Solvable of Sequencing Problem for Single Machine with Transportation Tuntable

作　　者：徐平生[1] 

机构地区：[1]华东交通大学基础部

出　　处：《铁道师院学报》1998年第1期7-10,共4页Journal of Suzhou Railway Teachers College(Natural Science Edition)

摘　　要：文献［１］中证明，即使只有一台加工机器，带有转盘的流水作业问题的加工全长问题Ｔ１也是强ＮＰ困难的。The processingpan problem T1 of flow process with a transportation turntable is strongly NP-hard even if there is only one machine for processing,which has been testified in the author's previous paper.This paper deals with the cases solvable for the problem T1.

关 键 词：多项式算法 转盘 单机排序 流水作业 排序 

分 类 号：O223[理学—运筹学与控制论]