成果/Result
- Minimizing the number of late jobs under the group technology assumption被引量：28收藏
- 作者：Liu, ZH Yu, WC
- 机构：E China Univ Sci & Technol
- 来源：JOURNAL OF COMBINATORIAL OPTIMIZATION 1999
- 关键词：one-machine scheduling group technology number of late jobs NP-hardness polynomial algorithm
- ON DECOMPOSITION OF THE TOTAL TARDINESS PROBLEM被引量：25收藏
- 作者：Chang, S. Lu, Q. Tang, G. Yu, W.
- 机构：E CHINA UNIV SCI & TECHNOL;WUHAN UNIV;SHANGHAI SECOND POLYTECH UNIV
- 来源：OPERATIONS RESEARCH LETTERS 1995
- 关键词：SCHEDULING THEORY ONE-MACHINE TOTAL TARDINESS PROBLEM DECOMPOSITION THEOREM BACKWARD SHIFT
- Scheduling groups of unit length jobs on two identical parallel machines被引量：8收藏
- 作者：Liu, Zhaohui Yu, Wenci Cheng, T.C. Edwin
- 机构：Hong Kong Polytech Univ;E China Univ Sci & Technol
- 来源：INFORMATION PROCESSING LETTERS 1999
- 关键词：group technology scheduling algorithms
