An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time

Kai Zhou Gao, Ponnuthurai Nagaratnam Suganthan, Quan Ke Pan and Mehmet Fatih Tasgetiren

International Journal of Production Research, 2015, vol. 53, issue 19, 5896-5911

Abstract: This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) algorithm is proposed for FJSP with fuzzy processing time. The objective is to minimise maximum fuzzy completion time. A simple and effective heuristic rule is proposed to initialise harmony population. Extensive computational experiments are carried out using five benchmark cases with eight instances from remanufacturing. The proposed heuristic rule is evaluated using five benchmark cases. The proposed DHS algorithm is compared to six metaheuristics. The results and comparisons show the effectiveness and efficiency of DHS for solving FJSP with fuzzy processing time.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2015.1020174 (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:53:y:2015:i:19:p:5896-5911

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

DOI: 10.1080/00207543.2015.1020174

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