Cargando…
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...
Autores principales: | Hidri, Lotfi, Gharbi, Anis, Louly, Mohamed Aly |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
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 |
Ejemplares similares
-
A computational efficient optimization of flow shop scheduling problems
por: Liang, Zhongyuan, et al.
Publicado: (2022) -
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
por: Luo, Qifang, et al.
Publicado: (2014) -
Dataset of metaheuristics for the flow shop scheduling problem with maintenance activities integrated
por: Branda, Antonella, et al.
Publicado: (2021) -
Hybrid Quantum Annealing Heuristic Method for Solving Job Shop Scheduling Problem
por: Kurowski, Krzysztof, et al.
Publicado: (2020) -
Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints
por: Geng, Kaifeng, et al.
Publicado: (2022)