Browsing by Author "Asokan, P."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problems with maintenance activity
    (Trans Tech Publications Ltd ttp@transtec.ch, 2014) Karthikeyan, S.; Asokan, P.; Chandrasekaran, M.
    This paper presents a novel hybrid discrete firefly algorithm (HDFA) for solving the multi-objective flexible job shop scheduling problem with non fixed availability constraints (FJSP - nfa) due to maintenance activity. Three minimization objectives-the maximum completion time, the workload of the critical machine and the total workload of all machines are considered simultaneously. In this study, the discrete firefly algorithm is adopted to solve the problem, in which the machine assignment and operation sequence are processed by constructing a suitable conversion of the continuous functions as attractiveness, distance and movement, into new discrete functions. In addition the decoding mechanism considering the maintenance activity is presented. A neighbourhood based local search is hybridized to enhance the exploitation capability. Representative benchmark problems are solved in order to evaluate and study the performance of the proposed algorithm. © (2014) Trans Tech Publications, Switzerland.
  • No Thumbnail Available
    Item
    A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problems with maintenance activity
    (2014) Karthikeyan, S.; Asokan, P.; Chandrasekaran, M.
    This paper presents a novel hybrid discrete firefly algorithm (HDFA) for solving the multi-objective flexible job shop scheduling problem with non fixed availability constraints (FJSP - nfa) due to maintenance activity. Three minimization objectives-the maximum completion time, the workload of the critical machine and the total workload of all machines are considered simultaneously. In this study, the discrete firefly algorithm is adopted to solve the problem, in which the machine assignment and operation sequence are processed by constructing a suitable conversion of the continuous functions as attractiveness, distance and movement, into new discrete functions. In addition the decoding mechanism considering the maintenance activity is presented. A neighbourhood based local search is hybridized to enhance the exploitation capability. Representative benchmark problems are solved in order to evaluate and study the performance of the proposed algorithm. � (2014) Trans Tech Publications, Switzerland.