An agent-oriented approach to resolve scheduling optimization in intelligent manufacturing
Bibliographic record
Abstract
Agent technology is considered as a promising approach for developing optimizing process plans in intelligent manufacturing. As a bridge between computer aided design (CAD) and computer aided manufacturing (CAM), the computer aided scheduling optimization (CASO) plays an important role in the computer integrated manufacturing (CIM) environment. In order to develop a multi-agent-based scheduling system for intelligent manufacturing, it is necessary to build various functional agents for all the resources and an agent manager to improve the scheduling agility. Identifying the shortcomings of traditional scheduling algorithm in intelligent manufacturing, the architecture of intelligent manufacturing system based on multi-agent is put forward, among which agent represents the basic processing entity. Multi-agent-based scheduling is a new intelligent scheduling method based on the theories of multi-agent system (MAS) and distributed artificial intelligence (DAI). It views intelligent manufacturing as composed of a set of intelligent agents, who are responsible for one or more activities and interacting with other related agents in planning and executing their responsibilities. In this paper, the proposed architecture consists of various autonomous agents that are capable of communicating with each other and making decisions based on their knowledge. The architecture of intelligent manufacturing, the scheduling optimization algorithm, the negotiation processes and protocols among the agents are described in detail. A prototype system is built and validated in an illustrative example, which demonstrates the feasibility of the proposed approach. The experiments prove that the implementation of multi-agent technology in intelligent manufacturing system makes the operations much more flexible, economical and energy efficient.
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.
How this classification was reachedexpand
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.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".