Title of article
Approximation algorithms for problems in scheduling with set-ups Original Research Article
Author/Authors
Srikrishnan Divakaran، نويسنده , , Michael Saks، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
11
From page
719
To page
729
Abstract
In this paper, we present new approximation results for the offline problem of single machine scheduling with sequence-independent set-ups and item availability, where the jobs to be scheduled are independent (i.e., have no precedence constraints) and have a common release time.
Keywords
Analysis of algorithms , Operations research , Approximation algorithms , Batch scheduling , Scheduling with set-ups
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886690
Link To Document