This paper deals with rescheduling on unrelated parallel-machines with compressible processing times, assuming that the arrival of a set of new jobs triggers rescheduling. It formulates this rescheduling problem as an assignment problem with a side constraint and proposes a heuristic to solve it. Computational tests evaluate the efficacy of the heuristic.

1. Introduction
 2. Problem Definitions
 3. The Linear Relaxation Heuristic
 4. Computational Evaluation
  4.1 Instance Generation
  4.2 Computational Results
 5. Conclusions and Recommendationsfor Future Research
 References

• Suhwan Kim(Department of Military Operations Research, Korea National Defense University) | 김수환 Corresponding Author