We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously.
- Authors
Li, Ming-Hui; Lv, Dan-Yang; Lu, Yuan-Yuan; Wang, Ji-Bo
- Abstract
This paper studies the single-machine group scheduling problem with convex resource allocation and learning effect. The number of jobs in each group is different, and the corresponding common due dates are also different, where the processing time of jobs follows a convex function of resource allocation. Under common due date assignment, the objective is to minimize the weighted sum of earliness, tardiness, common due date, resource consumption, and makespan. To solve the problem, we present the heuristic, simulated annealing, and branch-and-bound algorithms. Computational experiments indicate that the proposed algorithms are effective.
- Subjects
RESOURCE allocation; GROUP technology; SCHEDULING; CONVEX functions; SIMULATED annealing; TARDINESS; COMPUTER scheduling
- Publication
Mathematics (2227-7390), 2024, Vol 12, Issue 7, p1029
- ISSN
2227-7390
- Publication type
Article
- DOI
10.3390/math12071029