Single-machine group scheduling problems under the effects of deterioration and learning

  • Authors:
  • Suh-Jenq Yang;Dar-Li Yang

  • Affiliations:
  • 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:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates single-machine group scheduling problems with simultaneous considerations of deteriorating and learning effects to minimize the makespan and the total completion time of all jobs. The group setup time is assumed to follow a simple linear time-dependent deteriorating model. Two models of learning for the job processing time are examined in this study. We provided polynomial time solutions for the makespan minimization problems. We also showed that the total completion time minimization problems remain polynomially solvable under agreeable conditions.