Operation allocation and part type selection in E-manufacturing: An auction based heuristic supported by agent technology
被引:11
作者:
Tiwari, M. K.
论文数: 0引用数: 0
h-index: 0
机构:
Indian Inst Technol, Dept Ind Engn & Management, Kharagpur 721302, W Bengal, IndiaIndian Inst Technol, Dept Ind Engn & Management, Kharagpur 721302, W Bengal, India
Tiwari, M. K.
[1
]
Jha, Sujit Kumar
论文数: 0引用数: 0
h-index: 0
机构:
Ibra Coll Technol, Dept Engn, Ibra 400, OmanIndian Inst Technol, Dept Ind Engn & Management, Kharagpur 721302, W Bengal, India
Jha, Sujit Kumar
[2
]
Anand, Raj Bardhan
论文数: 0引用数: 0
h-index: 0
机构:
Univ Cincinnati, Dept Mech Ind & Nucl Engn, Comp Aided Mfg Lab, Cincinnati, OH 45221 USAIndian Inst Technol, Dept Ind Engn & Management, Kharagpur 721302, W Bengal, India
Anand, Raj Bardhan
[3
]
机构:
[1] Indian Inst Technol, Dept Ind Engn & Management, Kharagpur 721302, W Bengal, India
[2] Ibra Coll Technol, Dept Engn, Ibra 400, Oman
[3] Univ Cincinnati, Dept Mech Ind & Nucl Engn, Comp Aided Mfg Lab, Cincinnati, OH 45221 USA
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. (C) 2009 Published by Elsevier Ltd.