Approximation schemes for parallel machine scheduling with availability constraints

We investigate the problems of scheduling n weighted jobs to m parallel machines with availability constraints. We consider two different models of availability constraints: the preventive model, in which the unavailability is due to preventive machine maintenance, and the fixed job model, in which...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 159; no. 15; pp. 1555 - 1565
Main Authors:	Fu, Bin, Huo, Yumei, Zhao, Hairong
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier B.V 06-09-2011 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximations and expansions Availability Classification Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Computer systems performance. Reliability Exact sciences and technology Inapproximability Intervals Mathematical analysis Mathematical models Mathematics Parallel machine PTAS Scheduling Sciences and techniques of general use Software Theoretical computing Total weighted completion time Parallel machine Total weighted completion time PTAS Inapproximability Availability Computer theory Constraint Polynomial approximation Parallel machines Processing time Scheduling Approximation algorithm Computing Optimization Polynomial time Assignment Completion Classification Combinatorics Overlay Single machine
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!