File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm

TitleTwo-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm
Authors
KeywordsBatching scheduling
Flowshop scheduling
Genetic algorithm
Issue Date2009
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/rcim
Citation
Robotics And Computer-Integrated Manufacturing, 2009, v. 25 n. 6, p. 962-971 How to Cite?
AbstractThis research investigates a two-stage hybrid flowshop scheduling problem in a metal-working company. The first stage consists of multiple parallel machines and the second stage has only one machine. Four characteristics of the company have substantiated the complexity of the problem. First, all machines in stage one are able to process multiple jobs simultaneously but the jobs must be sequentially set up one after another. Second, the setup time of each job is separated from its processing time and depends upon its preceding job. Third, a blocking environment exists between two stages with no intermediate buffer storage. Finally, machines are not continuously available due to the preventive maintenance and machine breakdown. Two types of machine unavailability, namely, deterministic case and stochastic case, are identified in this problem. The former occurs on stage-two machine with the start time and the end time known in advance. The latter occurs on one of the parallel machine in stage one and a real-time rescheduling will be triggered. Minimizing the makespan is considered as the objective to develop the optimal scheduling algorithm. A genetic algorithm is used to obtain a near-optimal solution. The computational results with actual data are favorable and superior over the results from existing manual schedules. © 2009 Elsevier Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/74500
ISSN
2015 Impact Factor: 2.077
2015 SCImago Journal Rankings: 1.621
ISI Accession Number ID
Funding AgencyGrant Number
NSFC70629002
Hong Kong SAR ITFGHP/042/07LP
China 863 High-Tech Program2006AA04ZI32
Guangdong CIMS Key Lab05200197
Funding Information:

The authors are grateful to the collaborating company for its generous financial support for this research. Financial support from NSFC (#70629002), Hong Kong SAR ITF Grant (GHP/042/07LP), China 863 High-Tech Program (2006AA04ZI32) and Guangdong CIMS Key Lab (05200197) are also acknowledged.

References
Grants

 

DC FieldValueLanguage
dc.contributor.authorLuo, Hen_HK
dc.contributor.authorHuang, GQen_HK
dc.contributor.authorZhang, Yen_HK
dc.contributor.authorDai, Qen_HK
dc.contributor.authorChen, Xen_HK
dc.date.accessioned2010-09-06T07:01:56Z-
dc.date.available2010-09-06T07:01:56Z-
dc.date.issued2009en_HK
dc.identifier.citationRobotics And Computer-Integrated Manufacturing, 2009, v. 25 n. 6, p. 962-971en_HK
dc.identifier.issn0736-5845en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74500-
dc.description.abstractThis research investigates a two-stage hybrid flowshop scheduling problem in a metal-working company. The first stage consists of multiple parallel machines and the second stage has only one machine. Four characteristics of the company have substantiated the complexity of the problem. First, all machines in stage one are able to process multiple jobs simultaneously but the jobs must be sequentially set up one after another. Second, the setup time of each job is separated from its processing time and depends upon its preceding job. Third, a blocking environment exists between two stages with no intermediate buffer storage. Finally, machines are not continuously available due to the preventive maintenance and machine breakdown. Two types of machine unavailability, namely, deterministic case and stochastic case, are identified in this problem. The former occurs on stage-two machine with the start time and the end time known in advance. The latter occurs on one of the parallel machine in stage one and a real-time rescheduling will be triggered. Minimizing the makespan is considered as the objective to develop the optimal scheduling algorithm. A genetic algorithm is used to obtain a near-optimal solution. The computational results with actual data are favorable and superior over the results from existing manual schedules. © 2009 Elsevier Ltd. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/rcimen_HK
dc.relation.ispartofRobotics and Computer-Integrated Manufacturingen_HK
dc.subjectBatching schedulingen_HK
dc.subjectFlowshop schedulingen_HK
dc.subjectGenetic algorithmen_HK
dc.titleTwo-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithmen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0736-5845&volume=25&spage=962&epage=971 &date=2009&atitle=Two-stage+hybrid+batching+flowshop+scheduling+with+blocking+and+machine+availability+constraints+using+genetic+algorithm+en_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.1016/j.rcim.2009.06.001en_HK
dc.identifier.scopuseid_2-s2.0-68949220786en_HK
dc.identifier.hkuros165628en_HK
dc.identifier.hkuros215166-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-68949220786&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume25en_HK
dc.identifier.issue6en_HK
dc.identifier.spage962en_HK
dc.identifier.epage971en_HK
dc.identifier.isiWOS:000270636700015-
dc.publisher.placeUnited Kingdomen_HK
dc.relation.projectRFID-Enabled Real-Time Manufacturing Shop-floor Information Infrastructure for PRD Processing Trade Enterprises-
dc.identifier.scopusauthoridLuo, H=34771707000en_HK
dc.identifier.scopusauthoridHuang, GQ=7403425048en_HK
dc.identifier.scopusauthoridZhang, Y=8305738300en_HK
dc.identifier.scopusauthoridDai, Q=7202735140en_HK
dc.identifier.scopusauthoridChen, X=15031490600en_HK
dc.identifier.citeulike5316453-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats