Please use this identifier to cite or link to this item:
Title: An FPTAS for scheduling with piecewise linear decreasing processing times to minimize makespan
Authors: Ji, Min
Cheng, T. C. Edwin
Subjects: Machine scheduling
Start time-dependent processing times
Approximation algorithms
Issue Date: 30-Apr-2007
Publisher: Elsevier
Source: An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan. Information processing letters, Apr. 2007, v. 102, no. 2-3, p. 41-47.
Abstract: We study the problems of scheduling a set of nonpreemptive jobs on a single machine and identical parallel machines, where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objective is to minimize makespan. We first give a fully polynomial-time approximation scheme (FPTAS) for the case with a single machine. We then generalize the result to the case with m identical machines.
Rights: Information Processing Letters © 2006 Elsevier. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.ipl.2006.11.014
ISSN: 0020-0190
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
V4_06[1].11.21.pdfPre-published version159.81 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.