Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/7212
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBakshi, Miroojinen_US
dc.contributor.authorLad, Bhupesh Kumaren_US
dc.date.accessioned2022-03-17T01:00:00Z-
dc.date.accessioned2022-03-21T10:53:02Z-
dc.date.available2022-03-17T01:00:00Z-
dc.date.available2022-03-21T10:53:02Z-
dc.date.issued2017-
dc.identifier.citationUpasani, K., Bakshi, M., Pandhare, V., & Lad, B. K. (2017). Distributed maintenance planning in manufacturing industries. Computers and Industrial Engineering, 108, 1-14. doi:10.1016/j.cie.2017.03.027en_US
dc.identifier.issn0360-8352-
dc.identifier.otherEID(2-s2.0-85017101376)-
dc.identifier.urihttps://doi.org/10.1016/j.cie.2017.03.027-
dc.identifier.urihttps://dspace.iiti.ac.in/handle/123456789/7212-
dc.description.abstractThe combination of sensors and computing infrastructure is becoming increasingly pervasive on the industry shop-floor. Such developments are enabling the automation of more and more industrial practices, and are driving the need to replace conventional planning techniques with schemes that can utilize the capabilities of Cyber-Physical Systems (CPS) and Industrial Internet of Things (IIoT). The future is a place where intelligence is endowed to every entity on the shop floor, and to realize this vision, it is necessary to develop new schemes that can unlock the potential of decentralized data observation and decision-making. Maintenance planning is one such decision-making activity that has evolved over the years to make production more efficient by reducing unplanned downtime and improving product quality. In this work, a distributed algorithm is developed that performs intelligent maintenance planning for identical parallel multi-component machines in a job-shop manufacturing scenario. The algorithm design fits intuitively into the CPS-IIoT paradigm without exacting any additional infrastructure, and is a demonstration of how the paradigm can be effectively deployed. Due to the decentralized nature of the algorithm, its runtime scales with complexity of the problem in terms of number of machines; and the runtime for complex cases is of only a few minutes. The supremacy of the devised algorithm is demonstrated over conventional centralized heuristics such as Memetic Algorithm and Particle Swarm Optimization. © 2017 Elsevier Ltden_US
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.sourceComputers and Industrial Engineeringen_US
dc.subjectCyber Physical Systemen_US
dc.subjectDecision makingen_US
dc.subjectEmbedded systemsen_US
dc.subjectEvolutionary algorithmsen_US
dc.subjectFloorsen_US
dc.subjectIntelligent agentsen_US
dc.subjectMaintenanceen_US
dc.subjectManufactureen_US
dc.subjectOptimizationen_US
dc.subjectParallel algorithmsen_US
dc.subjectParticle swarm optimization (PSO)en_US
dc.subjectPlanningen_US
dc.subjectComputing infrastructuresen_US
dc.subjectCyber-physical systems (CPS)en_US
dc.subjectDistributed maintenanceen_US
dc.subjectIndustrial practicesen_US
dc.subjectIntelligent maintenanceen_US
dc.subjectJob shop manufacturingen_US
dc.subjectMaintenance schedulingen_US
dc.subjectManufacturing industriesen_US
dc.subjectMulti agent systemsen_US
dc.titleDistributed maintenance planning in manufacturing industriesen_US
dc.typeJournal Articleen_US
Appears in Collections:Department of Mechanical Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: