Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por autor "Pan, Quan-Ke"

Mostrando ítems 1-5 de 5

A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime

Pan, Quan-Ke; Ruiz García, Rubén (Elsevier, 2013-01)

[EN] In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature ...
An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem

Pan, Quan-Ke; Ruiz García, Rubén (Elsevier, 2014-04)

In the no-idle flowshop, machines cannot be idle after finishing one job and before starting the next one. Therefore, start times of jobs must be delayed to guarantee this constraint. In practice machines show this ...
An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

Pan, Quan-Ke; Ruiz García, Rubén (Elsevier, 2012-04)

Lot-streaming flow shops have important applications in different industries including textile, plastic, chemical, semiconductor and many others. This paper considers an n-job m-machine lot-streaming flow shop scheduling ...
Iterated Greedy methods for the distributed permutation flowshop scheduling problem

Ruiz García, Rubén; Pan, Quan-Ke; Naderi, Bahman (Elsevier, 2019-03)

[EN] Large manufacturing firms operate more than one production center. As a result, in relation to scheduling problems, which factory manufactures which product is an important consideration. In this paper we study an ...
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows

Pan, Quan-Ke; Ruiz García, Rubén; Alfaro-Fernandez, Pedro (Elsevier, 2017-04)

[EN] In practice due dates usually behave more like intervals rather than specific points in time. This paper studies hybrid flowshops where jobs, if completed inside a due window, are considered on time. The objective is ...