A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint

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

Full description

Saved in:
Bibliographic Details
Published in:Engineering optimization Vol. 52; no. 8; pp. 1313 - 1322
Main Authors: Bai, Mengzhuo, Zhao, Yufang
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 02.08.2020
Taylor & Francis Ltd
Subjects:
Approximation
Availability
Completion time
Dynamic programming
Job shops
Learning
learning effect
machine availability
Mathematical analysis
Polynomials
Scheduling
total completion time
ISSN:0305-215X, 1029-0273
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2019.1650922