Semantic Scholar uses AI to extract papers important to this topic.
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to… (More)
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of… (More)
This paper studies the single-machine scheduling problem with deteriorating jobs and learning considerations. The objective is to… (More)
Abstract We consider the single machine scheduling problem with resource dependent release times and processing times, in which… (More)
We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform… (More)
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion… (More)
- SIAM J. Discrete Math.
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single… (More)
In this paper we study a single machine scheduling problem in which the job processing times will decrease as a result of… (More)
We consider single-machine on-line scheduling problems where jobs arrive over time. A set of independent jobs has to be scheduled… (More)
- Discrete Applied Mathematics
A single-machine scheduling problem with precedence delays is analyzed. A set of n tasks is to be scheduled on the machine in… (More)