129
Views
4
CrossRef citations to date
0
Altmetric
Articles

A branch and bound algorithm to solve a two-machine no-wait flowshop scheduling problem with truncated learning function

&
Pages 89-95 | Received 04 Jan 2019, Accepted 23 May 2019, Published online: 08 Jul 2019

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

Read on this site (3)

M. Hajibabaei & J. Behnamian. (2021) Flexible job-shop scheduling problem with unrelated parallel machines and resources-dependent processing times: a tabu search algorithm. International Journal of Management Science and Engineering Management 16:4, pages 242-253.
Read now
Jalal Delaram, Omid Fatahi Valilai, Mahmoud Houshamand & Farid Ashtiani. (2021) A matching mechanism for public cloud manufacturing platforms using intuitionistic Fuzzy VIKOR and deferred acceptance algorithm. International Journal of Management Science and Engineering Management 16:2, pages 107-122.
Read now
J. Behnamian. (2021) Multi-agent capacitated scheduling for profit-maximizing using a decomposition-based branch and cut algorithm. International Journal of Management Science and Engineering Management 16:2, pages 73-82.
Read now

Articles from other publishers (1)

Fatmah Almathkour, Omar Belgacem, Said Toumi & Bassem Jarboui. (2022) Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags. Yugoslav Journal of Operations Research YUJOR 32:1, pages 45-59.
Crossref

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.