application of genetic algorithm to the technological operations scheduling problem
Clicks: 209
ID: 227667
2008
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
Popular Article
30.0
/100
209 views
35 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #48 of 98 articles by views in journal of the formosan medical association = taiwan yi zhi
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
The basic enterprise task is to satisfy customer requirements: due date, price and quality. Based on experiences from engineers practice of work in Croatian enterprises it could be concluded that enterprises are not able to fulfil obligations to the customer in a way of due dates. One of the basic reasons lies in inappropriate scheduling model that has not had possibility to make plan variants. The paper shows how genetic algorithm could be successfully applied in scheduling model to solve the problem of plan variant. As a basic selection in the paper 3-tournament steady-state selection has been applied.
| Reference Key |
r.2008metalurgijaapplication
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Lujić, R.;Šarić, T.;Šimunović, G. |
| Journal | journal of the formosan medical association = taiwan yi zhi |
| Year | 2008 |
| 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.