Narrow search
Showing 1 - 6 of 6
Cover Image
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
Li, Shisheng; Yuan, Jinjiang - In: Journal of combinatorial optimization 19 (2010) 1, pp. 84-93
Persistent link: https://www.econbiz.de/10003952567
Cover Image
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Wan, Long; Yuan, Jinjiang - In: Operations research letters 41 (2013) 4, pp. 363-365
Persistent link: https://www.econbiz.de/10009772782
Cover Image
An inverse model for the most uniform problem
Wang, Qin; Yuan, Jinjiang; Zhang, Jianzhong - In: Operations research letters 36 (2008) 1, pp. 26-30
Persistent link: https://www.econbiz.de/10003768462
Cover Image
Unary NP-hardness of minimizing the number of tardy jobs with deadlines
Yuan, Jinjiang - In: Journal of scheduling 20 (2017) 2, pp. 211-218
Persistent link: https://www.econbiz.de/10011691589
Cover Image
Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
Gao, Yuan; Yuan, Jinjiang - In: Operations research letters 44 (2016) 1, pp. 92-95
Persistent link: https://www.econbiz.de/10011455580
Cover Image
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
He, Cheng; Lin, Yixun; Yuan, Jinjiang - In: European journal of operational research : EJOR 201 (2010) 3, pp. 966-970
Persistent link: https://www.econbiz.de/10003959947