A BRANCH AND BOUND ALGORITHM TO MINIMIZE THE SINGLE MACHINE MAXIMUM TARDINESS PROBLEM UNDER EFFECTS OF LEARNING AND DETERIORATION WITH SETUP TIMES

TOKSARI M. D.

RAIRO-OPERATIONS RESEARCH, cilt.50, sa.1, ss.211-219, 2016 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 50 Sayı: 1
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1051/ro/2015026
  • Dergi Adı: RAIRO-OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.211-219
  • Anahtar Kelimeler: Maximum tardiness problem, learning effect, deterioration effects, setup times, GROUP-SCHEDULING PROBLEMS, PARALLEL MACHINE, EARLINESS/TARDINESS COSTS, JOBS
  • Erciyes Üniversitesi Adresli: Evet

Özet

This paper sheds light on minimizing the maximum tardiness with processing and setup times under both learning effect and deterioration. In this paper, all the jobs have processing and setup times under effects of learning and deterioration. By the effects of learning and deterioration, we mean that the processing time of a job is defined by an increasing function of its execution start time and position in the sequence. We provide a branch and bound algorithm to minimize the maximum tardiness under effects of learning and deterioration with setup times. Computational experiments show that the proposed algorithm can solve instances up to 800 jobs in reasonable time.