Author:
BAŞAR Ramazan,ENGİN Orhan
Publisher
Canakkale Onsekiz Mart University
Reference64 articles.
1. Akhshabi, M., Moghaddam, R.T. ve Roodposhti, F.R. (2014). A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time, Int J Adv Manuf Technol, 70: 1181-1188. https://link.springer.com/content/pdf/10.1007/s00170-013-5351-9.pdf
2. Allahverdi A. ve Aydilek H. (2014). Total completion time with makespan constraint in no-wait flowshops with setup times, European Journal of Operational Research, 238: 724-734. https://doi.org/10.1016/j.ejor.2014.04.031
3. Allahverdi, A., Aydilek, H. ve Aydilek, A. (2020). No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan, Applied Mathematics and Computation, 365: 124688. https://doi.org/10.1016/j.amc.2019.124688
4. Allahverdi, M., Aydilek, H., Aydilek, A. ve Allahverdi, A. (2021). A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure, Journal of Industrial & Management Optimization, 17(4): 1973-1991. http://dx.doi.org/10.3934/jimo.2020054
5. Alsaidi, S. A. A. A., Muhsen, D. K. ve Ali, S. M. (2020). Improved scatter search algorithm based on meerkat clan algorithm to solve NP-hard problems, Periodicals of Engineering and Natural Sciences (PEN), 8(3): 1555-1565. http://dx.doi.org/10.21533/pen.v8i3.1563.g642
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献