Work

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

Year: 2025

Type: article

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

Source: Axioms

DOI: 10.3390/axioms14030153

Authors: Jin-Da Miao, Dan-Yang Lv, Cai-Min Wei, Ji-Bo Wang

Institutions: Shenyang Aerospace University, Shantou University

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $2,896

OpenAlex ID: W4407766395

FWCI: 5.188

Cites: 63

Cited by: 10

Related to: 10