File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/00207541003610262
- Scopus: eid_2-s2.0-78650623486
- WOS: WOS:000285413400004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows
Title | Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows | ||||||||
---|---|---|---|---|---|---|---|---|---|
Authors | |||||||||
Keywords | blocking scheduling genetic algorithm multistage flowshop scheduling | ||||||||
Issue Date | 2011 | ||||||||
Publisher | Taylor & 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? | ||||||||
Abstract | This 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 Identifier | http://hdl.handle.net/10722/74558 | ||||||||
ISSN | 2021 Impact Factor: 9.018 2020 SCImago Journal Rankings: 1.909 | ||||||||
ISI Accession Number ID |
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 Field | Value | Language |
---|---|---|
dc.contributor.author | Luo, H | en_HK |
dc.contributor.author | Huang, GQ | en_HK |
dc.contributor.author | Feng Zhang, Y | en_HK |
dc.contributor.author | Yun Dai, Q | en_HK |
dc.date.accessioned | 2010-09-06T07:02:31Z | - |
dc.date.available | 2010-09-06T07:02:31Z | - |
dc.date.issued | 2011 | en_HK |
dc.identifier.citation | International Journal Of Production Research, 2011, v. 49 n. 6, p. 1575-1603 | en_HK |
dc.identifier.issn | 0020-7543 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/74558 | - |
dc.description.abstract | This 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.language | eng | en_HK |
dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp | en_HK |
dc.relation.ispartof | International Journal of Production Research | en_HK |
dc.subject | blocking scheduling | en_HK |
dc.subject | genetic algorithm | en_HK |
dc.subject | multistage flowshop scheduling | en_HK |
dc.title | Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://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+windows | en_HK |
dc.identifier.email | Huang, GQ:gqhuang@hkucc.hku.hk | en_HK |
dc.identifier.authority | Huang, GQ=rp00118 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1080/00207541003610262 | en_HK |
dc.identifier.scopus | eid_2-s2.0-78650623486 | en_HK |
dc.identifier.hkuros | 169609 | en_HK |
dc.identifier.hkuros | 215169 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-78650623486&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 49 | en_HK |
dc.identifier.issue | 6 | en_HK |
dc.identifier.spage | 1575 | en_HK |
dc.identifier.epage | 1603 | en_HK |
dc.identifier.eissn | 1366-588X | - |
dc.identifier.isi | WOS:000285413400004 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Luo, H=34771707000 | en_HK |
dc.identifier.scopusauthorid | Huang, GQ=7403425048 | en_HK |
dc.identifier.scopusauthorid | Feng Zhang, Y=36767204600 | en_HK |
dc.identifier.scopusauthorid | Yun Dai, Q=36702338900 | en_HK |
dc.identifier.citeulike | 8599730 | - |
dc.identifier.issnl | 0020-7543 | - |