Advanced search
Publication Cover
Journal of the Operational Research Society Volume 63, 2012 - Issue 4
Submit an article Journal homepage
57
Views
14
CrossRef citations to date
0
Altmetric
General Paper

Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times

T LadhariEcole Supérieure des Sciences Economiques et Commercials de Tunis, University of TunisTunisia;King Saud UniversityRiyadhSaudi Arabia
,
M K MsakniEcole Polytechnique de Tunis, University of CarthageTunisiaCorrespondence[email protected]
&
A AllahverdiKuwait UniversitySafatKuwait
Pages 445-459 | Published online: 21 Dec 2017

Citations (14)

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

Subscribe to citation updates

Read on this site (1)

Harun Aydilek, Asiye Aydilek & Ali Allahverdi. (2021) Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times. Engineering Optimization 53:8, pages 1417-1430.
Read now

Articles from other publishers (13)

Hajar Sadki, Said Aqil, Jabrane Belabid & Karam Allali. (2023) Multi-Objective Optimization Flow Shop Scheduling Problem Solving the Makespan and Total Flow Time with Sequence Independent Setup Time. Journal of Advanced Manufacturing Systems 23:01, pages 163-184.
Crossref
Yan Qiao, NaiQi Wu, YunFang He, ZhiWu Li & Tao Chen. (2022) Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement. Expert Systems with Applications 208, pages 118068.
Crossref
Hajar Sadki, Jabrane Belabid, Said Aqil & Karam Allali. 2022. Advanced Technologies for Humanity. Advanced Technologies for Humanity 507 518 .
Yujing Jiang, Zhe Zhang, Xue Gong & Yong Yin. (2021) An exact solution method for solving seru scheduling problems with past-sequence-dependent setup time and learning effect. Computers & Industrial Engineering 158, pages 107354.
Crossref
Md. Asadujjaman, Humyun Fuad Rahman, Ripon K. Chakrabortty & Michael J. Ryan. (2021) An Immune Genetic Algorithm for Solving NPV-Based Resource Constrained Project Scheduling Problem. IEEE Access 9, pages 26177-26195.
Crossref
Jabrane Belabid, Said Aqil & Karam Allali. (2020) Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time. Journal of Applied Mathematics 2020, pages 1-11.
Crossref
Jabrane Belabid, Said Aqil & Karam Allali. (2019) Solving flow shop problem with permutation and sequence independent setup time. Solving flow shop problem with permutation and sequence independent setup time.
A. Sioud & C. Gagné. (2018) Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. European Journal of Operational Research 264:1, pages 66-73.
Crossref
Young-Jin An, Yeong-Dae Kim & Seong-Woo Choi. (2016) Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times. Computers & Operations Research 71, pages 127-136.
Crossref
Aymen Sioud & Caroline Gagne. (2016) An MBO algorithm for a flow shop problem with sequence-dependent setup times. An MBO algorithm for a flow shop problem with sequence-dependent setup times.
Ali Allahverdi. (2015) The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research 246:2, pages 345-378.
Crossref
Ali Allahverdi & Harun Aydilek. (2013) The two stage assembly flowshop scheduling problem to minimize total tardiness. Journal of Intelligent Manufacturing 26:2, pages 225-237.
Crossref
Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni & Mehdi Serairi. (2013) The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies. European Journal of Operational Research 231:1, pages 69-78.
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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.