Narrow search
Showing 1 - 7 of 7
Cover Image
Serial-batching scheduling with two agents to minimize makespan and maximum cost
He, Cheng; Xu, ChunQing; Lin, Hao - In: Journal of scheduling : JOS 23 (2020) 5, pp. 609-617
Persistent link: https://www.econbiz.de/10012299986
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
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
Single machine scheduling with job delivery to minimize makespan
Lu, Lingfa; Yuan, Jinjiang - In: Asia Pacific journal of operational research : APJOR 25 (2008) 1, pp. 1-10
Persistent link: https://www.econbiz.de/10003717792
Cover Image
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
Wan, Long; Yuan, Jinjiang; Geng, Zhichao - In: Journal of scheduling 18 (2015) 3, pp. 315-323
Persistent link: https://www.econbiz.de/10011290705
Cover Image
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Chen, Rubing; Yuan, Jinjiang; Gao, Yuan - In: Journal of scheduling 22 (2019) 5, pp. 581-593
Persistent link: https://www.econbiz.de/10012117028
Cover Image
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
Chen, Rubing; Yuan, Jinjiang; Ng, C. T.; Cheng, T. C. E. - In: European journal of operational research : EJOR 293 (2021) 1, pp. 79-92
Persistent link: https://www.econbiz.de/10012502451