This paper addresses scheduling models in which a contribution of an individual job to the objective function is …. Besides, the same approach works for the models with no prior history of study, e.g., parallel machine scheduling with …

In this paper we consider flow shop scheduling problems with a time-dependent learning effect. The time … cases of the corresponding single machine scheduling problems. We also analyze the worst-case bound of the proposed …

In this note, we investigate the effects of deterioration and learning in single-machine scheduling problems. Although …

In the paper, single machine scheduling problems with a learning effect and a rate-modifying activity are considered …

The note deals with machine scheduling problems with a more general learning effect model, i.e., the actual job …. We show that some single machine scheduling problems are still polynomially solvable under the proposed model. We also … show that some special cases of the flow shop scheduling problems can be solved in polynomial time. …

This paper deals with the machine scheduling problems with the effects of deterioration and learning. In this model the …

The majority of the papers dealing with scheduling deteriorating jobs ignores general deterioration forms, and …

Allocation of specific cutting plans and their scheduling to individual cutting machines presents a combinatorial … function it has to be changed. When the scheduling by genetic algorithms is solvable in a sufficiently short period of time, it …

An alternative heuristic method for scheduling repetitive projects in which resources are limited and activities may be … scheduling problem. …