File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows

TitleHybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows
Authors
Keywordsblocking scheduling
genetic algorithm
multistage flowshop scheduling
Issue Date2011
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp
Citation
International Journal Of Production Research, 2011, v. 49 n. 6, p. 1575-1603 How to Cite?
AbstractThis research considers a two-stage hybrid flowshop scheduling problem with challenging characteristics substantiated by the complexity of the problem in a collaborating company. Multiple (three) parallel machines are involved in the first stage and only one machine in the second stage. Stage 1 parallel machines are able to process multiple jobs simultaneously but the jobs must be sequentially setup one after another with the loading time depending on the processing time of the stage 2 machine. A blocking environment exists between the two stages with no intermediate buffer storage. In order to reduce the complexity, multiple simultaneous jobs are grouped into batches according to their similarities. Batches can then be considered as basic units for scheduling to determine which stage 1 machine and in what sequence batches are loaded. A genetic algorithm is used to obtain near-optimal schedules mainly by minimising the makespan. The proposed model and solution algorithm are applied to solve the problem in the collaborating company under a set of complicated rules and constraints. Comprehensive studies are conducted with real-life data. The results are consistent with the company's operational principles and are superior compared with the manual schedules. © 2011 Taylor & Francis.
Persistent Identifierhttp://hdl.handle.net/10722/74558
ISSN
2015 Impact Factor: 1.693
2015 SCImago Journal Rankings: 1.445
ISI Accession Number ID
Funding AgencyGrant Number
Hong Kong University Research Committee
HKSAR RGC (GRF)
HKSAR ITF
Funding Information:

The authors would like to thank Hong Kong University Research Committee, HKSAR RGC (GRF) and HKSAR ITF, and industrial collaborator for financial and technical support.

References

 

DC FieldValueLanguage
dc.contributor.authorLuo, Hen_HK
dc.contributor.authorHuang, GQen_HK
dc.contributor.authorFeng Zhang, Yen_HK
dc.contributor.authorYun Dai, Qen_HK
dc.date.accessioned2010-09-06T07:02:31Z-
dc.date.available2010-09-06T07:02:31Z-
dc.date.issued2011en_HK
dc.identifier.citationInternational Journal Of Production Research, 2011, v. 49 n. 6, p. 1575-1603en_HK
dc.identifier.issn0020-7543en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74558-
dc.description.abstractThis research considers a two-stage hybrid flowshop scheduling problem with challenging characteristics substantiated by the complexity of the problem in a collaborating company. Multiple (three) parallel machines are involved in the first stage and only one machine in the second stage. Stage 1 parallel machines are able to process multiple jobs simultaneously but the jobs must be sequentially setup one after another with the loading time depending on the processing time of the stage 2 machine. A blocking environment exists between the two stages with no intermediate buffer storage. In order to reduce the complexity, multiple simultaneous jobs are grouped into batches according to their similarities. Batches can then be considered as basic units for scheduling to determine which stage 1 machine and in what sequence batches are loaded. A genetic algorithm is used to obtain near-optimal schedules mainly by minimising the makespan. The proposed model and solution algorithm are applied to solve the problem in the collaborating company under a set of complicated rules and constraints. Comprehensive studies are conducted with real-life data. The results are consistent with the company's operational principles and are superior compared with the manual schedules. © 2011 Taylor & Francis.en_HK
dc.languageengen_HK
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.aspen_HK
dc.relation.ispartofInternational Journal of Production Researchen_HK
dc.subjectblocking schedulingen_HK
dc.subjectgenetic algorithmen_HK
dc.subjectmultistage flowshop schedulingen_HK
dc.titleHybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windowsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-7543&volume=49&issue=6&spage=1575&epage=1603&date=2011&atitle=Hybrid+flowshop+scheduling+with+batch-discrete+processors+and+machine+maintenance+in+time+windowsen_HK
dc.identifier.emailHuang, GQ:gqhuang@hkucc.hku.hken_HK
dc.identifier.authorityHuang, GQ=rp00118en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1080/00207541003610262en_HK
dc.identifier.scopuseid_2-s2.0-78650623486en_HK
dc.identifier.hkuros169609en_HK
dc.identifier.hkuros215169-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-78650623486&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume49en_HK
dc.identifier.issue6en_HK
dc.identifier.spage1575en_HK
dc.identifier.epage1603en_HK
dc.identifier.eissn1366-588X-
dc.identifier.isiWOS:000285413400004-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridLuo, H=34771707000en_HK
dc.identifier.scopusauthoridHuang, GQ=7403425048en_HK
dc.identifier.scopusauthoridFeng Zhang, Y=36767204600en_HK
dc.identifier.scopusauthoridYun Dai, Q=36702338900en_HK
dc.identifier.citeulike8599730-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats