A
Aiying Rong
Researcher at Technical University of Lisbon
Publications - 46
Citations - 2883
Aiying Rong is an academic researcher from Technical University of Lisbon. The author has contributed to research in topics: Linear programming & Production planning. The author has an hindex of 24, co-authored 46 publications receiving 2595 citations. Previous affiliations of Aiying Rong include University of Lisbon & University of Turku.
Papers
More filters
Journal ArticleDOI
An optimization approach for managing fresh food quality throughout the supply chain
TL;DR: In this paper, the authors provide a methodology to model food quality degradation in such a way that it can be integrated in a mixed-integer linear programming model used for production and distribution planning.
Journal ArticleDOI
A review of planning and scheduling systems and methods for integrated steel production
TL;DR: A comparative analysis of the production processes and production management problems for the SM–CC–HR and the traditional cold charge process is given and planning and scheduling systems developed and methods used for SM– CC–HR production are reviewed.
Journal ArticleDOI
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex
TL;DR: The model, solution method, and system developed and implemented for hot rolling production scheduling in Shanghai Baoshan Iron & Steel Complex shows 20% improvement over the previous manual based system.
Journal ArticleDOI
A mathematical programming model for scheduling steelmaking-continuous casting production
TL;DR: A mathematical model, based on the just-in-time (JIT) idea, for solving machine conflicts in steelmaking-continuous casting production scheduling in the computer integrated manufacturing system (CIMS) environment is presented.
Journal ArticleDOI
An efficient linear programming model and optimization algorithm for trigeneration
Aiying Rong,Risto Lahdelma +1 more
TL;DR: The structure of the problem is explored, the specialized Tri-Commodity Simplex (TCS) algorithm is proposed, and the performance of TCS with realistic models against an efficient sparse Simplex code using the product form of inverse is compared.