Narrow search
Showing 1 - 8 of 8
Cover Image
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
Fu, Ruyan; Cheng, T. C. E.; Ng, C. T.; Yuan, Jinjiang - In: Operations research letters 41 (2013) 3, pp. 216-219
Persistent link: https://www.econbiz.de/10009757373
Cover Image
On-line scheduling on a batch machine to minimize makespan with limited restarts
Fu, Ruyan; Tan, Ji; Yuan, Jinjiang; He, Cheng - In: Operations research letters 36 (2008) 2, pp. 255-258
Persistent link: https://www.econbiz.de/10003773711
Cover Image
Unbounded parallel batch scheduling with job delivery to minimize makespan
Lu, Lingfa; Yuan, Jinjiang - In: Operations research letters 36 (2008) 4, pp. 477-480
Persistent link: https://www.econbiz.de/10003786723
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 Pareto minimizing total completion time and maximum cost
Gao, Yuan; Yuan, Jinjiang - In: Operations research letters 43 (2015) 1, pp. 80-82
Persistent link: https://www.econbiz.de/10010486293
Cover Image
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
Wei, Hongjun; Yuan, Jinjiang - In: Operations research letters 47 (2019) 1, pp. 41-46
Persistent link: https://www.econbiz.de/10011991332
Cover Image
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
Zhao, Qiulan; Yuan, Jinjiang - In: Operations research letters 47 (2019) 6, pp. 607-610
Persistent link: https://www.econbiz.de/10012131895
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