Daneshamoz, Fatemeh, Behnamian, Javad. (1397). A lower bound for job shop scheduling problem with a parallel assembly stage by graph coloring approach. , 52(3), 367-378. doi: 10.22059/jieng.2019.219236.1250
Fatemeh Daneshamoz; Javad Behnamian. "A lower bound for job shop scheduling problem with a parallel assembly stage by graph coloring approach". , 52, 3, 1397, 367-378. doi: 10.22059/jieng.2019.219236.1250
Daneshamoz, Fatemeh, Behnamian, Javad. (1397). 'A lower bound for job shop scheduling problem with a parallel assembly stage by graph coloring approach', , 52(3), pp. 367-378. doi: 10.22059/jieng.2019.219236.1250
Daneshamoz, Fatemeh, Behnamian, Javad. A lower bound for job shop scheduling problem with a parallel assembly stage by graph coloring approach. , 1397; 52(3): 367-378. doi: 10.22059/jieng.2019.219236.1250


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب