9
Views
4
CrossRef citations to date
0
Altmetric
Theoretical Paper

Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH)

&
Pages 1704-1710 | Received 01 Jan 2009, Accepted 01 Jun 2010, Published online: 21 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

A Corominas, A García-Villoria & R Pastor. (2013) Technical note: a systematic procedure based on CALIBRA and the Nelder & Mead algorithm for fine-tuning metaheuristics. Journal of the Operational Research Society 64:2, pages 276-282.
Read now

Articles from other publishers (3)

Da-Yoon Nam, Woo-Kyung Jung, Hyeon-Deok Han & Jong-Ki Han. (2022) An Efficient Algorithm to Select Reference Views for Virtual View Synthesis. IEEE Access 10, pages 62306-62321.
Crossref
Shun Cai, Sanfeng Zhang, Guoxin Wu, Yongqiang Dong & Taieb Znati. (2014) Minimum cost opportunistic routing with intra-session network coding. Minimum cost opportunistic routing with intra-session network coding.
Masroor Hussain, Robet Barr & Dongmei Chen. (2012) Building-based urban land use classification from vector databases in Manchester, UK. Building-based urban land use classification from vector databases in Manchester, UK.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.