Algoritma Differential Evolution Untuk Penjadwalan Flow Shop Banyak Mesin Dengan Multi Obyektif

  • Eko Wiratno S
  • Rudi N
  • Santosa B
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

This research focuses on the development of Differential Evolution(DE) algorithmto solve m-machine flow shopscheduling problems with respect to both makespan and total flow time. Development of DE algorithm is done by modifyingthe adaptive parameter determination procedure in order to change the value of adaptive parameters in each generation,adding local search strategy to the algorithm in order to improve the quality of the resulting solutions, as ewell as modifyingthe crossover in order to reduce computation time. The result indicates that the proposed DE algorithm has proven to bebetter than the original DE algorithm, Genetic Algorithm (GA), and for certain cases it also out performs Multi-ObjectiveAnt Colony System Algorithm (MOCSA).

Cite

CITATION STYLE

APA

Eko Wiratno, S., Rudi, N., & Santosa, B. (2012). Algoritma Differential Evolution Untuk Penjadwalan Flow Shop Banyak Mesin Dengan Multi Obyektif. Jurnal Teknik Industri, 13(1), 1–6. https://doi.org/10.22219/jtiumm.vol13.no1.1-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free