File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/00207543.2012.720393
- Scopus: eid_2-s2.0-84868217816
- WOS: WOS:000310597100011
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Integrated process planning and scheduling - Multi-agent system with two-stage ant colony optimisation algorithm
Title | Integrated process planning and scheduling - Multi-agent system with two-stage ant colony optimisation algorithm |
---|---|
Authors | |
Keywords | Ant Colony Optimisation Integrated Process Planning And Scheduling Multi-Agent System Process Planning Scheduling |
Issue Date | 2012 |
Publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp |
Citation | International Journal Of Production Research, 2012, v. 50 n. 21, p. 6188-6201 How to Cite? |
Abstract | In this paper, a two-stage ant colony optimisation (ACO) algorithm is implemented in a multi-agent system (MAS) to accomplish integrated process planning and scheduling (IPPS) in the job shop type flexible manufacturing environments. Traditionally, process planning and scheduling functions are performed sequentially and the actual status of the production facilities is not considered in either process planning or scheduling. IPPS is to combine both the process planning and scheduling problems in the consideration, that is, the actual process plan and the schedule are determined dynamically in accordance with the order details and the status of the manufacturing system. The ACO algorithm can be applied to solve IPPS problems. An innovative two-stage ACO algorithm is introduced in this paper. In the first stage of the algorithm, instead of depositing pheromones on graph edges as in common ant algorithms, ants are directed to deposit pheromones at the nodes to select a set of more favourable processes. In the second stage, the set of nodes not selected in the first stage will be ignored, and pheromones will be deposited along the graph edges while the ants traverse the paths connecting the selected set of nodes. © 2012 Copyright Taylor and Francis Group, LLC. |
Persistent Identifier | http://hdl.handle.net/10722/178253 |
ISSN | 2023 Impact Factor: 7.0 2023 SCImago Journal Rankings: 2.668 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wong, TN | en_US |
dc.contributor.author | Zhang, S | en_US |
dc.contributor.author | Wang, G | en_US |
dc.contributor.author | Zhang, L | en_US |
dc.date.accessioned | 2012-12-19T09:44:24Z | - |
dc.date.available | 2012-12-19T09:44:24Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | International Journal Of Production Research, 2012, v. 50 n. 21, p. 6188-6201 | en_US |
dc.identifier.issn | 0020-7543 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/178253 | - |
dc.description.abstract | In this paper, a two-stage ant colony optimisation (ACO) algorithm is implemented in a multi-agent system (MAS) to accomplish integrated process planning and scheduling (IPPS) in the job shop type flexible manufacturing environments. Traditionally, process planning and scheduling functions are performed sequentially and the actual status of the production facilities is not considered in either process planning or scheduling. IPPS is to combine both the process planning and scheduling problems in the consideration, that is, the actual process plan and the schedule are determined dynamically in accordance with the order details and the status of the manufacturing system. The ACO algorithm can be applied to solve IPPS problems. An innovative two-stage ACO algorithm is introduced in this paper. In the first stage of the algorithm, instead of depositing pheromones on graph edges as in common ant algorithms, ants are directed to deposit pheromones at the nodes to select a set of more favourable processes. In the second stage, the set of nodes not selected in the first stage will be ignored, and pheromones will be deposited along the graph edges while the ants traverse the paths connecting the selected set of nodes. © 2012 Copyright Taylor and Francis Group, LLC. | en_US |
dc.language | eng | en_US |
dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp | en_US |
dc.relation.ispartof | International Journal of Production Research | en_US |
dc.subject | Ant Colony Optimisation | en_US |
dc.subject | Integrated Process Planning And Scheduling | en_US |
dc.subject | Multi-Agent System | en_US |
dc.subject | Process Planning | en_US |
dc.subject | Scheduling | en_US |
dc.title | Integrated process planning and scheduling - Multi-agent system with two-stage ant colony optimisation algorithm | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Wong, TN: tnwong@hku.hk | en_US |
dc.identifier.authority | Wong, TN=rp00192 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1080/00207543.2012.720393 | en_US |
dc.identifier.scopus | eid_2-s2.0-84868217816 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-84868217816&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 50 | en_US |
dc.identifier.issue | 21 | en_US |
dc.identifier.spage | 6188 | en_US |
dc.identifier.epage | 6201 | en_US |
dc.identifier.isi | WOS:000310597100011 | - |
dc.publisher.place | United Kingdom | en_US |
dc.identifier.scopusauthorid | Wong, TN=55301015400 | en_US |
dc.identifier.scopusauthorid | Zhang, S=55443734300 | en_US |
dc.identifier.scopusauthorid | Wang, G=36618061900 | en_US |
dc.identifier.scopusauthorid | Zhang, L=55295535400 | en_US |
dc.identifier.issnl | 0020-7543 | - |