Dual-Resource Scheduling with Improved Forensic-Based Investigation Algorithm in Smart Manufacturing
With increasing labor costs and rapidly dynamic changes in the market demand, as well as realizing the refined management of production, more and more attention is being given to considering workers, not just machines, in the process of flexible job shop scheduling. Hence, a new dual-resource flexib...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/9/1432 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | With increasing labor costs and rapidly dynamic changes in the market demand, as well as realizing the refined management of production, more and more attention is being given to considering workers, not just machines, in the process of flexible job shop scheduling. Hence, a new dual-resource flexible job shop scheduling problem (DRFJSP) is put forward in this paper, considering workers with flexible working time arrangements and machines with versatile functions in scheduling production, as well as a multi-objective mathematical model for formalizing the DRFJSP and tackling the complexity of scheduling in human-centric manufacturing environments. In addition, a two-stage approach based on a forensic-based investigation (TSFBI) is proposed to solve the problem. In the first stage, an improved multi-objective FBI algorithm is used to obtain the Pareto front solutions of this model, in which a hybrid real and integer encoding–decoding method is used for exploring the solution space and a fast non-dominated sorting method for improving efficiency. In the second stage, a multi-criteria decision analysis method based on an analytic hierarchy process (AHP) is used to select the optimal solution from the Pareto front solutions. Finally, experiments validated the TSFBI algorithm, showing its potential for smart manufacturing. |
|---|---|
| ISSN: | 2227-7390 |