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 ManagementIn: Mathematics of Operations Research, vol. 19, no. 1, February 1994 Language: EnglishDescription: p. 86-93.Type of document: INSEAD ArticleNote: Please ask us for this itemAbstract: 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. Log in to add tags.
Item type Current location Call number Status Date due Barcode Item holds
INSEAD Article Europe Campus
Available BC003879
Total holds: 0

Ask Qualtrics

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 18.11 - INSEAD Catalogue
Home | Contact Us | What's Koha?