Optimal Different Due-Date Assignment Scheduling with Group Technology and Resource Allocation
Xuyin Wang and
Weiguo Liu ()
Additional contact information
Xuyin Wang: Business School, Northwest Normal University, Lanzhou 730070, China
Weiguo Liu: Business School, Northwest Normal University, Lanzhou 730070, China
Mathematics, 2024, vol. 12, issue 3, 1-17
Abstract:
In this paper, we consider different due-date assignment scheduling with group technology and resource allocation on a single machine, where the due date of each job may be different. Under constant processing times, the objective function is to minimize the scheduling cost (i.e., the weighted sum of earliness, tardiness, and due-date assignment cost, where the weights are position dependent). Under some optimal properties, we prove that this problem can be solved in O ( ζ log ζ ) time, where ζ is the number of jobs. The problem is also extended to cases which include linear and convex functions of the quantity of resource allocation. The objective function is minimizing the sum of the scheduling cost and the resource-consumption cost. For the special case of linear and convex functions, we show that the problem is polynomially solvable in O ( ζ 3 ) time.
Keywords: scheduling; resource allocation; group technology; single machine; position-dependent weights (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/12/3/436/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/3/436/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:3:p:436-:d:1329090
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().