SOME SCHEDULING PROBLEMS WITH PAST SEQUENCE DEPENDENT SETUP TIMES UNDER THE EFFECTS OF NONLINEAR DETERIORATION AND TIME-DEPENDENT LEARNING

Creative Commons License

TOKSARI M. D., Oron D., GÜNER E.

RAIRO-OPERATIONS RESEARCH, cilt.44, sa.2, ss.107-118, 2010 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 44 Sayı: 2
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1051/ro/2010009
  • Dergi Adı: RAIRO-OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.107-118
  • Anahtar Kelimeler: Scheduling, single Machine, past sequence dependent (p-s-d) setup times, time-dependent learning effect, deterioration jobs, SINGLE, JOBS
  • Gazi Üniversitesi Adresli: Evet

Özet

This paper studies scheduling problems which include a combination of nonlinear job deterioration and a time-dependent learning effect. We use past sequence dependent (p-s-d) setup times, which is first introduced by Koulamas and Kyparisis [Eur. J. Oper. Res. 187 (2008) 1045-1049]. They considered a new form of setup times which depend on all already scheduled jobs from the current batch. Job deterioration and learning co-exist in various real life scheduling settings. By the effects of learning and deterioration, we mean that the processing time of a job is defined by increasing function of its execution start time and a function of the total normal processing time of jobs scheduled prior to it. The following objectives are considered: single machine makespan and sum of completion times (square) and the maximum lateness. For the single-machine case, we derive polynomial-time optimal solutions.