Scheduling problems with the nonlinear effects of learning and deterioration


TOKSARI M. D. , Guner E.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, cilt.45, ss.801-807, 2009 (SCI İndekslerine Giren Dergi) identifier

  • Cilt numarası: 45
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1007/s00170-009-2016-9
  • Dergi Adı: INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • Sayfa Sayıları: ss.801-807

Özet

In this paper, we present both nonlinear job deterioration and nonlinear learning which exist simultaneously. Job deterioration and learning co-exist in many realistic scheduling situations. By the effects of learning and deterioration, we mean that the processing time of a job is defined by the increasing function of its execution start time and position in the sequence. 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. For the case of an m-machine permutation flowshop, we present polynomial time optimal solutions for some special cases of the problems to minimize makespan and total completion time.