Back to Search
Start Over
Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation.
- Source :
-
Mathematics (2227-7390) . Dec2023, Vol. 11 Issue 23, p4745. 14p. - Publication Year :
- 2023
-
Abstract
- Green scheduling that aims to enhance efficiency by optimizing resource allocation and job sequencing concurrently has gained growing academic attention. To tackle such problems with the consideration of scheduling and resource allocation, this paper considers a single-machine group scheduling problem with common/slack due-date assignment and a controllable processing time. The objective is to decide the optimized schedule of the group/job sequence, resource allocation, and due-date assignment. To solve the generalized case, this paper proves several optimal properties and presents a branch-and-bound algorithm and heuristic algorithms. Numerical experiments show that the branch-and-bound algorithm is efficient and the heuristic algorithm developed based on the analytical properties outruns the tabu search. [ABSTRACT FROM AUTHOR]
- Subjects :
- *RESOURCE allocation
*TABU search algorithm
*HEURISTIC algorithms
*SCHEDULING
Subjects
Details
- Language :
- English
- ISSN :
- 22277390
- Volume :
- 11
- Issue :
- 23
- Database :
- Academic Search Index
- Journal :
- Mathematics (2227-7390)
- Publication Type :
- Academic Journal
- Accession number :
- 174113360
- Full Text :
- https://doi.org/10.3390/math11234745