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
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Collection Call number Status Date due
INSEAD Working Paper Digital Library
PDF Available

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.

Log in to your account to post a comment.
Koha 3.18 - INSEAD Library Catalogue
Library Home | Contact Us | What's Koha?