- -

Local search methods for the flowshop scheduling problem with flowtime minimization

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Local search methods for the flowshop scheduling problem with flowtime minimization

Show full item record

Quan-Ke Pan; Ruiz García, R. (2012). Local search methods for the flowshop scheduling problem with flowtime minimization. European Journal of Operational Research. 222(1):31-43. doi:10.1016/j.ejor.2012.04.034

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

Files in this item

Item Metadata

Title: Local search methods for the flowshop scheduling problem with flowtime minimization
Author: Quan-Ke Pan Ruiz García, Rubén
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:
Flowshop scheduling is a very active research area. This problem still attracts a considerable amount of interest despite the sheer amount of available results. Total flowtime minimization of a flowshop has been actively ...[+]
Subjects: Scheduling , Flowshop , Flowtime , Local search , Metaheuristics
Copyrigths: Reserva de todos los derechos
Source:
European Journal of Operational Research. (issn: 0377-2217 )
DOI: 10.1016/j.ejor.2012.04.034
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.ejor.2012.04.034
Thanks:
This research is partially supported by National Science Foundation of China under Grants 61174187, 60874075, and Basic scientific research foundation of Northeast University under Grant N110208001, and Science Foundation ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record