In classical scheduling theory job processing times are constant. However, there are many
situations where processing time of a job depends on the starting time of the job in the …

We consider a class of machine scheduling problems in which the processing time of a task
is dependent on its starting time in a schedule. On reviewing the literature on this topic, we …

hebookpresentedtothereaderisdevotedtotime-dependentscheduling. TScheduling problems,
in general, consist in the allocation of resources over time in order to perform a set of jobs …

Recently, interest in scheduling with deteriorating jobs and learning effects has kept
growing. However, research in this area has seldom considered setup times. We introduce a …

We study in this paper a scheduling model in which each task has a normal processing time
which deteriorates as a step function if its starting time is beyond a given deteriorating date …

Scheduling with deteriorating jobs and learning effects has been widely studied. However,
multi-agent scheduling with simultaneous considerations of deteriorating jobs and learning …

We consider a family of problems of scheduling a set of starting time dependent tasks with
release times and linearly increasing/decreasing processing rates on a single machine to …

In many realistic situations, a job processed later consumes more time than the same job
when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job …

This paper deals with a single machine scheduling problem with start time dependent job
processing times. The job processing times are characterized by decreasing linear functions …

Recently, machine scheduling problems with deteriorating jobs have received interestingly
attention from the scheduling research community. Majority of the research assumed that the …