Buscar
Mostrando ítems 1-10 de 31
Flowshop de permutação variante total Flowtime: Um estudo algorítmico
(Universidade Federal do Rio Grande do NorteBrasilUFRNPrograma de Pós-graduação em Sistemas e ComputaçãoCentro de Ciências Exatas e da Terra, 2012-09-14)
This document presents three meta-heuristics approach, GRASP, VNS and particle swarm optimization (PSO) to minimize the total flowtime criterion in flowshop scheduling. The proposed algorithms were compared with the ...
An efficient heuristic for total flowtime minimisation in no-wait flowshops
(SPRINGER LONDON LTD, 2010)
In this paper, we address the problem of scheduling jobs in a no-wait flowshop with the objective of minimising the total completion time. This problem is well-known for being nondeterministic polynomial-time hard, and ...
Reducing mean flow time in permutation flow shop
(PALGRAVE MACMILLAN LTD, 2008)
This paper deals with the traditional permutation flow shop scheduling problem with the objective of minimizing mean flowtime, therefore reducing in-process inventory. A new heuristic method is proposed for the scheduling ...
Diseño de una metaheurística PSO hibridada con la metodología PAES para minimizar Tardiness y Flowtime en un ambiente hybrid flow shop
(Pontificia Universidad Javeriana, 2022)
An ACO-inspired algorithm for minimizing weighted flowtime in cloud-based parameter sweep experiments
(Elsevier, 2013-02)
Parameter Sweep Experiments (PSEs) allow scientists and engineers to conduct experiments by running the same program code against different input data. This usually results in many jobs with high computational requirements. ...
A bio-inspired scheduler for minimizing makespan and flowtime of computational mechanics applications on federated clouds
(IOS Press, 2016-08)
Computational Mechanics (CM) concerns the use of computational methods to study phenomena under the principles of mechanics. A representative CM application is parameter sweep experiments (PSEs), which involves the execution ...
A partial enumeration heuristic for multi-objective flowshop scheduling problems
(Palgrave Publishers LtdBasingstokeInglaterra, 2004)
Diseño de un sistema aplicativo para la programación de personal y rutas del servicio domiciliario del HUSI
(Pontificia Universidad Javeriana, 2019)
Fixed-Parameter approximation schemes for weighted flowtime
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018)
Given a set of n jobs with integral release dates, processing times and weights, it is a natural and
important scheduling problem to compute a schedule that minimizes the sum of the weighted flow
times of the jobs. There ...