| SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS） |
| |
| 引用本文： | TANGGUOCHUN FOULDS,L.R.. SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）[J]. 高校应用数学学报(英文版), 1998, 13(4): 417-426. DOI: 10.1007/s11766-998-0054-y |
| |
| 作者姓名： | TANGGUOCHUN FOULDS L.R. |
| |
| 作者单位： | [1]DepartmentofManagement,ShanghaiSecondPolytechncUniversityShanghai200002. [2]DepartmentofManagementSystems,UniversityofWaikatoHamilton,NewZealand, |
| |
| 摘 要： | 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 realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing 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 genera/ problem will be presented.
|
| 关 键 词： | 简单机床作业进度表 成本压缩 机组时间控制 多目标规划 |
| 收稿时间： | 1997-09-01 |
Single machine scheduling with controllable processing times and compression costs (part i: equal times and costs) |
| |
| Tang Guochun,L. R. Foulds. Single machine scheduling with controllable processing times and compression costs (part i: equal times and costs)[J]. Applied Mathematics A Journal of Chinese Universities, 1998, 13(4): 417-426. DOI: 10.1007/s11766-998-0054-y |
| |
| Authors: | Tang Guochun L. R. Foulds |
| |
| Affiliation: | (1) Department of Management, Shanghai Second Polytechnic University, 200002, Shanghai;(2) Department of Management Systems, University of Waikato, Hamilton, New Zealand |
| |
| 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(n2) 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. Supported by the National Natural Science Foundation of China (69484003) to the first author. |
| |
| Keywords: | Machine scheduling problems controllable processing times uniform compression timeand cost dominance set lateness crash activities polynomial time algorithm |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
