发表学术论文50余篇,其中SCI检索27篇(一作或通讯作者19篇)。
Selected papers:
[1] Xin Chen(陈鑫), Qian Miao, Bertrand M.T. Lin, Malgorzata Sterna, Jacek Blazewicz. Two-machine Flow Shop Scheduling with a Common Due Date to Maximize Total Early Work. European Journal of Operational Research. 2022, 300(2): 504-511.
[2] Xin Chen(陈鑫), Sergey Kovalev, Malgorzata Sterna, Jacek Blazewicz. Mirror scheduling problems with early work and late work criteria. Journal of Scheduling. 2021, 24: 483-487.
[3] Xin Chen(陈鑫), Sergey Kovalev, Yuqing Liu,Malgorzata Sterna, Isabelle Chalamon, Jacek Blazewicz. Semi-online Scheduling on Two Identical Machines with a Common Due Date to Maximize Total Early Work. Discrete Applied Mathematics. 2021, 290: 71-78.
[4] Xin Chen(陈鑫), Yage Liang, Malgorzata Sterna, Wen Wang, Jacek Blazewicz. Fully Polynomial Time Approximation Scheme to Maximize Early Work on Parallel Machines with Common Due Date. European Journal of Operational Research. 2020,284(1):67-74.
[5] Xin Chen(陈鑫), Wen Wang, Pengyu Xie, Xingong Zhang, Malgorzata Sterna, Jacek Blazewicz. Exact and Heuristic Algorithms for Scheduling on Two Identical Machines with Early Work Maximization. Computers & Industrial Engineering. 2020,144:106449.
[6] Xin Chen(陈鑫), Zhongyu Wang, Erwin Pesch, Małgorzata Sterna, Jacek Blazewicz. Two-machine flow-shop scheduling to minimize total late work: revisited. Engineering Optimization. 2019,51(7):1268–1278.
[7] Xin Chen(陈鑫), Vincent Chau, Pengyu Xie, Malgorzata Sterna, Jacek Blazewicz. Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect. Computers & Industrial Engineering. 2017, 111: 176-182.
[8] Xin Chen(陈鑫), Malgorzata Sterna , Xin Han, Jacek Blazewicz. Scheduling on parallel identical machines with late work criterion: Offline and online cases. Journal of Scheduling. 2016, 19(6): 729–736.
[9] Xin Chen(陈鑫), Zhenzhen Xu, Gyorgy Dosa, Xin Han, He Jiang. Semi-online hierarchical scheduling problems with buffer or rearrangements. Information Processing Letters. 2013, 113(4): 127-131.
[10] Xin Chen(陈鑫), Yan Lan, Attila Benko, Gyorgy Dosa, Xin Han. Optimal algorithms for online scheduling with bounded rearrangement at the end. Theoretical Computer Science. 2011, 412(45): 6269-6278.
|