Narrow search
Showing 1 - 6 of 6
Cover Image
On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
Zhang, An - In: Operations research letters 43 (2015) 5, pp. 522-525
Persistent link: https://www.econbiz.de/10011386461
Cover Image
Approximate the scheduling of quay cranes with non-crossing constraints
Zhang, An; Zhang, Wenshuai; Chen, Yong; Chen, Guangting; … - In: European journal of operational research : EJOR 258 (2017) 3, pp. 820-828
Persistent link: https://www.econbiz.de/10011644486
Cover Image
Pseudo lower bounds for online parallel machine scheduling
Tan, Zhiyi; Li, Rongqi - In: Operations research letters 43 (2015) 5, pp. 489-494
Persistent link: https://www.econbiz.de/10011386448
Cover Image
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György; Fügenschuh, Armin; Tan, Zhiyi; Tuza, Zsolt - In: Central European journal of operations research : CEJOR … 26 (2018) 1, pp. 161-180
Persistent link: https://www.econbiz.de/10011871037
Cover Image
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György; Fügenschuh, Armin; Tan, Zhiyi; Tuza, Zsolt - In: Central European journal of operations research : CEJOR … 27 (2019) 4, pp. 1107-1130
Persistent link: https://www.econbiz.de/10012106587
Cover Image
Approximation algorithms for the 𝜅⁺-star packing problem
Huang, Zhihua; Zhang, An; Gao, Mingqi; Sun, Jiayi; … - In: Operations research letters : a journal of INFORMS … 59 (2025), pp. 1-7
Persistent link: https://www.econbiz.de/10015358881