This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m identical parallel machines in order to minimize the makespan. The algorithm produces near-optimal solutions in short computation times. It outperforms alternative heuristics on a series of test problems.21220521
textabstractWe address the problem of scheduling n identical jobs on m uniform parallel machines to ...
We consider the unrelated parallel machine scheduling problem with a makespan objective. We discuss ...
In this report we describe a greedy algorithm to schedule parallel jobs that consist of independent,...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
Given a set of jobs with associated processing times, and a set of identical machines, each of which...
This paper considers the problem of scheduling a set of n independent jobs on m identical parallel m...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
We consider the problem of scheduling jobs on two parallel identical machines where an optimal sched...
In this paper we present constructive algorithms for the classical deterministic scheduling problem ...
A recent paper (Davidovi'et al 2012) presented a bee colony metaheuristic for scheduling independen...
[EN] In this paper we study the unrelated parallel machines problem where n independent jobs must be...
Resumo: Não informadoAbstract: This thesis deals with the problem of scheduling n jobs on m identica...
textabstractWe address the problem of scheduling n identical jobs on m uniform parallel machines to ...
We consider the unrelated parallel machine scheduling problem with a makespan objective. We discuss ...
In this report we describe a greedy algorithm to schedule parallel jobs that consist of independent,...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
Given a set of jobs with associated processing times, and a set of identical machines, each of which...
This paper considers the problem of scheduling a set of n independent jobs on m identical parallel m...
We address the problem of minimizing makespan on identical parallel machines. We propose new lower b...
We consider the problem of scheduling jobs on two parallel identical machines where an optimal sched...
In this paper we present constructive algorithms for the classical deterministic scheduling problem ...
A recent paper (Davidovi'et al 2012) presented a bee colony metaheuristic for scheduling independen...
[EN] In this paper we study the unrelated parallel machines problem where n independent jobs must be...
Resumo: Não informadoAbstract: This thesis deals with the problem of scheduling n jobs on m identica...
textabstractWe address the problem of scheduling n identical jobs on m uniform parallel machines to ...
We consider the unrelated parallel machine scheduling problem with a makespan objective. We discuss ...
In this report we describe a greedy algorithm to schedule parallel jobs that consist of independent,...
DOI
Add to ORKG