Add to ORKGColloque avec actes et comité de lecture.In this paper we present 2 heuristics to solve a parallel-machine scheduling problem. The problem consists in determining a feasible schedule where each job is defined by a ready date, a processing time different on each machine and a deadline. There are setup times between jobs; these times depend on the sequence. The set of machines is composed of 2 types. The first one is characterized with ``cheap'' machines and the second one with ``expensive'' machines. The objective function is first to find a feasible schedule and second to minimize the cost due to assignment and setup time costs. The heuristics proposed in this paper are based on a decomposition first and on 2 different priority rules second
This paper deals with an unrelated parallel machine scheduling problem with the objective of minimiz...
The problem of scheduling n jobs on m parallel machines is considered where the jobs are partitioned...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
Colloque avec actes et comité de lecture.The scheduling problem dealt with in this paper consists in...
Parallel processor scheduling to minimize maximum tardiness with uniform processors is investigated....
International audienceThis paper presents different methods for solving parallel machine scheduling ...
This paper studies the problem of scheduling jobs on parallel machines with setup times. When a mach...
AbstractWe discuss the problem of scheduling a set of n independent jobs on m parallel machines to m...
We consider parallel machine scheduling problems where the processing of the jobs on the machines in...
Article dans revue scientifique avec comité de lecture.The scheduling problem addressed in this pape...
The scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not alw...
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machin...
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machin...
We consider a problem of scheduling independent jobs on parallel machines to minimize the total comp...
We study four parallelmachines scheduling problems. These problems are different by the criterion to...
This paper deals with an unrelated parallel machine scheduling problem with the objective of minimiz...
The problem of scheduling n jobs on m parallel machines is considered where the jobs are partitioned...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...
Colloque avec actes et comité de lecture.The scheduling problem dealt with in this paper consists in...
Parallel processor scheduling to minimize maximum tardiness with uniform processors is investigated....
International audienceThis paper presents different methods for solving parallel machine scheduling ...
This paper studies the problem of scheduling jobs on parallel machines with setup times. When a mach...
AbstractWe discuss the problem of scheduling a set of n independent jobs on m parallel machines to m...
We consider parallel machine scheduling problems where the processing of the jobs on the machines in...
Article dans revue scientifique avec comité de lecture.The scheduling problem addressed in this pape...
The scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not alw...
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machin...
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machin...
We consider a problem of scheduling independent jobs on parallel machines to minimize the total comp...
We study four parallelmachines scheduling problems. These problems are different by the criterion to...
This paper deals with an unrelated parallel machine scheduling problem with the objective of minimiz...
The problem of scheduling n jobs on m parallel machines is considered where the jobs are partitioned...
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring ...