A two-stage hybrid flow shop problem with dedicated machine and release date | Zendy

Zouhour Nabli | Zendy; Soulef Khalfallah | Zendy; Ouajdi Korbaa | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A two-stage hybrid flow shop problem with dedicated machine and release date

Author(s) -

Zouhour Nabli,

Soulef Khalfallah,

Ouajdi Korbaa

Publication year - 2018

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2018.07.235

Subject(s) - computer science , job shop scheduling , flow shop scheduling , heuristics , mathematical optimization , scheduling (production processes) , flow (mathematics) , embedded system , mathematics , operating system , routing (electronic design automation) , geometry

This paper presents a mathematical model, three heuristics and two lower bounds in order to solve the hybrid flow shop scheduling problem with parallel machines at the first stage and two dedicated machines at the second stage. Each job is subject to a release date at stage one. The objective is to minimize the makespan.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research