- -

An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects

Show full item record

Li, X.; Yang, Z.; Ruiz García, R.; Chen, T.; Sui, S. (2018). An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Information Sciences. 453:408-425. https://doi.org/10.1016/j.ins.2018.04.038

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

Files in this item

Item Metadata

Title: An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
Author: Li, Xiaoping Yang, Z. Ruiz García, Rubén Chen, T. Sui, S.
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:
[EN] This paper addresses a sequence dependent setup times no-wait flowshop with learning and forgetting effects to minimize total flowtime. This problem is NP-hard and has never been considered before. A position-based ...[+]
Subjects: Scheduling , Sequence dependent setup times , Learning and forgetting effects , No-wait flowshop
Copyrigths: Reconocimiento - No comercial - Sin obra derivada (by-nc-nd)
Source:
Information Sciences. (issn: 0020-0255 )
DOI: 10.1016/j.ins.2018.04.038
Publisher:
Elsevier
Publisher version: https://doi.org/10.1016/j.ins.2018.04.038
Project ID:
info:eu-repo/grantAgreement/NSFC//61572127/
info:eu-repo/grantAgreement/NSFC//61272377/
info:eu-repo/grantAgreement/Natural Science Foundation of Jiangsu Province//12KJA630001/
info:eu-repo/grantAgreement/MINECO//DPI2015-65895-R/ES/OPTIMIZATION OF SCHEDULING PROBLEMS IN CONTAINER YARDS/
Thanks:
This work is supported by the National Natural Science Foundation of China (Nos. 61572127, 61272377), the Collaborative Innovation Center of Wireless Communications Technology and the Key Natural Science Fund for Colleges ...[+]
Type: Artículo

recommendations

 

This item appears in the following Collection(s)

Show full item record