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

This paper studies scheduling problems which include acombination of nonlinear job deterioration and a time-dependent learn-ing effect. We use past sequence dependent (p-s-d) setup times, whichis first introduced by Koulamas and Kyparisis [ Eur. J. O per. Res. 187(2008) 1045–1049]. They considered a new form of setup times whichdepend on all already scheduled jobs from the current batch. Job de-terioration and learning co-exist in various real life scheduling settings.By the effects of learning and deterioration, we mean that the pro-cessing time of a job is defined by increasing function of its executionstart time and a function of the total normal processing time of jobsscheduled prior to it. The following objectives are considered: singlemachine makespan and sum of completion times (square) and the max-imum lateness. For the single-machine case, we derive polynomial-timeoptimal solutions