Shuguang Li

Orcid: 0000-0001-9017-7827

Affiliations:
  • Shandong Technology and Business University, Yantai, Shandong, China


According to our database1, Shuguang Li authored at least 13 papers between 2017 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.
Central Eur. J. Oper. Res., March, 2026

MFF-Mixer: A multi-perspective feature fusion method for long-term multivariate time series forecasting.
Knowl. Based Syst., 2026

2025
Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost.
CoRR, March, 2025

Optimizing two-agent single-machine parallel batch scheduling: achieving pareto efficiency in makespan and maximum cost objectives.
RAIRO Oper. Res., 2025

Multicriteria scheduling of two-subassembly products with batch availability and precedence constraints.
PeerJ Comput. Sci., 2025

Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine.
J. Comput. Appl. Math., 2025

Smart artificial pancreas: Sensor-based glucose and insulin control by deep stochastic policy learning.
Eng. Appl. Artif. Intell., 2025

An efficient mathematical-based optimization method to optimize multi-hydropower operating rules.
Appl. Soft Comput., 2025

2024
Deep Entropy-Learning based virtual inertia control for VRFB regulation considering Phase-Locked loop dynamics.
Expert Syst. Appl., 2024

2023
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost.
Inf. Process. Lett., 2023

2017
Parallel batch scheduling with nested processing set restrictions.
Theor. Comput. Sci., 2017

Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities.
Eur. J. Oper. Res., 2017

Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan.
Eur. J. Oper. Res., 2017


  Loading...