Minimizing makespan in a three-stage hybrid flow shop with dedicated machines
In recent years, many studies on scheduling problems with dedicated machines have been carried out. But, few of them have considered the case of more than two stages. This paper aims at filling this gap by addressing the three-stage hybrid flow shop scheduling problem with two dedicated machines in...
Main Authors: | Asma Ouled bedhief, Najoua Dridi |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2018-10-01
|
Series: | International Journal of Industrial Engineering Computations |
Subjects: | |
Online Access: | http://www.growingscience.com/ijiec/Vol10/IJIEC_2018_19.pdf |
Similar Items
-
A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
by: Fardin Ahmadizar, et al.
Published: (2010-12-01) -
<b>Evolutionary heuristic for makespan minimization in no-idle flow shop production systems</b> - doi: 10.4025/actascitechnol.v35i2.12534
by: Marcelo Seido Nagano, et al.
Published: (2013-04-01) -
A heuristic algorithm for scheduling in a flow shop environment to minimize makespan
by: Arun Gupta, et al.
Published: (2015-04-01) -
Job shop scheduling with makespan objective: A heuristic approach
by: Mohsen Ziaee
Published: (2014-04-01) -
A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem
by: Henry Lamos-Díaz, et al.
Published: (2017-01-01)