perbandingan kinerja algoritma genetika dan algoritma heuristik rajendran untuk penjadualan produksi jenis flow shop
Clicks: 95
ID: 255714
1999
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Star Article
28.2
/100
95 views
18 readers
AI Quality Assessment
Not analyzed
Readership in this journal
StarRanked #38 of 39 articles by views in coatings
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Flow shop scheduling problem is to schedule a production process of n jobs that go through the same process sequence and the same m machines. Most researches are don to accomplish only one objective, i.e. minimizing makespan. The other objective, such as total flow time, or multiple objectives that is minimizing makespan, total flow time and machine idle time, will be more effective in reducing scheduling cost, as written in French (1982). Rajendran algorithm (1995) that solves flow shop problem with multiple objectives will be used to evaluate the proposed algorithm: Genetic Algorithm, developed by Sridhar & Rajendran (1996) on a problem that existed in a shoe factory. Abstract in Bahasa Indonesia : Masalah penjadualan flow shop adalah menjadualkan proses produksi dari masing-masing n job yang mempunyai urutan proses produksi dan melalui m mesin yang sama. Kebanyakan penelitian hanya mengacu pada satu tujuan saja yaitu meminimumkan makespan. Tujuan yang lain, seperti meminimumkan total flow time atau multiple objectives yang meminimumkan makespan, total flow time dan machine idle time akan lebih efektif dalam mengurangi biaya penjadualan, sebagaimana dikatakan oleh French (1982). Algoritma Rajendran (1995) yang menyelesaikan masalah flow shop dengan multiple objectives akan dipergunakan untuk mengevaluasi algoritma usulan: Algoritma Genetika, yang dikembangkan oleh Sridhar & Rajendran (1996) pada suatu masalah yang ditemui di suatu perusahaan sepatu. Kata kunci: flow shop, algoritma genetika, multiple objectives
| Reference Key |
soetanto1999jurnalperbandingan
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Tessa Vanina Soetanto;Ervin Medianti;Didik Wahyudi |
| Journal | coatings |
| Year | 1999 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.