Machining task allocation in discrete manufacturing systems
Market-based control
An overview of distributed artificial intelligence
Foundations of distributed artificial intelligence
Applications of distributed artificial intelligence in industry
Foundations of distributed artificial intelligence
Applications of intelligent agents
Agent technology
Multiagent coordination in tightly coupled task scheduling
Readings in agents
Emerging technologies to support indirect procurement: two case studies from the petroleum industry
Information Technology and Management
An Introduction to Agent Technology
Software Agents and Soft Computing: Towards Enhancing Machine Intelligence, Concepts and Applications
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Modeling adaptive autonomous agents
Artificial Life
A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
This paper enlightens some of the key issues involved in developing real schedule generation architecture in E-manufacturing environment. The high cost, long cycle time of development of shop floor control systems and the lack of robust system integration capabilities are some of the major deterrents in the development of the underlying architecture. We conceptualize a robust framework, capable of providing flexibility to the system, communication among various entities and making intelligent decisions. Owing to the fast communication, distributed control and autonomous character, agent-oriented architecture has been preferred here to address the scheduling problem in E-manufacturing. An integer programming based model with dual objectives of minimizing the makespan and increasing the system throughput has been formulated for determining the optimal part type sequence from the part type pool. It is very difficult to appraise all possible combinations of the operation-machine allocations in order to accomplish the above objectives. A combinatorial auction-based heuristic has been proposed to minimize large search spaces and to obtain optimal or near-optimal solutions of operation-machine allocations of given part types with tool slots and available machine time as constraint. We have further shown the effects of exceeding the planning horizon due to urgency of part types or over time given to complete the part type processing on shop floor and observed the significant increase in system throughput.