Add to ORKGWe consider the unrelated parallel machine scheduling problem with a makespan objective. We discuss two heuristic approaches and the hybridization of these heuristics with a truncated branch-and-bound procedure. We compare the performances of these heuristics on standard data available in literature and examine the influence of the different heuristic parameters. The computational experiments reveal that the hybrid heuristics are able to compete with the best known results from the literature
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are p...
In this paper we study the unrelated parallel machine scheduling problem with sequence and machine-d...
We consider the unrelated parallel machine scheduling problem with a makespan objective. We discuss ...
We consider the problem of scheduling a number of jobs on a number of unrelated parallel machines in...
Colloque avec actes et comité de lecture.The scheduling problem dealt with in this paper consists in...
This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m...
This work deals with the parallel machines scheduling problem which consists in the assignment of n ...
This paper addresses the unrelated parallel machine scheduling problem with sequence and machine dep...
This paper addresses the unrelated parallel machine scheduling problem with sequence and machine dep...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
[EN] In this paper we study the unrelated parallel machines problem where n independent jobs must be...
AbstractThis paper considers an unrelated parallel machine scheduling problem with the objective of ...
In this paper we present a hybrid exact-heuristic method to improve a branch-and-price algorithm to ...
In this doctoral thesis, we study a widely investigated branch of the operational research domain, i...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are p...
In this paper we study the unrelated parallel machine scheduling problem with sequence and machine-d...
We consider the unrelated parallel machine scheduling problem with a makespan objective. We discuss ...
We consider the problem of scheduling a number of jobs on a number of unrelated parallel machines in...
Colloque avec actes et comité de lecture.The scheduling problem dealt with in this paper consists in...
This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m...
This work deals with the parallel machines scheduling problem which consists in the assignment of n ...
This paper addresses the unrelated parallel machine scheduling problem with sequence and machine dep...
This paper addresses the unrelated parallel machine scheduling problem with sequence and machine dep...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
[EN] In this paper we study the unrelated parallel machines problem where n independent jobs must be...
AbstractThis paper considers an unrelated parallel machine scheduling problem with the objective of ...
In this paper we present a hybrid exact-heuristic method to improve a branch-and-price algorithm to ...
In this doctoral thesis, we study a widely investigated branch of the operational research domain, i...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are p...
In this paper we study the unrelated parallel machine scheduling problem with sequence and machine-d...