Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities

This paper considers the single-machine scheduling problem with workload-dependent maintenance activities of variable length. The time needed to perform a maintenance activity is a function of the total processing time of the jobs that are processed between the starting time of this activity and the...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of scheduling Ročník 28; číslo 4; s. 391 - 406
Hlavní autori:	Liu, Peihai, Gu, Manzhan, Lu, Xiwen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2025 Springer Nature B.V
Predmet:	Algorithms Approximation Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Completion time Complexity Decision making Maintenance Operations Research/Decision Theory Optimization Preventive maintenance Scheduling Supply Chain Management Workload Workloads Single-machine scheduling Approximation algorithms Computational complexity Maintenance activities
ISSN:	1094-6136, 1099-1425
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!