Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization
Mathematics · 2024-02-19 · 12 (4) · 610
DOI: 10.3390/math12040610 ↗At a glance
Journal article in Mathematics, published online on 2024-02-19. Written by Zheng-Guo Lv and 3 co-authors. Cited 34 times so far (Crossref); 43 references. The full text is freely available (open access, CC BY 4.0). Funded by: Research Foundation of the Educational Department of Liaoning Province.
Abstract (original language)
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.
Funding
- Research Foundation of the Educational Department of Liaoning Province
Cite
APA
Lv, Z., Zhang, L., Wang, X., & Wang, J. (2024). Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization. Mathematics, 12(4), 610. https://doi.org/10.3390/math12040610
Vancouver
Lv Z, Zhang L, Wang X, Wang J. Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization. Mathematics. 2024;12(4):610. doi:10.3390/math12040610
BibTeX
@article{Lv2024,
author = {Lv, Zheng-Guo and Zhang, Li-Han and Wang, Xiao-Yuan and Wang, Ji-Bo},
title = {Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization},
journal = {Mathematics},
year = {2024},
volume = {12},
number = {4},
pages = {610},
doi = {10.3390/math12040610}
}
EUVIMED