algoritmo para o problema de seqüenciamento em máquinas paralelas não-relacionadas algorithm to solve the unrelated parallel machine scheduling problem
Article Quality & Performance Metrics
Readership in this journal
PopularRanked #34 of 61 articles by views in Neotropical entomology
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.
Abstract
This work deals with the problem of scheduling n independent jobs on m unrelated parallel machines with the objective of minimizing the makespan (the total elapsed time from the start of execution until all jobs are completed). In this work we propose a new local search algorithm in connection with a powerful neighborhood scheme that uses a structure of intervals and uses the efficiency of the machines for each job. The proposed algorithm, called Mutat, is compared with other algorithms in order to evaluate the quality of the solutions obtained. The new approach finds solutions that overcome, in quality and computational time, the best algorithm of local search found in the literature for this problem.
| Reference Key |
mller2002productionalgoritmo
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Felipe Martins Müller;Odon Bastos Dias;Olinto César Bassi de Araújo |
| Journal | Neotropical entomology |
| Year | 2002 |
| DOI |
10.1590/S0103-65132002000200002
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
ZincirX productsfrom the team behind Journament
-
PatentYazar
Patent drafts for the EPO, USPTO and TürkPatent
From inventor notes to a DOCX draft: description, claims, abstract. The machine drafts, the attorney signs.
See how it works (opens in a new tab) -
Projenator
Have a project idea? Score and plan it with AI
AI scores your idea in five dimensions and builds a phased plan. Your first project is free, no card needed.
Start your first project (opens in a new tab)
Cookies
We use strictly necessary cookies to run the site and keep you signed in. With your permission we would also use Google Analytics to see how the site is used, and Google AdSense to show ads on journal and article pages. Both stay off unless you accept, and you can change your mind at any time. How we use cookies · KVKK notice (Türkiye)
Cookie settings
Comments
No comments yet. Be the first to comment on this article.