A maintenance activity scheduling with time-and-position dependent deteriorating effects

We deal with a single-machine scheduling problem with an optional maintenance activity (denoted by $ ma $), where the actual processing time of a job is a function of its starting time and position. The optional $ ma $ means that the machine will perform a $ ma $, after $ ma $ is completed, the mach...

Full description

Saved in:
Bibliographic Details
Published inMathematical biosciences and engineering : MBE Vol. 19; no. 11; pp. 11756 - 11767
Main Authors Liu, Weiguo, Wang, Xuyin, Li, Lu, Zhao, Peizhen
Format Journal Article
LanguageEnglish
Published AIMS Press 01.01.2022
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We deal with a single-machine scheduling problem with an optional maintenance activity (denoted by $ ma $), where the actual processing time of a job is a function of its starting time and position. The optional $ ma $ means that the machine will perform a $ ma $, after $ ma $ is completed, the machine will return to the initial state. The objective is to determine an optimal job sequence and the location of the maintenance activity such that makespan is to be minimized. Based on some properties of an optimal sequence, we introduce a polynomial time algorithm to solve the problem, and the time complexity is $ O({n}^4) $, where $ {n} $ is the number of jobs.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1551-0018
1551-0018
DOI:10.3934/mbe.2022547