[EN] In this paper, we study the unrelated parallel machine scheduling problem with one scarce additional resource to minimise the maximum completion time of the jobs or makespan. Several heuristics are proposed following ...
[EN] In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. ...
Para iniciar esta Tesis Doctoral se buscó un problema de producción sencillo
pero de amplia aplicación práctica que permitiera adaptarlo para llegar
a problemas más generales y de más amplia aplicación. Por este motivo, ...
[EN] In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should ...
[EN] In this paper we study the unrelated parallel machines problem where n independent jobs must be
assigned to one out of m parallel machines and the processing time of each job differs from machine to
machine. We deal ...