This paper considers the semi-resumable model of single machine scheduling with anon-availability period. The machine is not available for processing during a given time interval.A job cannot be completed before the n...This paper considers the semi-resumable model of single machine scheduling with anon-availability period. The machine is not available for processing during a given time interval.A job cannot be completed before the non-availability period will have to partially restartafter the machine has become available again. For the problem with objective of minimizingmakespan, the tight worst-case ratio of algorithm LPT is given, and an FPTAS is also proposed.For the problem with objective of minimizing total weighted completion time, an approximationalgorithm with worst-case ratio smaller than 2 is presented. Two special cases of the latterproblem are also considered, and improved algorithms are given.展开更多
基金Supported by the National Natural Science Foundation of China(10971191, 60021201)Fundamental Research Funds for the Central Universities(2010QNA3040)the China Postdoctoral Science Foundation
文摘This paper considers the semi-resumable model of single machine scheduling with anon-availability period. The machine is not available for processing during a given time interval.A job cannot be completed before the non-availability period will have to partially restartafter the machine has become available again. For the problem with objective of minimizingmakespan, the tight worst-case ratio of algorithm LPT is given, and an FPTAS is also proposed.For the problem with objective of minimizing total weighted completion time, an approximationalgorithm with worst-case ratio smaller than 2 is presented. Two special cases of the latterproblem are also considered, and improved algorithms are given.
