Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lo...

Descripción completa

Detalles Bibliográficos
Autores principales: Hidri, Lotfi, Gharbi, Anis, Louly, Mohamed Aly
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4281465/
https://www.ncbi.nlm.nih.gov/pubmed/25610911
http://dx.doi.org/10.1155/2014/605198

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4281465/
https://www.ncbi.nlm.nih.gov/pubmed/25610911
http://dx.doi.org/10.1155/2014/605198

Ejemplares similares