Normal view
MARC view
A Fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work
Author: Van Wassenhove, Luk N. ; Potts, Christopher N. ; Kovalyov, M. H.INSEAD Area: Technology and Operations Management Series: Working Paper ; 91/41/TM Publisher: Fontainebleau : INSEAD, 1991.Language: EnglishDescription: 12 p.Type of document: INSEAD Working Paper Online Access: Click here Abstract: This paper studies approximation algorithms for the problem of non-preemptively scheduling 'n' jobs on a single machine to minimize total weighted late work, where the late work for a job is the amount of processing of this job that is performed after its due date. A family of approximation algorithms is derived| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
|
Digital Library | Available | BC000902 |
Total holds: 0
This paper studies approximation algorithms for the problem of non-preemptively scheduling 'n' jobs on a single machine to minimize total weighted late work, where the late work for a job is the amount of processing of this job that is performed after its due date. A family of approximation algorithms is derived
Digitized
There are no comments for this item.