Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

13.240 Articles in journals published by the UPC
You are here:
View Item 
  •   DSpace Home
  • Revistes
  • JIEM: Journal of Industrial Engineering and Management
  • 2014, vol. 7, núm. 2
  • View Item
  •   DSpace Home
  • Revistes
  • JIEM: Journal of Industrial Engineering and Management
  • 2014, vol. 7, núm. 2
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Comparative study of heuristics algorithms in solving flexible job shop scheduling problem with condition based maintenance

Thumbnail
View/Open
Lian Lian.pdf (628,8Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2099/14822

Show full item record
Lian, Lian
Mesghouni, Khaled
Document typeArticle
Defense date2014-05
PublisherOmniaScience
Rights accessOpen Access
Attribution-NonCommercial 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial 3.0 Spain
Abstract
Purpose: 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.
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. 
URIhttp://hdl.handle.net/2099/14822
DLB-28744-2008
ISSN2013-0953
Collections
  • JIEM: Journal of Industrial Engineering and Management - 2014, vol. 7, núm. 2 [15]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
Lian Lian.pdf628,8KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina