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

Autor:	Zheng-Guo Lv, Li-Han Zhang, Xiao-Yuan Wang, Ji-Bo Wang
Jazyk:	angličtina
Rok vydání:	2024
Předmět:	scheduling single machine proportional job deterioration release dates total weighted completion time Mathematics QA1-939
Zdroj:	Mathematics, Vol 12, Iss 4, p 610 (2024)
Druh dokumentu:	article
ISSN:	2227-7390
DOI:	10.3390/math12040610
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/d6e155b3407f4d1cade437439af7219d Zobrazit plný text záznamu View record in DOAJ Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.