Minimizing makespan for flowshop scheduling problem with random and bounded processing times | AVESİS

Ankara Yıldırım Beyazıt University Research Information System

Minimizing makespan for flowshop scheduling problem with random and bounded processing times

Copy For Citation

International Journal of Business and Technology Management, vol.3, pp.49-52, 2021 (Peer-Reviewed Journal)

Publication Type: Article / Article
Volume: 3
Publication Date: 2021
Journal Name: International Journal of Business and Technology Management
Page Numbers: pp.49-52
Ankara Yıldırım Beyazıt University Affiliated: Yes