SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

作     者：TANGGUOCHUN FOULDS,L.R. 

作者机构：DepartmentofManagementShanghaiSecondPolytechncUniversityShanghai200002. DepartmentofManagementSystemsUniversityofWaikatoHamiltonNewZealand 

出 版 物：《Applied Mathematics(A Journal of Chinese Universities)》 (高校应用数学学报（英文版）（B辑）)

年 卷 期：1998年第13卷第4期

页      面：417-426页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：National Natural Science Foundation of China  NSFC  (69484003) 

主　　题：Machine scheduling problems controllable processing times uniform compression timeand cost dominance set lateness crash activities polynomial time algorithm 

摘      要：Abstract Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by reallocating resources. In this paper, authors consider a machine scheduling problem with controllable processing times. In the first part of this paper, a special case where the processing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n 2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case. An effective heuristic to the general problem will be presented.