Short Communication: Note on "Unrelated parallel-machine scheduling with deteriorating maintenance activities"

  • Authors:

  • Suh-Jenq Yang;Chou-Jung Hsu;Dar-Li Yang

  • Affiliations:

  • Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan Tou 542, Taiwan;Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan Tou 542, Taiwan;Department of Information Management, National Formosa University, Yun Lin 632, Taiwan

  • Venue:
  • Computers and Industrial Engineering
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this note, we prove that both problems studied by Cheng et al. [Cheng, T. C. E., Hsu, C.-J., & Yang, D.-L. (2011). Unrelated parallel-machine scheduling with deteriorating maintenance activities. Computers and Industrial Engineering, 60, 602-605] can be solved in O(n^m^+^3) time no matter what the processing time of a job after a maintenance activity is greater or less than its processing time before the maintenance activity, where m is the number of machines and n is the number of jobs.