Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization

In this paper, we investigate a single machine scheduling problem with a proportional job deterioration. Under release times (dates) of jobs, the objective is to minimize the total weighted completion time. For the general condition, some dominance properties, a lower bound and an upper bound are gi...

Full description

Saved in:
Bibliographic Details
Published inMathematics (Basel) Vol. 12; no. 4; p. 610
Main Authors Lv, Zheng-Guo, Zhang, Li-Han, Wang, Xiao-Yuan, Wang, Ji-Bo
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.02.2024
Subjects
Algorithms
Completion time
Dynamic programming
Group technology
Heuristic
Heuristic methods
Lower bounds
proportional job deterioration
release dates
Schedules
Scheduling
Simulated annealing
single machine
Tabu search
total weighted completion time
Upper bounds
Online AccessGet full text

Cover

More Information
Summary:In this paper, we investigate a single machine scheduling problem with a proportional job deterioration. Under release times (dates) of jobs, the objective is to minimize the total weighted completion time. For the general condition, some dominance properties, a lower bound and an upper bound are given, then a branch-and-bound algorithm is proposed. In addition, some meta-heuristic algorithms (including the tabu search (TS), simulated annealing (SA) and heuristic (NEH) algorithms) are proposed. Finally, experimental results are provided to compare the branch-and-bound algorithm and another three algorithms, which indicate that the branch-and-bound algorithm can solve instances of 40 jobs within a reasonable time and that the NEH and SA are more accurate than the TS.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math12040610