The paper deals with parallel-machine and open-shop scheduling problems with preemptions and arbitrary nondecreasing objective function. An approach to describe the solution region for these problems and to reduce them to minimization problems on polytopes is proposed. Properties of the solution regions for certain problems are investigated. lt is proved that open-shop problems with unit processing times are equivalent to certain parallel-machine problems, where preemption is allowed at arbitrary time. A polynomial algorithm is presented transforming a schedule of one type into a schedule of the other type
Abstract. We consider the problem of preemptively scheduling a set of n jobs on m (identical, unifor...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
AbstractIn this paper we consider the open shop problem with unit processing times and tree constrai...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic proble...
This paper addresses a multiprocessor generalization of the preemp-tive open-shop scheduling problem...
International audienceIn this paper, we are interested in parallel identical machine scheduling prob...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...
For a scheduling problem to minimize the makespan on parallel machines, we consider schedules with a...
AbstractWe study the problem of optimal preemptive scheduling with respect to a general target funct...
We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of...
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly relate...
The paper deals with the determination of an optimal schedule for the so-called mixed-shop problem w...
We study various classical Open Shop scheduling problems to minimize the makespan. For problems whic...
Ideal schedules reach both minimum maximum completion time and minimum total completion time of jobs...
Abstract. We consider the problem of preemptively scheduling a set of n jobs on m (identical, unifor...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
AbstractIn this paper we consider the open shop problem with unit processing times and tree constrai...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
Scheduling jobs on unrelated parallel machines so as to minimize makespan is one of the basic proble...
This paper addresses a multiprocessor generalization of the preemp-tive open-shop scheduling problem...
International audienceIn this paper, we are interested in parallel identical machine scheduling prob...
AbstractWe consider a problem of scheduling n jobs on two uniform parallel machines. For each job we...
For a scheduling problem to minimize the makespan on parallel machines, we consider schedules with a...
AbstractWe study the problem of optimal preemptive scheduling with respect to a general target funct...
We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of...
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly relate...
The paper deals with the determination of an optimal schedule for the so-called mixed-shop problem w...
We study various classical Open Shop scheduling problems to minimize the makespan. For problems whic...
Ideal schedules reach both minimum maximum completion time and minimum total completion time of jobs...
Abstract. We consider the problem of preemptively scheduling a set of n jobs on m (identical, unifor...
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was o...
AbstractIn this paper we consider the open shop problem with unit processing times and tree constrai...
Add to ORKG