File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Quick value-setting algorithms for the longest path problem of job-shop scheduling

TitleQuick value-setting algorithms for the longest path problem of job-shop scheduling
Authors
KeywordsOptimized Production Scheduling
Programming And Algorithm Theory
Issue Date2005
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, 2005, v. 16 n. 8, p. 956-972 How to Cite?
AbstractPurpose - The disjunctive graph is a network representation of the job-shop scheduling problem, while the longest path problem (LPP) is one of the most important subjects in this research field. This paper aims to study the special topological structure of the disjunctive graph, and proposes a suite of quick value-setting algorithms for solving the LPPs commonly encountered in job-shop scheduling. Design/methodology/approach - The topological structure of the disjunctive graph is analyzed, and some properties and propositions regarding LPPs are presented. Subsequently, algorithms are proposed for solving LPPs encountered in job-shop scheduling. Findings - The proposed algorithms significantly improve the efficiency of the shifting-bottleneck procedure, making it practicable to realise real-time scheduling and hence effective operations of modern manufacturing systems. Originality/value - The paper demonstrates that it is possible to develop very efficient algorithms by imposing a special topological structure on the network. © Emerald Group Publishing Limited.
Persistent Identifierhttp://hdl.handle.net/10722/155879
ISSN
2015 SCImago Journal Rankings: 0.605
References

 

DC FieldValueLanguage
dc.contributor.authorChoi, SHen_US
dc.contributor.authorYang, FYen_US
dc.date.accessioned2012-08-08T08:38:09Z-
dc.date.available2012-08-08T08:38:09Z-
dc.date.issued2005en_US
dc.identifier.citationJournal Of Manufacturing Technology Management, 2005, v. 16 n. 8, p. 956-972en_US
dc.identifier.issn1741-038Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/155879-
dc.description.abstractPurpose - The disjunctive graph is a network representation of the job-shop scheduling problem, while the longest path problem (LPP) is one of the most important subjects in this research field. This paper aims to study the special topological structure of the disjunctive graph, and proposes a suite of quick value-setting algorithms for solving the LPPs commonly encountered in job-shop scheduling. Design/methodology/approach - The topological structure of the disjunctive graph is analyzed, and some properties and propositions regarding LPPs are presented. Subsequently, algorithms are proposed for solving LPPs encountered in job-shop scheduling. Findings - The proposed algorithms significantly improve the efficiency of the shifting-bottleneck procedure, making it practicable to realise real-time scheduling and hence effective operations of modern manufacturing systems. Originality/value - The paper demonstrates that it is possible to develop very efficient algorithms by imposing a special topological structure on the network. © Emerald Group Publishing Limited.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.ispartofJournal of Manufacturing Technology Managementen_US
dc.subjectOptimized Production Schedulingen_US
dc.subjectProgramming And Algorithm Theoryen_US
dc.titleQuick value-setting algorithms for the longest path problem of job-shop schedulingen_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/17410380510627906en_US
dc.identifier.scopuseid_2-s2.0-27744499709en_US
dc.identifier.hkuros107124-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-27744499709&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume16en_US
dc.identifier.issue8en_US
dc.identifier.spage956en_US
dc.identifier.epage972en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridChoi, SH=7408119615en_US
dc.identifier.scopusauthoridYang, FY=9237795200en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats