Yan Lan

Orcid: 0000-0003-3311-1105

According to our database1, Yan Lan authored at least 20 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Flow shop scheduling problems with transportation constraints revisited.
Theor. Comput. Sci., February, 2024

A Spatial-Spectral Transformer for Hyperspectral Image Classification Based on Global Dependencies of Multi-Scale Features.
Remote. Sens., January, 2024

2023
A two-way translation system of Chinese sign language based on computer vision.
CoRR, 2023

2022
A PTAS for non-resumable open shop scheduling with an availability constraint.
J. Comb. Optim., 2022

A tight approximation algorithm for problem $P2\rightarrow D|v=1, c=1|C_{\max }$.
J. Comb. Optim., 2022

Flow Shop Scheduling Problems with Transportation Constraints Revisited.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
A Fast Algorithm for Knapsack Problem with Conflict Graph.
Asia Pac. J. Oper. Res., 2021

Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Approximation algorithms for two-stage flexible flow shop scheduling.
J. Comb. Optim., 2020

2017
Flowshop problem F2 → D|v = 1, c ≥ 1|C<sub>max</sub> revisited.
Theor. Comput. Sci., 2017

面向电影推荐的时间加权协同过滤算法的研究 (Research of Time Weighted Collaborative Filtering Algorithm in Movie Recommendation).
计算机科学, 2017

Online bin packing problem with buffer and bounded size revisited.
J. Comb. Optim., 2017

2016
带等时空载返程运输的双机Flow shop调度问题复杂性 (Complexity of Flow Shop Scheduling Problems with No-load Return Transportation).
计算机科学, 2016

Complexity of problem <i>TF</i>2|v=1, c=2|C<sub>max</sub>.
Inf. Process. Lett., 2016

2015
A Comprehensive College Coaches Evaluation Model Based on AHP and Grey Correlation Theory.
Proceedings of the Fifth IEEE International Conference on Big Data and Cloud Computing, 2015

2014
Online Minimum makespan Scheduling with a Buffer.
Int. J. Found. Comput. Sci., 2014

2013
2D knapsack: Packing squares.
Theor. Comput. Sci., 2013

2012
Online Minimum Makespan Scheduling with a Buffer.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Optimal algorithms for online scheduling with bounded rearrangement at the end.
Theor. Comput. Sci., 2011

2010
Dynamic bin packing with unit fraction items revisited.
Inf. Process. Lett., 2010


  Loading...