A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
RAIRO-Oper. Res., 48 2 (2014) 235-254
Published online: 2014-03-07
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Scheduling in manufacturing with transportation: Classification and solution techniques
Amir Hosseini, Alena Otto and Erwin PeschEuropean Journal of Operational Research 315 (3) 821 (2024)
https://doi.org/10.1016/j.ejor.2023.10.013
888 68 (2024)
https://doi.org/10.1007/978-3-031-75013-7_7
Scheduling a multi-agent flow shop with two scenarios and release dates
Xinyue Wang, Tao Ren, Danyu Bai, Feng Chu, Yaodong Yu, Fanchun Meng and Chin-Chia WuInternational Journal of Production Research 62 (1-2) 421 (2024)
https://doi.org/10.1080/00207543.2023.2188646
Exact method for the two-machine flow-shop problem with time delays
Mohamed Amine Mkadem, Aziz Moukrim and Mehdi SerairiAnnals of Operations Research 298 (1-2) 375 (2021)
https://doi.org/10.1007/s10479-018-3082-x
An Improved Evolution Strategy Hybridization With Simulated Annealing for Permutation Flow Shop Scheduling Problems
Bilal Khurshid, Shahid Maqsood, Muhammad Omair, et al.IEEE Access 9 94505 (2021)
https://doi.org/10.1109/ACCESS.2021.3093336
Single-machine scheduling problem with fuzzy time delays and mixed precedence constraints
Hui Wu and Bing WangJournal of Intelligent & Fuzzy Systems 38 (2) 2231 (2020)
https://doi.org/10.3233/JIFS-191007
A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem
Caio Paziani Tomazella and Marcelo Seido NaganoExpert Systems with Applications 158 113556 (2020)
https://doi.org/10.1016/j.eswa.2020.113556
The Non-Permutation Flow-Shop scheduling problem: A literature review
Daniel Alejandro Rossit, Fernando Tohmé and Mariano FrutosOmega 77 143 (2018)
https://doi.org/10.1016/j.omega.2017.05.010
0690 (2017)
https://doi.org/10.1109/CoDIT.2017.8102675
Minimizing the total completion time in a two-machine flowshop problem with time delays
Mohamed Kais Msakni, Wael Khallouli, Mohamed Al-Salem and Talel LadhariEngineering Optimization 48 (7) 1164 (2016)
https://doi.org/10.1080/0305215X.2015.1099639