Research on Group Scheduling with General Logarithmic Deterioration Subject to Maximal Completion Time Cost

Single-machine group scheduling with general logarithmic deterioration is investigated, where the actual job processing (resp. group setup) time is a non-decreasing function of the sum of the logarithmic job processing (resp. group setup) times of the jobs (resp. groups) already processed. Under som...

Full description

Saved in:
Bibliographic Details
Published inAxioms Vol. 14; no. 3; p. 153
Main Authors Miao, Jin-Da, Lv, Dan-Yang, Wei, Cai-Min, Wang, Ji-Bo
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 20.02.2025
Subjects
Algorithms
Completion time
deterioration
group
Group technology
Liu, Timothy
Logarithms
maximal completion time minimization
Polynomials
Scheduling
single-machine
Steel production
China
Online AccessGet full text

Cover

More Information
Summary:Single-machine group scheduling with general logarithmic deterioration is investigated, where the actual job processing (resp. group setup) time is a non-decreasing function of the sum of the logarithmic job processing (resp. group setup) times of the jobs (resp. groups) already processed. Under some optimal properties, it is shown that the maximal completion time (i.e., makespan) cost is solved in polynomial time and the optimal algorithm is presented. In addition, an extension of the general weighted deterioration model is given.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2075-1680
2075-1680
DOI:10.3390/axioms14030153