File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A sequencing algorithm for makespan minimization in FMS

TitleA sequencing algorithm for makespan minimization in FMS
Authors
KeywordsFlexible manufacturing systems
Identification
Sequential production
Tracking
Issue Date2004
PublisherEmerald Group Publishing Limited. The Journal's web site is located at http://www.emeraldinsight.com/info/journals/jmtm/jmtm.jsp
Citation
Journal Of Manufacturing Technology Management, 2004, v. 15 n. 3, p. 291-297 How to Cite?
AbstractJob sequencing is an important stage in any hierarchical production control model, especially when a real-time dispatching rule is not employed. The problems become complicated when constraints, such as different parts requiring different operation processes at different machines and with different production priorities, are taken into consideration in the development of sequencing models. This paper first describes a mathematical programming model developed for small flexible manufacturing systems (FMS) makespan minimization sequencing problems. For large problems, a heuristic decomposition-based algorithm is proposed. The algorithm is based on the proposed concept of track generation and track identification. Each part type may require a different number of operation processes at different machines. A numerical example is used to illustrate the use of the algorithm.
Persistent Identifierhttp://hdl.handle.net/10722/42119
ISSN
2015 SCImago Journal Rankings: 0.605
References

 

DC FieldValueLanguage
dc.contributor.authorChoi, SHen_HK
dc.contributor.authorLee, JSLen_HK
dc.date.accessioned2007-01-08T02:29:27Z-
dc.date.available2007-01-08T02:29:27Z-
dc.date.issued2004en_HK
dc.identifier.citationJournal Of Manufacturing Technology Management, 2004, v. 15 n. 3, p. 291-297en_HK
dc.identifier.issn1741-038Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/42119-
dc.description.abstractJob sequencing is an important stage in any hierarchical production control model, especially when a real-time dispatching rule is not employed. The problems become complicated when constraints, such as different parts requiring different operation processes at different machines and with different production priorities, are taken into consideration in the development of sequencing models. This paper first describes a mathematical programming model developed for small flexible manufacturing systems (FMS) makespan minimization sequencing problems. For large problems, a heuristic decomposition-based algorithm is proposed. The algorithm is based on the proposed concept of track generation and track identification. Each part type may require a different number of operation processes at different machines. A numerical example is used to illustrate the use of the algorithm.en_HK
dc.format.extent818043 bytes-
dc.format.extent13623 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.languageengen_HK
dc.publisherEmerald Group Publishing Limited. The Journal's web site is located at http://www.emeraldinsight.com/info/journals/jmtm/jmtm.jspen_HK
dc.relation.ispartofJournal of Manufacturing Technology Managementen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectFlexible manufacturing systemsen_HK
dc.subjectIdentificationen_HK
dc.subjectSequential productionen_HK
dc.subjectTrackingen_HK
dc.titleA sequencing algorithm for makespan minimization in FMSen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1741-038X&volume=15&issue=3&spage=291&epage=297&date=2004&atitle=A+sequencing+algorithm+for+makespan+minimization+in+FMSen_HK
dc.identifier.emailChoi, SH:shchoi@hkucc.hku.hken_HK
dc.identifier.authorityChoi, SH=rp00109en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1108/17410380410523515en_HK
dc.identifier.scopuseid_2-s2.0-2942516393en_HK
dc.identifier.hkuros80509-
dc.identifier.hkuros28365-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-2942516393&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume15en_HK
dc.identifier.issue3en_HK
dc.identifier.spage291en_HK
dc.identifier.epage297en_HK
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridChoi, SH=7408119615en_HK
dc.identifier.scopusauthoridLee, JSL=8438644700en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats