Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology

This article deals with a single-machine resource allocation scheduling problem with deteriorating jobs. Under a group technology environment, the actual processing times of jobs are a convex resource allocation function of their starting time and the amount of resource allocation. The objective is...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Engineering optimization Ročník 52; číslo 7; s. 1184 - 1197
Hlavní autoři: Liang, Xi-Xi, Liu, Mengqi, Feng, Yu-Bo, Wang, Ji-Bo, Wen, Li-Shu
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Taylor & Francis 02.07.2020
Taylor & Francis Ltd
Témata:
Algorithms
deteriorating job
Group technology
Job shops
Polynomials
Resource allocation
Resource scheduling
Scheduling
single machine
ISSN:0305-215X, 1029-0273
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This article deals with a single-machine resource allocation scheduling problem with deteriorating jobs. Under a group technology environment, the actual processing times of jobs are a convex resource allocation function of their starting time and the amount of resource allocation. The objective is to minimize the weighted sum of makespan and resource allocation cost. For two special cases, it is proved that the problem can be solved in polynomial time. For the general case of the problem, heuristic and branch-and-bound procedures are developed to solve the problem. Computational experiments are also performed to examine the effectiveness and the efficiency of the algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2019.1638920