File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A filter search algorithm based on machine-order space for job-shop scheduling problems

TitleA filter search algorithm based on machine-order space for job-shop scheduling problems
Authors
KeywordsAlgorithmic languages
Job production systems
Order systems
Issue Date2006
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, 2006, v. 17 n. 3, p. 376-392 How to Cite?
AbstractPurpose - The research aims to develop a practicable method to solve relatively large job-shop scheduling problems (JSSP) for production planning in real-time. Design/methodology/approach - This paper analyses some search strategies based on machine-order space, and proposes a filter search algorithm (FSA) to reduce computing time by improving the speed of finding a proper machine order. Numerical experiments are conducted to verify the FSA. Findings - The experiments confirmed the superior performance of the FSA, making it possible to solve relatively large JSSPs in real-time. The results showed that the leaf-node number affects the solution quality. The performance can be improved by increasing the leaf-node number. There is a significant decrease in the average quality deviation when the leaf-node number increases; but the decreasing rate becomes minor when the leaf-node number is relatively large. While triple filters may provide more leaf-node numbers for the FSA, dual filters are considered enough for most practical scheduling problems. A method is proposed to determine appropriate leaf-node numbers for practical production environments. Research limitations/implications - A limitation is that the FSA's performance is affected by the choice of leaf-node number. Although the relationships between the solution quality and the leaf-node number for some problems have been worked out, it will be useful future research to deduce the relationships for other job-shop instances of different sizes. Originality/value - The FSA is a new approach, which is particularly useful for planning production schedules needed for efficient and responsive management of manufacturing systems to cope with increasing global competition and market changes. © Emerald Group Publishing Limited.
Persistent Identifierhttp://hdl.handle.net/10722/74531
ISSN
2015 SCImago Journal Rankings: 0.605
References

 

DC FieldValueLanguage
dc.contributor.authorChoi, SHen_HK
dc.contributor.authorYang, FYen_HK
dc.date.accessioned2010-09-06T07:02:15Z-
dc.date.available2010-09-06T07:02:15Z-
dc.date.issued2006en_HK
dc.identifier.citationJournal Of Manufacturing Technology Management, 2006, v. 17 n. 3, p. 376-392en_HK
dc.identifier.issn1741-038Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/74531-
dc.description.abstractPurpose - The research aims to develop a practicable method to solve relatively large job-shop scheduling problems (JSSP) for production planning in real-time. Design/methodology/approach - This paper analyses some search strategies based on machine-order space, and proposes a filter search algorithm (FSA) to reduce computing time by improving the speed of finding a proper machine order. Numerical experiments are conducted to verify the FSA. Findings - The experiments confirmed the superior performance of the FSA, making it possible to solve relatively large JSSPs in real-time. The results showed that the leaf-node number affects the solution quality. The performance can be improved by increasing the leaf-node number. There is a significant decrease in the average quality deviation when the leaf-node number increases; but the decreasing rate becomes minor when the leaf-node number is relatively large. While triple filters may provide more leaf-node numbers for the FSA, dual filters are considered enough for most practical scheduling problems. A method is proposed to determine appropriate leaf-node numbers for practical production environments. Research limitations/implications - A limitation is that the FSA's performance is affected by the choice of leaf-node number. Although the relationships between the solution quality and the leaf-node number for some problems have been worked out, it will be useful future research to deduce the relationships for other job-shop instances of different sizes. Originality/value - The FSA is a new approach, which is particularly useful for planning production schedules needed for efficient and responsive management of manufacturing systems to cope with increasing global competition and market changes. © Emerald Group Publishing Limited.en_HK
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.subjectAlgorithmic languagesen_HK
dc.subjectJob production systemsen_HK
dc.subjectOrder systemsen_HK
dc.titleA filter search algorithm based on machine-order space for job-shop scheduling problemsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1741-038X&volume=17&issue=3&spage=376&epage=392&date=2006&atitle=A+filter+search+algorithm+based+on+machine-order+space+for+job-shop+scheduling+problemsen_HK
dc.identifier.emailChoi, SH:shchoi@hkucc.hku.hken_HK
dc.identifier.authorityChoi, SH=rp00109en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1108/17410380610648326en_HK
dc.identifier.scopuseid_2-s2.0-33644583643en_HK
dc.identifier.hkuros107127en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33644583643&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume17en_HK
dc.identifier.issue3en_HK
dc.identifier.spage376en_HK
dc.identifier.epage392en_HK
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridChoi, SH=7408119615en_HK
dc.identifier.scopusauthoridYang, FY=9237795200en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats