Buscar
Mostrando ítems 1-10 de 1108
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
(SPRINGER, 2010)
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have ...
Heuristic methods for the single machine scheduling problem with different ready times and a common due date
(TAYLOR & FRANCIS LTDABINGDON, 2012)
The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness ...
Multiobjective parallel machine scheduling in the sawmill industry using memetic algorithms
(2014)
This study presents a multiobjective optimization algorithm that is termed memetic algorithm with compromise search (MACS). This algorithm, proposed by the authors, combines genetic evolution with local search, in the same ...
A memetic algorithm for the total tardiness single machine scheduling problem
(Elsevier Science BvAmsterdamHolanda, 2001)
An ACO approach for the parallel machines scheduling problem
(Sociedad Iberoamericana de Inteligencia Artificial, 2010-06)
The parallel machines scheduling problem (PMSP) comprises the allocation of jobs on the resources of the systems, i.e., a group of machines in parallel. The basic model consists of m identical machines and n jobs. The jobs ...
Optimal algorithms for the batch scheduling problem in OBS networks
(2012)
This paper introduces optimal batch scheduling algorithms for the problem of scheduling batches of bursts in optical burst switching networks. The problem is modelled as a job scheduling problem with identical machines. ...
Comparing meta-heuristic approaches for parallel machine scheduling problems
(Taylor & Francis LtdAbingdonInglaterra, 2002)