File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A machine-order search space for job-shop scheduling problems

TitleA machine-order search space for job-shop scheduling problems
Authors
KeywordsMachine-order
Search space
Job-shop scheduling
Issue Date2003
PublisherBlackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/ITOR
Citation
International Transactions in Operational Research, 2003, v. 10 n. 6, p. 597-610 How to Cite?
AbstractThis paper proposes a methodology for real-time job-shop scheduling problems. It introduces a new classification of the scheduling methods for JSSPs with emphasis on the search methods and the significance of the search space. Subsequently, a machine-order search space is proposed as a new framework in which different single-machine scheduling algorithms and search methods can be incorporated to solve JSSPs. An optimization model relating makespan minimization and the proposed machine-order search space is also described. The proposed methodology finds an optimal solution by searching a proper machine order in the machine-order search space and scheduling the machines one by one in this order. Such an approach significantly reduces the size of the search space, and hence the computing efforts. As a result, scheduling of large JSSPs in real-time becomes practicable.
Persistent Identifierhttp://hdl.handle.net/10722/74597
ISSN
2015 Impact Factor: 1.255
2015 SCImago Journal Rankings: 1.179

 

DC FieldValueLanguage
dc.contributor.authorChoi, SH-
dc.contributor.authorYang, FY-
dc.date.accessioned2010-09-06T07:02:54Z-
dc.date.available2010-09-06T07:02:54Z-
dc.date.issued2003-
dc.identifier.citationInternational Transactions in Operational Research, 2003, v. 10 n. 6, p. 597-610-
dc.identifier.issn0969-6016-
dc.identifier.urihttp://hdl.handle.net/10722/74597-
dc.description.abstractThis paper proposes a methodology for real-time job-shop scheduling problems. It introduces a new classification of the scheduling methods for JSSPs with emphasis on the search methods and the significance of the search space. Subsequently, a machine-order search space is proposed as a new framework in which different single-machine scheduling algorithms and search methods can be incorporated to solve JSSPs. An optimization model relating makespan minimization and the proposed machine-order search space is also described. The proposed methodology finds an optimal solution by searching a proper machine order in the machine-order search space and scheduling the machines one by one in this order. Such an approach significantly reduces the size of the search space, and hence the computing efforts. As a result, scheduling of large JSSPs in real-time becomes practicable.-
dc.languageeng-
dc.publisherBlackwell Publishing Ltd. The Journal's web site is located at http://www.blackwellpublishing.com/journals/ITOR-
dc.relation.ispartofInternational Transactions in Operational Research-
dc.rightsThe definitive version is available at www.blackwell-synergy.com-
dc.subjectMachine-order-
dc.subjectSearch space-
dc.subjectJob-shop scheduling-
dc.titleA machine-order search space for job-shop scheduling problems-
dc.typeArticle-
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0969-6016&volume=&issue=10&spage=597&epage=610&date=2003&atitle=A+machine-order+search+space+for+job-shop+scheduling+problemsen_HK
dc.identifier.emailChoi, SH: shchoi@hkucc.hku.hk-
dc.identifier.emailYang, FY: fyang@hkusua.hku.hk-
dc.identifier.authorityChoi, SH=rp00109-
dc.identifier.doi10.1111/1475-3995.00430-
dc.identifier.hkuros80512-
dc.identifier.volume10-
dc.identifier.issue6-
dc.identifier.spage597-
dc.identifier.epage610-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats