Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs

This article considers a single machine scheduling problem in which the processing time of a job is a linear increasing function of its starting time. The objective is to minimize the weighted number of tardy jobs. A pseudo-polynomial dynamic programming algorithm and a fully polynomial-time approxi...

Full description

Bibliographic Details

Published in:	Engineering optimization Vol. 51; no. 11; pp. 1938 - 1943
Main Authors:	Zhao, Chuanli, Hsu, Chou-Jung
Format:	Journal Article
Language:	English
Published:	Abingdon Taylor & Francis 02.11.2019 Taylor & Francis Ltd
Subjects:	Algorithms Approximation deteriorating jobs Dynamic programming fully polynomial-time approximation scheme Mathematical analysis Polynomials Production scheduling Scheduling single machine
ISSN:	0305-215X, 1029-0273
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!