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

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...

Full description

Saved in:
Bibliographic Details
Published inProcedia computer science Vol. 126; pp. 214 - 223
Main Authors Nabli, Zouhour, Khalfallah, Soulef, Korbaa, Ouajdi
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2018
Subjects
Dedicated Machines
Heuristics
Mathematical model
Parallel Machines
Release Date
Parallel Machines
Dedicated Machines
Mathematical model
Heuristics
Release Date
Online AccessGet full text
ISSN1877-0509
1877-0509
DOI10.1016/j.procs.2018.07.235

Cover

More Information
Summary: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.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2018.07.235