Fog Computing for Energy-Aware Load Balancing and Scheduling in Smart Factory
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Due to the development of modern information technology, the emergence of the fog computing enhances equipment computational power and provides new solutions for traditional industrial applications. Generally, it is impossible to establish a quantitative energy-aware model with a smart meter for load balancing and scheduling optimization in smart factory. With the focus on complex energy consumption problems of manufacturing clusters, this paper proposes an energy-aware load balancing and scheduling (ELBS) method based on fog computing. First, an energy consumption model related to the workload is established on the fog node, and an optimization function aiming at the load balancing of manufacturing cluster is formulated. Then, the improved particle swarm optimization algorithm is used to obtain an optimal solution, and the priority for achieving tasks is built toward the manufacturing cluster. Finally, a multiagent system is introduced to achieve the distributed scheduling of manufacturing cluster. The proposed ELBS method is verified by experiments with candy packing line, and experimental results showed that proposed method provides optimal scheduling and load balancing for the mixing work robots.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it