Optimal Different Due-Date Assignment Scheduling with Group Technology and Resource Allocation

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 o...

Full description

Saved in:
Bibliographic Details
Published inMathematics (Basel) Vol. 12; no. 3; p. 436
Main Authors Wang, Xuyin, Liu, Weiguo
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.02.2024
Subjects
Algorithms
Group technology
Heuristic
position-dependent weights
Resource allocation
Scheduling
single machine
Workloads
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2227-7390
2227-7390
DOI:10.3390/math12030436