The single resource scheduling problem is commonly applicable in practice not only when there is a single resource but also in some multiple-resource production systems where only one of the resources is bottle neck. Thus, the single resource (machine) scheduling problem has been widely addressed in the scheduling literature. In this paper, the single machine scheduling problem with uncertain a...

We consider an extension of the mean inactivity time based on a non-negative weight function. show various properties new notion, and relate it to functions interest in reliability theory information measures, such as dynamic cumulative entropy, past varentropy, weighted entropy. Moreover, comparison times, we introduce study stochastic order compare with other suitable orders. also discuss som...

The ever increasing adoption of mobile devices with limited energy storage capacity, on the one hand, and more awareness of the environmental impact of massive data centres and server pools, on the other hand, have both led to an increased interest in energy management algorithms. In this talk we will present several new constant factor approximation algorithms for energy aware scheduling probl...

This paper addresses some single-machine scheduling problems with past-sequence-dependent (p-s-d) delivery times and deteriorating jobs. By the past-sequence-dependent (p-s-d) delivery times, we mean that the delivery time of any job is proportional to the job’s waiting time. It is assumed that the deterioration process reflects a increase in the process time as a function of the job’s starting...

In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed job...

In this paper, we consider the scheduling problems with exponential learning effect. By the exponential learning effect, we mean that the processing time of a job is defined by an exponent function of the sum of the normal processing times of the already processed jobs. We consider the following objective functions: the makespan, the total completion time, the sum of the quadratic job completio...