Bidding-based multi-agent system for integrated process planning and scheduling: A data-mining and hybrid tabu-SA algorithm-oriented approach

Sanjay Kumar Shukla, M. K. Tiwari, Young-Jun Son

Research output: Contribution to journalArticle

44 Citations (Scopus)

Abstract

This paper conceptualizes a bidding-based multi-agent system for solving integrated process-planning and scheduling problem. The proposed architecture consists of various autonomous agents capable of communicating (bidding) with each other and making decisions based on their knowledge. Moreover, in contrast to the traditional model of integrated process-planning and scheduling problem, a new paradigm has been conceptualized by considering tool cost as a dynamic quantity rather than a constant. Tool cost is assumed to comprise tool-using cost and its repairing cost. The repairing cost is considered to depend on the tool-breaking probability, which is predicted by the data-mining agent equipped with the virtues of C-fuzzy decision tree. When a job arrives at the shop floor, the component agent announces a bid for one feature at a time to all the machine agents. Among the machine agents capable of producing the first feature, one comes forward to become a "leader", and groups other machine agents for the processing of remaining features of the job. Once all features are assigned to the appropriate machines, the leader then sends this allocation information to the optimization agent. The optimization agent finds optimal/near-optimal process plans and schedules via the hybrid tabu-SA algorithm.

Original languageEnglish (US)
Pages (from-to)163-175
Number of pages13
JournalInternational Journal of Advanced Manufacturing Technology
Volume38
Issue number1-2
DOIs
StatePublished - Jul 2008

Fingerprint

Process planning
Multi agent systems
Data mining
Scheduling
Costs
Autonomous agents
Decision trees
Decision making
Processing

Keywords

  • C-fuzzy decision trees
  • Dynamic tool cost
  • Hybrid tabu-SA algorithm
  • Integrated process planning and scheduling
  • Multi-agent system

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

@article{64cc148e3d954bd38b4d62f997aa00a0,
title = "Bidding-based multi-agent system for integrated process planning and scheduling: A data-mining and hybrid tabu-SA algorithm-oriented approach",
abstract = "This paper conceptualizes a bidding-based multi-agent system for solving integrated process-planning and scheduling problem. The proposed architecture consists of various autonomous agents capable of communicating (bidding) with each other and making decisions based on their knowledge. Moreover, in contrast to the traditional model of integrated process-planning and scheduling problem, a new paradigm has been conceptualized by considering tool cost as a dynamic quantity rather than a constant. Tool cost is assumed to comprise tool-using cost and its repairing cost. The repairing cost is considered to depend on the tool-breaking probability, which is predicted by the data-mining agent equipped with the virtues of C-fuzzy decision tree. When a job arrives at the shop floor, the component agent announces a bid for one feature at a time to all the machine agents. Among the machine agents capable of producing the first feature, one comes forward to become a {"}leader{"}, and groups other machine agents for the processing of remaining features of the job. Once all features are assigned to the appropriate machines, the leader then sends this allocation information to the optimization agent. The optimization agent finds optimal/near-optimal process plans and schedules via the hybrid tabu-SA algorithm.",
keywords = "C-fuzzy decision trees, Dynamic tool cost, Hybrid tabu-SA algorithm, Integrated process planning and scheduling, Multi-agent system",
author = "Shukla, {Sanjay Kumar} and Tiwari, {M. K.} and Young-Jun Son",
year = "2008",
month = "7",
doi = "10.1007/s00170-007-1087-8",
language = "English (US)",
volume = "38",
pages = "163--175",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",
number = "1-2",

}

TY - JOUR

T1 - Bidding-based multi-agent system for integrated process planning and scheduling

T2 - A data-mining and hybrid tabu-SA algorithm-oriented approach

AU - Shukla, Sanjay Kumar

AU - Tiwari, M. K.

AU - Son, Young-Jun

PY - 2008/7

Y1 - 2008/7

N2 - This paper conceptualizes a bidding-based multi-agent system for solving integrated process-planning and scheduling problem. The proposed architecture consists of various autonomous agents capable of communicating (bidding) with each other and making decisions based on their knowledge. Moreover, in contrast to the traditional model of integrated process-planning and scheduling problem, a new paradigm has been conceptualized by considering tool cost as a dynamic quantity rather than a constant. Tool cost is assumed to comprise tool-using cost and its repairing cost. The repairing cost is considered to depend on the tool-breaking probability, which is predicted by the data-mining agent equipped with the virtues of C-fuzzy decision tree. When a job arrives at the shop floor, the component agent announces a bid for one feature at a time to all the machine agents. Among the machine agents capable of producing the first feature, one comes forward to become a "leader", and groups other machine agents for the processing of remaining features of the job. Once all features are assigned to the appropriate machines, the leader then sends this allocation information to the optimization agent. The optimization agent finds optimal/near-optimal process plans and schedules via the hybrid tabu-SA algorithm.

AB - This paper conceptualizes a bidding-based multi-agent system for solving integrated process-planning and scheduling problem. The proposed architecture consists of various autonomous agents capable of communicating (bidding) with each other and making decisions based on their knowledge. Moreover, in contrast to the traditional model of integrated process-planning and scheduling problem, a new paradigm has been conceptualized by considering tool cost as a dynamic quantity rather than a constant. Tool cost is assumed to comprise tool-using cost and its repairing cost. The repairing cost is considered to depend on the tool-breaking probability, which is predicted by the data-mining agent equipped with the virtues of C-fuzzy decision tree. When a job arrives at the shop floor, the component agent announces a bid for one feature at a time to all the machine agents. Among the machine agents capable of producing the first feature, one comes forward to become a "leader", and groups other machine agents for the processing of remaining features of the job. Once all features are assigned to the appropriate machines, the leader then sends this allocation information to the optimization agent. The optimization agent finds optimal/near-optimal process plans and schedules via the hybrid tabu-SA algorithm.

KW - C-fuzzy decision trees

KW - Dynamic tool cost

KW - Hybrid tabu-SA algorithm

KW - Integrated process planning and scheduling

KW - Multi-agent system

UR - http://www.scopus.com/inward/record.url?scp=46749150544&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46749150544&partnerID=8YFLogxK

U2 - 10.1007/s00170-007-1087-8

DO - 10.1007/s00170-007-1087-8

M3 - Article

AN - SCOPUS:46749150544

VL - 38

SP - 163

EP - 175

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 1-2

ER -