Narrow search
Showing 1 - 10 of 27
Cover Image
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
Ng, C. T.; Wang, Ji-Bo; Cheng, T. C. E.; Liu, L. L. - In: Computers & operations research : and their … 37 (2010) 1, pp. 83-90
Persistent link: https://www.econbiz.de/10003904395
Cover Image
Multi-period empty container repositioning with stochastic demand and lost sales
Zhang, B.; Ng, C. T.; Cheng, T. C. E. - In: Journal of the Operational Research Society : OR 65 (2014) 2, pp. 302-319
Persistent link: https://www.econbiz.de/10010239919
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
Optimal algorithms for single-machine scheduling with rejection to minimize the makespan
Lu, Lingfa; Ng, C. T.; Zhang, Liqi - In: International journal of production economics 130 (2011) 2, pp. 153-158
Persistent link: https://www.econbiz.de/10008934644
Cover Image
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
Yuan, Jinjiang; Fu, Ruyan; Ng, C. T.; Cheng, T. C. E. - In: Journal of scheduling 14 (2011) 4, pp. 361-369
Persistent link: https://www.econbiz.de/10009270893
Cover Image
How small are shifts required in optimal preemptive schedules?
Coffman, Edward G.; Ng, C. T.; Timkovsky, V. G. - In: Journal of scheduling 18 (2015) 2, pp. 155-163
Persistent link: https://www.econbiz.de/10010504100
Cover Image
An alternative approach for proving the NP-hardness of optimization problems
Cheng, T. C. E.; Shafransky, Y.; Ng, C. T. - In: European journal of operational research : EJOR 248 (2016) 1, pp. 52-58
Persistent link: https://www.econbiz.de/10011434691
Cover Image
Fast approximation algorithms for uniform machine scheduling with processing set restrictions
Leung, Joseph Y-T.; Ng, C. T. - In: European journal of operational research : EJOR 260 (2017) 2, pp. 507-513
Persistent link: https://www.econbiz.de/10011698643
Cover Image
Approximation algorithms for batch scheduling with processing set restrictions
Chai, Xing; Li, Wenhua; Ng, C. T.; Cheng, T. C. E. - In: Journal of scheduling : JOS 26 (2023) 6, pp. 523-533
Persistent link: https://www.econbiz.de/10014444278
Cover Image
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
Gao, Yuan; Yuan, Jinjiang; Ng, C. T.; Cheng, T. C. E. - In: 4OR : quarterly journal of the Belgian, French and … 20 (2022) 2, pp. 273-287
Persistent link: https://www.econbiz.de/10013259949