Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32676
DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineering-
dc.creatorWong, CS-
dc.creatorChan, FTS-
dc.creatorChung, SH-
dc.date.accessioned2015-05-26T08:12:47Z-
dc.date.available2015-05-26T08:12:47Z-
dc.identifier.issn0020-7543-
dc.identifier.urihttp://hdl.handle.net/10397/32676-
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.subjectgenetic algorithmen_US
dc.subjectpreventive maintenanceen_US
dc.subjectproduction schedulingen_US
dc.titleA joint production scheduling approach considering multiple resources and preventive maintenance tasksen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage883-
dc.identifier.epage896-
dc.identifier.volume51-
dc.identifier.issue3-
dc.identifier.doi10.1080/00207543.2012.677070-
dcterms.abstractIn reality, preventive maintenance (PM) tasks usually include lubrication, cleaning, inspection, adjustment, alignment and/or replacement. They should be planned before failure occurs, aiming to improve the overall reliability and availability of the production system. In the literature on PM scheduling, researchers usually consider maintenance as a single task and schedule it together with the production schedule. This may result in poor predictions on maintenance scheduling since different kinds of PM tasks have different maintenance intervals and require different durations. Production also involves various kinds of resources, such as plastics production requiring injection machines and moulds. These resources require different sets of maintenance treatment. If maintenance schedules for different resources are not harmonised, the planned production will be disturbed dramatically by the non-availability of resources. In this aspect, this paper proposes a joint scheduling (JS) method to handle production-maintenance scheduling that considers multiple resources and maintenance tasks. A genetic algorithm approach is applied to hypothetical numerical examples with the objective of minimising the makespan. The numerical solutions obtained show that the proposed JS method significantly reduces the makespan in this new scheduling problem.-
dcterms.bibliographicCitationInternational journal of production research, 2013, v. 51, no. 3, p. 883-896-
dcterms.isPartOfInternational journal of production research-
dcterms.issued2013-
dc.identifier.isiWOS:000313036700016-
dc.identifier.scopus2-s2.0-84871252419-
dc.identifier.eissn1366-588X-
dc.identifier.rosgroupidr66699-
dc.description.ros2012-2013 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

56
Last Week
0
Last month
3
Citations as of Sep 7, 2020

WEB OF SCIENCETM
Citations

44
Last Week
0
Last month
4
Citations as of Oct 20, 2020

Page view(s)

133
Last Week
0
Last month
Citations as of Oct 26, 2020

Google ScholarTM

Check

Altmetric


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