Xiang Song
Orcid: 0000-0003-0235-3734Affiliations:
- University of Portsmouth, School of Mathematics and Physics, Portsmouth, UK
According to our database1,
Xiang Song
authored at least 18 papers
between 2006 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2023
A two-stage stochastic model for a multi-objective blood platelet supply chain network design problem incorporating frozen platelets.
Comput. Ind. Eng., November, 2023
2021
An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem.
Eur. J. Oper. Res., 2021
2020
Multi-objective vehicle routing and loading with time window constraints: a real-life application.
Ann. Oper. Res., 2020
2019
A heuristic for the skiving and cutting stock problem in paper and plastic film industries.
Int. Trans. Oper. Res., 2019
2017
New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers.
J. Oper. Res. Soc., 2017
Eur. J. Oper. Res., 2017
2016
A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis.
Eur. J. Oper. Res., 2016
2015
Split-merge: Using exponential neighborhood search for scheduling a batching machine.
Comput. Oper. Res., 2015
2014
Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem.
J. Oper. Res. Soc., 2014
Flexibility analysis on a supply chain contract using a parametric Linear Programming model.
Proceedings of the 2014 IEEE International Conference on Automation Science and Engineering, 2014
2013
Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints.
Eur. J. Oper. Res., 2013
2012
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem.
Comput. Oper. Res., 2012
2011
An investigation into two bin packing problems with ordering and orientation implications.
Eur. J. Oper. Res., 2011
2010
J. Heuristics, 2010
A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting.
Eur. J. Oper. Res., 2010
2008
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums.
Comput. Oper. Res., 2008
2006
An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem.
Eur. J. Oper. Res., 2006