Narrow search
Showing 1 - 5 of 5
Cover Image
An improved lower bound for a bi-criteria scheduling problem
Yan, Jin - In: Operations research letters 36 (2008) 1, pp. 57-60
Persistent link: https://www.econbiz.de/10003768500
Cover Image
A memetic algorithm for the Minimum Sum Coloring Problem
Jin, Yan; Hao, Jin-Kao; Hamiez, Jean-Philippe - In: Computers & operations research : and their … 43 (2014), pp. 318-327
Persistent link: https://www.econbiz.de/10010242739
Cover Image
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi; Lin, Weibo; Hao, Jin-Kao; Xiao, Mingyu; Jin, Yan - In: European journal of operational research : EJOR 297 (2022) 1, pp. 27-39
Persistent link: https://www.econbiz.de/10013258540
Cover Image
New scheduling algorithms and digital tool for dynamic permutation flowshop with newly arrived order : new scheduling algorithms and digital tool for dynamic permutation flowshop w...
Liu, Weibo; Jin, Yan; Price, Mark - In: International journal of production research 55 (2017) 11/12, pp. 3234-3248
Persistent link: https://www.econbiz.de/10011655189
Cover Image
A new improved NEH heuristic for permutation flowshop scheduling problems
Liu, Weibo; Jin, Yan; Price, Mark - In: International journal of production economics 193 (2017), pp. 21-30
Persistent link: https://www.econbiz.de/10011758178