Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates

  • Authors:
  • Shih-Wei Lin;Zne-Jung Lee;Kuo-Ching Ying;Chung-Cheng Lu

  • Affiliations:
  • Department of Information Management, Chang Gung University, Taoyuan, Taiwan;Department of Information Management, Huafan University, Taipei, Taiwan;Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan;Graduate Institute of Information and Logistics Management, National Taipei University of Technology, Taipei, Taiwan

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we consider an identical parallel machine scheduling problem with sequence-dependent setup times and job release dates. An improved iterated greedy heuristic with a sinking temperature is presented to minimize the maximum lateness. To verify the developed heuristic, computational experiments are conducted on a well-known benchmark problem data set. The experimental results show that the proposed heuristic outperforms the basic iterated greedy heuristic and the state-of-art algorithms on the same benchmark problem data set. It is believed that this improved approach will also be helpful for other applications.