An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

Authors:
Min Ji;T. C. E. Cheng
Affiliations:
College of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou 310035, P.R. China;Department of Logistics, The Hong Kong Polytechnic University, Kowloon, Hong Kong
Venue:
Information Processing Letters
Year:
2008

Citing 5
Cited 3

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

Journal of Heuristics
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem

Operations Research
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan

Information Processing Letters
Online scheduling on parallel machines with two gos levels

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Online and semi-online scheduling of two machines under a grade of service provision

Operations Research Letters

A comment on parallel-machine scheduling under a grade of service provision to minimize makespan

Information Processing Letters
Single-machine scheduling with a nonlinear deterioration function

Information Processing Letters
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the m parallel-machine scheduling problem that process service requests from various customers who are entitled to different levels of grade of service (GoS). The objective is to minimize the makespan. We give a fully polynomial-time approximation scheme for the case where m is fixed.