Narrow search
Showing 1 - 5 of 5
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
Algorithms better than LPT for semi-online scheduling with decreasing processing times
Cheng, T. C. E.; Kellerer, Hans; Kotov, Vladimir N. - In: Operations research letters 40 (2012) 5, pp. 349-352
Persistent link: https://www.econbiz.de/10009613811
Cover Image
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
Nong, Q. Q.; Ng, C. T.; Cheng, T. C. E. - In: Operations research letters 36 (2008) 1, pp. 61-66
Persistent link: https://www.econbiz.de/10003768517
Cover Image
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Nong, Q. Q.; Cheng, T. C. E.; Ng, C. T. - In: Operations research letters 36 (2008) 5, pp. 584-588
Persistent link: https://www.econbiz.de/10003786778
Cover Image
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Tian, Zhongjun; Ng, C. T.; Cheng, T. C. E. - In: Operations research letters 37 (2009) 5, pp. 368-374
Persistent link: https://www.econbiz.de/10003932256