File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A sequence algorithm for minimising makespan in multi-part and multi-machine flowshop cases

TitleA sequence algorithm for minimising makespan in multi-part and multi-machine flowshop cases
Authors
KeywordsAlgorithms
Flexibility
Makespan
Parts
Scheduling
Issue Date2000
PublisherEmerald Group Publishing Limited. The Journal's web site is located at http://www.emeraldinsight.com/info/journals/jmtm/jmtm.jsp
Citation
Integrated Manufacturing Systems, 2000, v. 11 n. 1, p. 62-73 How to Cite?
AbstractMinimising makespan aims to achieve high utilisation of equipment and resources by getting all jobs out quickly. This is an important scheduling criterion, especially for automated systems, because of the high investment cost. The problem, however, becomes complex when many parts and machines are involved. This is because different parts may require different numbers of operations, and there are many possible schedules. For small problems, a mathematical programming model for minimising makespan is formulated. For large problems, a sequencing algorithm based on decomposition and pairwise comparison is proposed. The idea of "total overlapping time" in the sequencing algorithm is introduced to determine the solution of each sub-schedule. It maximises the number of jobs working at different machines at the same time, while satisfying the parts' operation precedence and machine constraints. The differences between this method and the traditional graphical method are discussed. The sequencing algorithm significantly reduces the number of schedules for consideration and hence, the computational power required. © MCB University Press.
Persistent Identifierhttp://hdl.handle.net/10722/155841
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChoi, SHen_US
dc.contributor.authorLee, JSLen_US
dc.date.accessioned2012-08-08T08:37:59Z-
dc.date.available2012-08-08T08:37:59Z-
dc.date.issued2000en_US
dc.identifier.citationIntegrated Manufacturing Systems, 2000, v. 11 n. 1, p. 62-73en_US
dc.identifier.issn0957-6061en_US
dc.identifier.urihttp://hdl.handle.net/10722/155841-
dc.description.abstractMinimising makespan aims to achieve high utilisation of equipment and resources by getting all jobs out quickly. This is an important scheduling criterion, especially for automated systems, because of the high investment cost. The problem, however, becomes complex when many parts and machines are involved. This is because different parts may require different numbers of operations, and there are many possible schedules. For small problems, a mathematical programming model for minimising makespan is formulated. For large problems, a sequencing algorithm based on decomposition and pairwise comparison is proposed. The idea of "total overlapping time" in the sequencing algorithm is introduced to determine the solution of each sub-schedule. It maximises the number of jobs working at different machines at the same time, while satisfying the parts' operation precedence and machine constraints. The differences between this method and the traditional graphical method are discussed. The sequencing algorithm significantly reduces the number of schedules for consideration and hence, the computational power required. © MCB University Press.en_US
dc.languageengen_US
dc.publisherEmerald Group Publishing Limited. The Journal's web site is located at http://www.emeraldinsight.com/info/journals/jmtm/jmtm.jspen_US
dc.relation.ispartofIntegrated Manufacturing Systemsen_US
dc.subjectAlgorithmsen_US
dc.subjectFlexibilityen_US
dc.subjectMakespanen_US
dc.subjectPartsen_US
dc.subjectSchedulingen_US
dc.titleA sequence algorithm for minimising makespan in multi-part and multi-machine flowshop casesen_US
dc.typeArticleen_US
dc.identifier.emailChoi, SH:shchoi@hkucc.hku.hken_US
dc.identifier.authorityChoi, SH=rp00109en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1108/09576060010303677-
dc.identifier.scopuseid_2-s2.0-0033708140en_US
dc.identifier.hkuros55030-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0033708140&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume11en_US
dc.identifier.issue1en_US
dc.identifier.spage62en_US
dc.identifier.epage73en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridChoi, SH=7408119615en_US
dc.identifier.scopusauthoridLee, JSL=8438644700en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats