Show simple item record

dc.contributor.authorErel, E.en_US
dc.contributor.authorGhosh, J. B.en_US
dc.date.accessioned2016-02-08T09:52:04Z
dc.date.available2016-02-08T09:52:04Z
dc.date.issued2011en_US
dc.identifier.issn0096-3003
dc.identifier.urihttp://hdl.handle.net/11693/21857
dc.description.abstractWe address a single-machine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their weighted mean. This problem and its precursors aim to achieve the maximum admissible level of service equity. It has been shown earlier that the unweighted version of this problem is NP-hard in the ordinary sense. For that version, a pseudo-polynomial time dynamic program and a 2-approximate algorithm are available. However, not much (except for an important solution property) exists for the weighted version. In this paper, we establish the relationship between the optimal solution to the weighted problem and a related one in which the deviations are measured from the weighted median (rather than the mean) of the job completion times; this generalizes the 2-approximation result mentioned above. We proceed to give a pseudo-polynomial time dynamic program, establishing the ordinary NP-hardness of the problem in general. We then present a fully-polynomial time approximation scheme as well. Finally, we report the findings from a limited computational study on the heuristic solution of the general problem. Our results specialize easily to the unweighted case; they also lead to an approximation of the set of schedules that are efficient with respect to both the weighted mean absolute deviation and the weighted mean completion time. © 2011 Elsevier Inc. All rights reserved.en_US
dc.language.isoEnglishen_US
dc.source.titleApplied Mathematics and Computationen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.amc.2011.04.020en_US
dc.subjectApproximation schemeen_US
dc.subjectDynamic programen_US
dc.subjectSchedulingen_US
dc.subjectApproximation schemeen_US
dc.subjectComputational studiesen_US
dc.subjectDynamic programen_US
dc.subjectHeuristic solutionsen_US
dc.subjectJob completionen_US
dc.subjectLevel of serviceen_US
dc.subjectNP-harden_US
dc.subjectNP-hardnessen_US
dc.subjectOptimal solutionsen_US
dc.subjectSingle-machine schedulingen_US
dc.subjectSolution propertyen_US
dc.subjectTime dynamicen_US
dc.subjectWeighted meanen_US
dc.subjectWeighted medianen_US
dc.subjectPolynomial approximationen_US
dc.titleMinimizing weighted mean absolute deviation of job completion times from their weighted meanen_US
dc.typeArticleen_US
dc.departmentFaculty of Business Administrationen_US
dc.citation.spage9340en_US
dc.citation.epage9350en_US
dc.citation.volumeNumber217en_US
dc.citation.issueNumber22en_US
dc.identifier.doi10.1016/j.amc.2011.04.020en_US
dc.publisherElsevieren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record