Hybrid flow shop scheduling with parallel batching

Mohammad Reza Amin-Naseri and Mohammad Ali Beheshti-Nia

International Journal of Production Economics, 2009, vol. 117, issue 1, 185-196

Abstract: In this research the problem of parallel batch scheduling in a hybrid flow shop environment with minimizing Cmax is studied. In parallel batching it is assumed that machines in some stages are able to process a number of operations simultaneously. Since the problem is NP-hard, three heuristic algorithms are developed to give near optimal solutions. Since this problem has not been studied previously, therefore, a lower bound is developed for evaluating the performance of the proposed heuristics. Several test problems have been solved using these heuristics and results compared. To further enhance the solution quality, a three dimensional genetic algorithm (3DGA) is also developed. Several test problems have been solved using 3DGA and the results indicate its superiority to the other heuristics.

Keywords: Scheduling; Hybrid; flow; shop; Parallel; batching; Genetic; algorithms; Heuristics (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(08)00354-X
Full text for ScienceDirect subscribers only

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:eee:proeco:v:117:y:2009:i:1:p:185-196

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().