Yan Lan

A Fast Algorithm for Knapsack Problem with Conflict Graph

Jacek Blazewicz, Xin Han, Feng Chen, 2021, Asia Pac. J. Oper. Res..

A PTAS for non-resumable open shop scheduling with an availability constraint

Xin Han, Yuan Yuan, Yan Lan, 2021, Journal of Combinatorial Optimization.

Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period

Xin Han, Xinbo Liu, Yuan Yuan, 2021, COCOA.