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 ...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.展开更多
Abstract A single machine scheduling problem with controllable processing times and compression costs is considered.The objective is to find an optimal sequence to minimize the cost of completion times and the cost of...Abstract A single machine scheduling problem with controllable processing times and compression costs is considered.The objective is to find an optimal sequence to minimize the cost of completion times and the cost of compression.The complexity of this problem is still unknown.In Part I of this paper,the authors have considered a special case where the compression times and the compression costs are equal among all jobs.Such a problem appears polynomially solvable by developing an O(n 2) algorithm.In this part(Part Ⅱ),a general case where the controllable processing times and the compression costs are not equal is discussed.Authors propose here two heuristics with the first based on some previous work and the second based on the algorithm developed in Part Ⅰ.Computational results are presented to show the efficiency and the robustness of these heuristics.展开更多
文摘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.
文摘Abstract A single machine scheduling problem with controllable processing times and compression costs is considered.The objective is to find an optimal sequence to minimize the cost of completion times and the cost of compression.The complexity of this problem is still unknown.In Part I of this paper,the authors have considered a special case where the compression times and the compression costs are equal among all jobs.Such a problem appears polynomially solvable by developing an O(n 2) algorithm.In this part(Part Ⅱ),a general case where the controllable processing times and the compression costs are not equal is discussed.Authors propose here two heuristics with the first based on some previous work and the second based on the algorithm developed in Part Ⅰ.Computational results are presented to show the efficiency and the robustness of these heuristics.
