- -

An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem

Show full item record

Pan, Q.; Ruiz García, R. (2014). An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem. Omega. 44:41-50. doi:10.1016/j.omega.2013.10.002

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/60278

Files in this item

Item Metadata

Title: An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
Issued date:
Abstract:
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 ...[+]
Subjects: Flowshop , No-idle , Heuristics , Iterated greedy , Local search
Copyrigths: Reserva de todos los derechos
Source:
Omega. (issn: 0305-0483 )
DOI: 10.1016/j.omega.2013.10.002
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.omega.2013.10.002
Thanks:
Quan-Ke Pan is partially supported by the National Science Foundation of China 61174187, Program for New Century Excellent Talents in University (NCET-13-0106), Science Foundation of Liaoning Province in China (2013020016), ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record