A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint. Issue 8 (2nd August 2020)

• Record Type: Journal Article
• Authors: Bai, Mengzhuo; Zhao, Yufang
• Is Part Of: Engineering optimization. Volume 52:Issue 8(2020)
• Page Start: 1313
• Page End: 1322
• Publication Date: 2020-08-02
• Subjects: Scheduling -- machine availability -- learning effect -- total completion time; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2019.1650922
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This article studies a single-machine scheduling problem with DeJong's effect and a machine availability constraint taking the total completion time as the objective function. Firstly, a fully polynomial-time approximation scheme (FPTAS) was given for the problem, and afterwards that FPTAS was extended for the single-machine scheduling problem with deteriorating jobs, DeJong's learning effect and a machine availability constraint.