Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints.
Saved in:
| Title: | Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints. |
|---|---|
| Authors: | Wang, Lili1 (AUTHOR), Li, Min1,2 (AUTHOR), Kong, Guanbin1 (AUTHOR), Xu, Haiwen2 (AUTHOR) hwxu@cafuc.edu.cn |
| Source: | Annals of Operations Research. Jul2024, Vol. 338 Issue 2/3, p1157-1185. 29p. |
| Subjects: | Bilevel programming, Heuristic programming, Heuristic algorithms, Greedy algorithms, Nonlinear programming, Economic lot size, Production quantity |
| Abstract: | This paper concentrates on the divisional seru scheduling and worker assignment joint decision-making problem, and synthetically considers the difference in workers' skill sets, the diversity of workers' skill levels, the process sequence constraints, setup time, lot-splitting, etc., and then a nonlinear integer programming model is constructed to minimize the makespan. We show that it is necessary to consider the process sequence constraints, and the optimal makespan of the worker-operation allocation scheme without considering the process sequence constraints is much larger than that of considering the process sequence constraints. Moreover, as the number of workers increases, the advantage of considering sequence constraints becomes more obvious. Considering the multi-decision attributes and intractable computations of the studied problem, we turn it into bi-level programming. Then based on the combination of a hybrid genetic variable neighbourhood search algorithm (HGVNSA) and a greedy heuristic algorithm (GHA), a bi-level nested heuristic algorithm (HGVNSA-GHA) is designed. Finally, numerical experiment results show that the proposed algorithm can achieve better results and higher efficiency for the divisional seru scheduling and worker assignment model. [ABSTRACT FROM AUTHOR] |
| Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 178679087 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Wang%2C+Lili%22">Wang, Lili</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Li%2C+Min%22">Li, Min</searchLink><relatesTo>1,2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Kong%2C+Guanbin%22">Kong, Guanbin</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Xu%2C+Haiwen%22">Xu, Haiwen</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> hwxu@cafuc.edu.cn</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>. Jul2024, Vol. 338 Issue 2/3, p1157-1185. 29p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Bilevel+programming%22">Bilevel programming</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic+programming%22">Heuristic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic+algorithms%22">Heuristic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Greedy+algorithms%22">Greedy algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Nonlinear+programming%22">Nonlinear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Economic+lot+size%22">Economic lot size</searchLink><br /><searchLink fieldCode="DE" term="%22Production+quantity%22">Production quantity</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper concentrates on the divisional seru scheduling and worker assignment joint decision-making problem, and synthetically considers the difference in workers' skill sets, the diversity of workers' skill levels, the process sequence constraints, setup time, lot-splitting, etc., and then a nonlinear integer programming model is constructed to minimize the makespan. We show that it is necessary to consider the process sequence constraints, and the optimal makespan of the worker-operation allocation scheme without considering the process sequence constraints is much larger than that of considering the process sequence constraints. Moreover, as the number of workers increases, the advantage of considering sequence constraints becomes more obvious. Considering the multi-decision attributes and intractable computations of the studied problem, we turn it into bi-level programming. Then based on the combination of a hybrid genetic variable neighbourhood search algorithm (HGVNSA) and a greedy heuristic algorithm (GHA), a bi-level nested heuristic algorithm (HGVNSA-GHA) is designed. Finally, numerical experiment results show that the proposed algorithm can achieve better results and higher efficiency for the divisional seru scheduling and worker assignment model. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=178679087 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10479-024-05983-w Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 29 StartPage: 1157 Subjects: – SubjectFull: Bilevel programming Type: general – SubjectFull: Heuristic programming Type: general – SubjectFull: Heuristic algorithms Type: general – SubjectFull: Greedy algorithms Type: general – SubjectFull: Nonlinear programming Type: general – SubjectFull: Economic lot size Type: general – SubjectFull: Production quantity Type: general Titles: – TitleFull: Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Wang, Lili – PersonEntity: Name: NameFull: Li, Min – PersonEntity: Name: NameFull: Kong, Guanbin – PersonEntity: Name: NameFull: Xu, Haiwen IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 07 Text: Jul2024 Type: published Y: 2024 Identifiers: – Type: issn-print Value: 02545330 Numbering: – Type: volume Value: 338 – Type: issue Value: 2/3 Titles: – TitleFull: Annals of Operations Research Type: main |
| ResultId | 1 |
