| SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS ： PROOF OF THEOREMS |
| |
| 引用本文： | TANGGUOCHUN FOULDS,L.R.. SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS ： PROOF OF THEOREMS[J]. 高校应用数学学报(英文版), 1998, 13(4): 427-436. DOI: 10.1007/s11766-998-0055-x |
| |
| 作者姓名： | TANGGUOCHUN FOULDS L.R. |
| |
| 作者单位： | [1]DepartmentofManagement,ShanghaiSecondPolytechnicUniversity,Shanghai200002. [2]DepartmentofManagementSystems,UnivesityofWaikaton,Hamilton,NewZealand. |
| |
| 摘 要： | This report is virtually the appendix part of the author‘s previous paper which ineludes the proofs for the theorems and lemmas.
|
| 关 键 词： | 简单机床作业进度表 成本压缩 机组时间控制 多目标规划 算法证明 |
| 收稿时间： | 1997-09-01 |
Single machine scheduling with controllable processing times and compression costs:proof of theorems |
| |
| Tang Guochun,L. R. Foulds. Single machine scheduling with controllable processing times and compression costs:proof of theorems[J]. Applied Mathematics A Journal of Chinese Universities, 1998, 13(4): 427-436. DOI: 10.1007/s11766-998-0055-x |
| |
| Authors: | Tang Guochun L. R. Foulds |
| |
| Affiliation: | (1) Department of Management, Shanghai Second Polytechnic University, 200002, Shanghai;(2) Department of Management Systems, Univesity of Waikaton, Hamilton, New Zealand |
| |
| Abstract: | This report is virtually the appendix part of the author’s previous paper which includes the proofs for the theorems and lemmas. Supported by the National Natural Science Foundation of China (69484003) to the first author. |
| |
| Keywords: | Machine scheduling problems controllable processing times uniform compression time and cost dominance set lateness crash activities polynomial time algorithm |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
