摘要

In this paper, we consider the scheduling a set of deteriorating jobs on a single processor. We propose a model which reflects real life situations in which the processing time of jobs change depending on its initial processing time (deteriorating jobs) and activities, such as machine maintenance or a break for workers. A rate-modifying activity (rma) is a maintenance activity given to a machine to restore it to its original state. The general problem we deal with in this study is to determine the job sequence, the number of rmas, and rma positions within the work sequence. We formulate a unique integer program to solve this model for makespan and total completion time objectives. We also propose efficient heuristic algorithms for solving large size problems for both makespan and total completion time objectives.

  • 出版日期2011-11