Resource title

Approximation algorithms for scheduling a single machine to minimize total late work

Resource image

image for OpenScout resource :: Approximation algorithms for scheduling a single machine to minimize total late work

Resource description

In the problem of scheduling a single machine to minimize total late work, there are 'n' jobs to be processed, each of which has an integer procesing time and in integer due date. The objective is to find a sequence of jobs which minimizes the total late work, where the late work for a job is the amount of processing of this job that is performed after its due date. Three families of approximation algorithms are presented

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://flora.insead.edu/fichiersti_wp/Inseadwp1991/91-18.pdf

Resource license

Copyright INSEAD. All rights reserved