Heuristic algorithms for the two-stage hybrid flowshop problem

Mohamed Haouari; Rym M'Hallah

doi:10.1016/s0167-6377(97)00004-7

Heuristic algorithms for the two-stage hybrid flowshop problem

Mohamed Haouari^*, Rym M'Hallah

^*Corresponding author for this work

Engineering

Research output: Contribution to journal › Article › peer-review

82 Citations (Scopus)

Abstract

A two-stage Hybrid Flowshop Problem (FS_m1,_m2) is a two-center shop with several parallel machines per center and n jobs to be processed on at most one machine per center. The objective consists of minimizing the maximum completion time. Two two-phase methods based on Simulated Annealing and Tabu Search are proposed. The results are compared with solutions provided by existing heuristics, and with a new derived lower bound. These comparisons show the superiority of the derived lower bound and the efficiency of the proposed heuristic. The Tabu search based heuristic yields the optimal solution for 35% of the problems. Its average relative error is 0.82%.

Original language	English
Pages (from-to)	43-53
Number of pages	11
Journal	OPERATIONS RESEARCH LETTERS
Volume	21
Issue number	1
DOIs	https://doi.org/10.1016/s0167-6377(97)00004-7
Publication status	Published - Aug 1997

Keywords

Flowshop scheduling
Simulated annealing
Tabu search

Access to Document

10.1016/s0167-6377(97)00004-7

Cite this

@article{a0500e5b2539456b885d6a409f9e1e56,

title = "Heuristic algorithms for the two-stage hybrid flowshop problem",

abstract = "A two-stage Hybrid Flowshop Problem (FSm1,m2) is a two-center shop with several parallel machines per center and n jobs to be processed on at most one machine per center. The objective consists of minimizing the maximum completion time. Two two-phase methods based on Simulated Annealing and Tabu Search are proposed. The results are compared with solutions provided by existing heuristics, and with a new derived lower bound. These comparisons show the superiority of the derived lower bound and the efficiency of the proposed heuristic. The Tabu search based heuristic yields the optimal solution for 35% of the problems. Its average relative error is 0.82%.",

keywords = "Flowshop scheduling, Simulated annealing, Tabu search",

author = "Mohamed Haouari and Rym M'Hallah",

note = "Funding Information: The authors would like to thank Dr.G.L. Vairak-tarakis for his encouragement. The first author would like to acknowledge support from the Tunisian Secr6tariat d'Etat/t la Recherche Scientifique et ~t la Technologie. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",

year = "1997",

month = aug,

doi = "10.1016/s0167-6377(97)00004-7",

language = "English",

volume = "21",

pages = "43--53",

journal = "OPERATIONS RESEARCH LETTERS",

issn = "0167-6377",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Heuristic algorithms for the two-stage hybrid flowshop problem

AU - Haouari, Mohamed

AU - M'Hallah, Rym

N1 - Funding Information: The authors would like to thank Dr.G.L. Vairak-tarakis for his encouragement. The first author would like to acknowledge support from the Tunisian Secr6tariat d'Etat/t la Recherche Scientifique et ~t la Technologie. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.

PY - 1997/8

Y1 - 1997/8

N2 - A two-stage Hybrid Flowshop Problem (FSm1,m2) is a two-center shop with several parallel machines per center and n jobs to be processed on at most one machine per center. The objective consists of minimizing the maximum completion time. Two two-phase methods based on Simulated Annealing and Tabu Search are proposed. The results are compared with solutions provided by existing heuristics, and with a new derived lower bound. These comparisons show the superiority of the derived lower bound and the efficiency of the proposed heuristic. The Tabu search based heuristic yields the optimal solution for 35% of the problems. Its average relative error is 0.82%.

AB - A two-stage Hybrid Flowshop Problem (FSm1,m2) is a two-center shop with several parallel machines per center and n jobs to be processed on at most one machine per center. The objective consists of minimizing the maximum completion time. Two two-phase methods based on Simulated Annealing and Tabu Search are proposed. The results are compared with solutions provided by existing heuristics, and with a new derived lower bound. These comparisons show the superiority of the derived lower bound and the efficiency of the proposed heuristic. The Tabu search based heuristic yields the optimal solution for 35% of the problems. Its average relative error is 0.82%.

KW - Flowshop scheduling

KW - Simulated annealing

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=0003899269&partnerID=8YFLogxK

U2 - 10.1016/s0167-6377(97)00004-7

DO - 10.1016/s0167-6377(97)00004-7

M3 - Article

AN - SCOPUS:0003899269

SN - 0167-6377

VL - 21

SP - 43

EP - 53

JO - OPERATIONS RESEARCH LETTERS

JF - OPERATIONS RESEARCH LETTERS

IS - 1

ER -

Heuristic algorithms for the two-stage hybrid flowshop problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this