Wenwu Han

ORCID: 0000-0001-9960-9032
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization
  • Sustainable Supply Chain Management
  • Assembly Line Balancing Optimization
  • Supply Chain and Inventory Management
  • Recycling and Waste Management Techniques
  • Advanced Multi-Objective Optimization Algorithms
  • Manufacturing Process and Optimization
  • Metaheuristic Optimization Algorithms Research
  • Environmental Impact and Sustainability
  • Multi-Criteria Decision Making
  • Advanced Control Systems Optimization

Hunan University
2019-2022

Remanufacturing has been widely studied for its potential to achieve sustainable production in recent years. In the literature of remanufacturing research, process planning and scheduling are typically treated as two independent parts. However, these parts fact interrelated often interact with each other. Doing without considering related factors can easily introduce contradictions or even infeasible solutions. this work, we propose a mathematical model integrated (IPPSR), which...

10.1080/00207543.2019.1634848 article EN International Journal of Production Research 2019-06-27

The previous studies on scheduling problem with tool changes take processing time as the only reason for wear, which is not accurate in real manufacturing system. This paper takes speed and into consideration simultaneously proposes a new unrelated parallel machine (UPMSP) caused by energy consumption rate of machines influenced two factors: corresponding speed. A effective heuristic evolutionary algorithm (NHEA) presented to solve proposed UPMSP objectives optimising total makespan. For...

10.1080/00207543.2019.1685708 article EN International Journal of Production Research 2019-11-07

Abstract Thus far, the available works on flexible assembly job‐shop scheduling problem (FAJSP) consider job processing and separately. However, in some real production systems, if equipment is composed of thousands jobs assembled many stages, assemblies cannot be processed simultaneously. Therefore, this work proposes an FAJSP with tight constraints (FAJSP‐JC) which can simultaneously, each treated as operation. A constraint genetic algorithm (JCGA) presented to solve proposed FAJSP‐JC goal...

10.1111/itor.12767 article EN International Transactions in Operational Research 2020-01-02
Coming Soon ...