Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance

We consider a scheduling problem on a single machine to minimize the makespan. The processing conditions are subject to cumulative deterioration, but can be restored by a single maintenance. We link the problem to the Subset-sum problem (if the duration of maintenance is constant) and to the Half-Pr...

Full description

Saved in:
Bibliographic Details
Published inJournal of scheduling Vol. 16; no. 6; pp. 675 - 683
Main Authors Kellerer, Hans, Rustogi, Kabir, Strusevich, Vitaly A.
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.12.2013
Springer Nature B.V
Subjects
Additives
Algorithms
Approximation
Artificial Intelligence
Boolean
Business and Management
Calculus of Variations and Optimal Control; Optimization
Job shops
Machinery
Maintenance management
Operations Research/Decision Theory
Optimization
Scheduling
Statistical analysis
Supply Chain Management
Half-Product Problem
Maintenance
Approximation scheme
Deterioration
Subset-sum problem
Single machine
Online AccessGet full text

Cover

More Information
Summary:We consider a scheduling problem on a single machine to minimize the makespan. The processing conditions are subject to cumulative deterioration, but can be restored by a single maintenance. We link the problem to the Subset-sum problem (if the duration of maintenance is constant) and to the Half-Product Problem (if the duration of maintenance depends on its start time). For both versions of the problem, we adapt the existing fully polynomial-time approximation schemes to our problems by handling the additive constants.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-012-0287-8