In this paper we study a large set of single-machine scheduling problems with resource-
dependent processing times that reduce (consolidate) to the same mathematical model. We …

We study resource allocation scheduling with job-dependent learning effect on a single
machine with or without due date assignment considerations. For a convex resource …

In this paper, we study a single machine scheduling problem by simultaneously considering
the processing method of serial-batching, learning effect, resource-dependent processing …

In this paper, we analyse single machine scheduling problems with learning and aging
effects to minimize one of the following objectives: the makespan with release dates, the …

In many real-world production systems, it is important to schedule jobs such that they could
be processed and shipped with no delay. In this paper, we consider the problem of …

This paper considers a parallel-machine scheduling problem with sequence dependent
processing times and periodic maintenance. The time to complete jobs increases as the …

We consider an inverse counterpart of the interval scheduling problem. In the problem, we
are given a set of machines and the objective is to reduce the non-preemptive job intervals …

We consider a single machine scheduling problem with total tardiness criteria and
controllable job-processing times specified by a convex resource consumption function. The …

The paper addresses the problem of maximizing the percentage of on-time jobs in a parallel
machine environment with sequence dependent deterioration. The deterioration of each …

We consider the resource allocation problem under a two-machine flow shop environment
where the job sequence has been determined in advance. The resource is used to reduce …