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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 28; no. 4; pp. 391 - 406
Main Authors:	Liu, Peihai, Gu, Manzhan, Lu, Xiwen
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2025 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!