Asset Details
Do you wish to reserve the book?
Resource Allocation and Minmax Scheduling Under Group Technology and Different Due-Window Assignments
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Resource Allocation and Minmax Scheduling Under Group Technology and Different Due-Window Assignments
Do you wish to request the book?
Resource Allocation and Minmax Scheduling Under Group Technology and Different Due-Window Assignments
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Resource Allocation and Minmax Scheduling Under Group Technology and Different Due-Window Assignments
2025
Overview
This article investigates single-machine group scheduling integrated with resource allocation under different due-window (DIFDW) assignment. Three distinct scenarios are examined: one with constant processing times, one with a linear resource consumption function, and one with a convex resource consumption function. The objective is to minimize the total cost comprising the maximum earliness/tardiness penalties, the due-window starting time cost, the due-window size cost, and the resource consumption cost. For each problem variant, we analyze the structural properties of optimal solutions and develop corresponding solution algorithms: a polynomial-time optimal algorithm for the case with constant processing times, heuristic algorithms for problems involving linear and convex resource allocation, and the branch-and-bound algorithm for obtaining exact solutions. Numerical experiments are conducted to evaluate the performance of the proposed algorithms.
Publisher
MDPI AG
