Mostra el registre d'ítem simple

dc.contributor.authorLian, Lian
dc.contributor.authorMesghouni, Khaled
dc.date.accessioned2014-06-10T10:23:04Z
dc.date.available2014-06-10T10:23:04Z
dc.date.issued2014-05
dc.identifier.citationLian, Lian; Mesghouni, Khaled. Comparative study of heuristics algorithms in solving flexible job shop scheduling problem with condition based maintenance. "Journal of Industrial Engineering and Management", Maig 2014, vol. 7, núm. 2, p. 518-531.
dc.identifier.issn2013-0953
dc.identifier.urihttp://hdl.handle.net/2099/14822
dc.description.abstractPurpose: This paper focuses on a classic optimization problem in operations research, the flexible job shop scheduling problem (FJSP), to discuss the method to deal with uncertainty in a manufacturing system. Design/methodology/approach: In this paper, condition based maintenance (CBM), a kind of preventive maintenance, is suggested to reduce unavailability of machines. Different to the simultaneous scheduling algorithm (SSA) used in the previous article (Neale & Cameron,1979), an inserting algorithm (IA) is applied, in which firstly a pre-schedule is obtained through heuristic algorithm and then maintenance tasks are inserted into the pre-schedule scheme. Findings: It is encouraging that a new better solution for an instance in benchmark of FJSP is obtained in this research. Moreover, factually SSA used in literature for solving normal FJSPPM (FJSP with PM) is not suitable for the dynamic FJSPPM. Through application in the benchmark of normal FJSPPM, it is found that although IA obtains inferior results compared to SSA used in literature, it performs much better in executing speed. Originality/value: Different to traditional scheduling of FJSP, uncertainty of machines is taken into account, which increases the complexity of the problem. An inserting algorithm (IA) is proposed to solve the dynamic scheduling problem. It is stated that the quality of the final result depends much on the quality of the pre-schedule obtained during the procedure of solving a normal FJSP. In order to find the best solution of FJSP, a comparative study of three heuristics is carried out, the integrated GA, ACO and ABC. In the comparative study, we find that GA performs best in the three heuristic algorithms. Meanwhile, a new better solution for an instance in benchmark of FJSP is obtained in this research.
dc.format.extent14 p.
dc.language.isoeng
dc.publisherOmniaScience
dc.rightsAttribution-NonCommercial 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
dc.subject.lcshAlgorithms
dc.subject.otherCondition based Maintenance
dc.subject.otherFlexible Job Shop Scheduling Problem
dc.subject.otherGenetic Algorithm
dc.subject.otherAnt Colony Optimization
dc.subject.otherArtificial Bee Colony Algorithm
dc.titleComparative study of heuristics algorithms in solving flexible job shop scheduling problem with condition based maintenance
dc.typeArticle
dc.subject.lemacAlgorismes
dc.identifier.dlB-28744-2008
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
local.citation.authorLian, Lian; Mesghouni, Khaled
local.citation.publicationNameJournal of Industrial Engineering and Management
local.citation.volume7
local.citation.number2
local.citation.startingPage518
local.citation.endingPage531


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple