Show simple item record

dc.contributor.authorSu, Bentao
dc.contributor.authorXie, Naiming
dc.contributor.authorYang, Yingjie
dc.date.accessioned2020-07-07T09:00:49Z
dc.date.available2020-07-07T09:00:49Z
dc.date.issued2020-05-30
dc.identifier.citationSu, B., Xie, N. and Yang, Y. (2020) Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem. Journal of Intelligent Manufacturing.en
dc.identifier.issn0956-5515
dc.identifier.urihttps://dora.dmu.ac.uk/handle/2086/19941
dc.descriptionThe file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.en
dc.description.abstractIn this paper we focus on an unrelated parallel workgroup scheduling problem where each workgroup is composed of a number of personnel with similar work skills which has eligibility and human resource constraints. The most difference from the general unrelated parallel machine scheduling with resource constraints is that one workgroup can process multiple jobs at a time as long as the resources are available, which means that a feasible scheduling scheme is impossible to get if we consider the processing sequence of jobs only in time dimension. We construct this problem as an integer programming model with the objective of minimizing makespan. As it is incapable to get the optimal solution in the acceptable time for the presented model by exact algorithm, meta-heuristic is considered to design. A pure genetic algorithm based on special coding design is proposed firstly. Then a hybrid genetic algorithm based on bin packing strategy is further developed by the consideration of transforming the single workgroup scheduling to a strip-packing problem. Finally, the proposed algorithms, together with exact approach, are tested at different size of instances. Results demonstrate that the proposed hybrid genetic algorithm shows the effective performance.en
dc.language.isoenen
dc.publisherSpringeren
dc.subjectUnrelated parallel machine problemen
dc.subjectWorkgroup schedulingen
dc.subjectTwodimensional bin packing problemen
dc.subjectHeuristic strategyen
dc.subjectGenetic algorithmen
dc.titleHybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problemen
dc.typeArticleen
dc.identifier.doihttps://doi.org/10.1007/s10845-020-01597-8
dc.peerreviewedYesen
dc.funderOther external funder (please detail below)en
dc.projectidIEC\NSFC\170391en
dc.cclicenceCC-BY-NCen
dc.date.acceptance2020-05-22
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en
dc.funder.otherRoyal Societyen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record