Skip to main content
Conference Proceedings

Heuristics for the Hybrid Flow Shop Scheduling Problem with Parallel Machines at the First Stage and Two Dedicated Machines at the Second Stage

Advances in Intelligent Systems and Computing (2018) 736 693-701
DOI: 10.1007/978-3-319-76348-4_67
1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this article, we present four heuristics for solving the problem of the hybrid flow shop scheduling problem denoted HFS with parallel machines at the first stage and two dedicated machines at the second stage. We compare heuristics with lower bounds and upper bounds generated by a mathematical model.

Author supplied keywords

Cite

CITATION STYLE

APA

Nabli, Z., Khalfallah, S., & Korbaa, O. (2018). Heuristics for the Hybrid Flow Shop Scheduling Problem with Parallel Machines at the First Stage and Two Dedicated Machines at the Second Stage. In Advances in Intelligent Systems and Computing (Vol. 736, pp. 693–701). Springer Verlag. https://doi.org/10.1007/978-3-319-76348-4_67

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free