Xiwen Lu
Orcid: 0000-0002-4728-6048
According to our database1,
Xiwen Lu
authored at least 74 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Inf. Process. Lett., February, 2024
IEEE Signal Process. Lett., 2024
IEEE Robotics Autom. Lett., 2024
2023
Optim. Lett., November, 2023
MCFormer: A Transformer-Based Detector for Molecular Communication With Accelerated Particle-Based Solution.
IEEE Commun. Lett., October, 2023
Evolutionary generative adversarial network based end-to-end learning for MIMO molecular communication with drift system.
Nano Commun. Networks, September, 2023
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
2022
A Tight Approximation Algorithm for Multi-Vehicle CVRP with Unsplittable Demands on a Line.
J. Syst. Sci. Complex., 2022
J. Comb. Optim., 2022
Online single-machine scheduling to minimize the linear combination of makespans of two agents.
Inf. Process. Lett., 2022
2021
A Biobjective Optimization Model for Expert Opinions Aggregation and Its Application in Group Decision Making.
IEEE Syst. J., 2021
A best possible online algorithm for parallel batch scheduling with delivery times and limited restart.
Optim. Lett., 2021
J. Comb. Optim., 2021
Development of new operators for expert opinions aggregation: Average-induced ordered weighted averaging operators.
Int. J. Intell. Syst., 2021
Discret. Appl. Math., 2021
An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart.
Asia Pac. J. Oper. Res., 2021
Proceedings of the Combinatorial Optimization and Applications, 2021
2020
New approximation algorithms for machine scheduling with rejection on single and parallel machine.
J. Comb. Optim., 2020
Two-machine flow shop scheduling with an operator non-availability period to minimize makespan.
J. Comb. Optim., 2020
CoRR, 2020
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020
Supporting Teacher Assessment in Chinese Language Learning Using Textual and Tonal Features.
Proceedings of the Artificial Intelligence in Education - 21st International Conference, 2020
2019
Theor. Comput. Sci., 2019
A note on minimizing total weighted completion time with an unexpected machine unavailable interval.
J. Sched., 2019
An approximation algorithm for multi-agent scheduling on two uniform parallel machines.
Optim. Lett., 2019
Hao Fa Yin: Developing Automated Audio Assessment Tools for a Chinese Language Course.
Proceedings of the 12th International Conference on Educational Data Mining, 2019
Understanding the Complexities of Chinese Word Acquisition within an Online Learning Platform.
Proceedings of the 11th International Conference on Computer Supported Education, 2019
Proceedings of the 12th International Congress on Image and Signal Processing, 2019
2018
An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines.
J. Sched., 2018
Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan.
J. Comb. Optim., 2018
2017
An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan.
J. Comb. Optim., 2017
Experimenting Choices of Video and Text Feedback in Authentic Foreign Language Assignments at Scale.
Proceedings of the Fourth ACM Conference on Learning @ Scale, 2017
Better Approximation Ratios for the Single-Vehicle Scheduling Problems on Tree/Cycle Networks.
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines.
J. Sched., 2016
Approximation algorithms for the single-machine scheduling with a period of maintenance.
Optim. Lett., 2016
The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail.
J. Syst. Sci. Complex., 2016
Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan.
J. Comb. Optim., 2016
Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine.
Inf. Process. Lett., 2016
2015
Integrated scheduling of production and delivery on a single machine with availability constraint.
Theor. Comput. Sci., 2015
J. Comb. Optim., 2015
J. Comb. Optim., 2015
Supply chain scheduling problem in the hospital with periodic working time on a single machine.
J. Comb. Optim., 2015
On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost.
Eur. J. Oper. Res., 2015
Online and semi-online scheduling to minimize makespan on single machine with an availability constraint.
Discret. Math. Algorithms Appl., 2015
2014
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan.
Comput. Oper. Res., 2014
Asia Pac. J. Oper. Res., 2014
2013
Theor. Comput. Sci., 2013
Theor. Comput. Sci., 2013
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems.
J. Appl. Math., 2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines.
J. Sched., 2012
2011
Theor. Comput. Sci., 2011
Theor. Comput. Sci., 2011
J. Comb. Optim., 2011
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines.
Ann. Oper. Res., 2011
2010
Uniformly Least Reliable Graphs in Class Ω(n, e) as e ≤ n+1.
Ars Comb., 2010
2009
J. Comput. Appl. Math., 2009
Inf. Process. Lett., 2009
Comput. Oper. Res., 2009
2008
Comput. Math. Appl., 2008
2004
Algorithmica, 2004
2003
Oper. Res. Lett., 2003
1998
Adaptive observer and nonlinear control strategy for chemical reactors via neural networks.
Int. J. Syst. Sci., 1998