Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems

G.M. Komaki, Ehsan Teymourian and Vahid Kayvanfar

International Journal of Production Research, 2016, vol. 54, issue 4, 963-983

Abstract: Two-stage hybrid flow shop (HFS) scheduling problem followed by single assembly machine is addressed in this paper. To produce the final product, parts need to be processed on the HFS stages and thereafter, several parts are joined under the assembly operations based on the predefined Bill of Materials of the product. The aim of this research is to find the schedule which minimises completion time of the last product, i.e. makespan. For the considered problem, lower bound, heuristic algorithms and two metaheuristic techniques based on artificial immune system are developed. Computational results demonstrate that the proposed lower bound and heuristic algorithms outperform the existent lower bounds and heuristic algorithms.

Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2015.1035815 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:54:y:2016:i:4:p:963-983

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2015.1035815

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().