Single machine flow-time scheduling with a single breakdown
Acta Informatica
Scheduling with release dates on a single machine to minimize total weighted completion time
Discrete Applied Mathematics
Single machine flow-time scheduling with scheduled maintenance
Acta Informatica
Capacitated two-parallel machines scheduling to minimize sum of job completion times
Discrete Applied Mathematics
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints
Journal of Scheduling
Scheduling two-stage hybrid flow shop with availability constraints
Computers and Operations Research
Computers and Operations Research
Computers and Industrial Engineering
Hi-index | 0.00 |
In this paper we study the single machine scheduling problem with the aim of minimizing the weighted flow time. The machine is unavailable during a given period. We consider the resumable case. We propose new properties of the worst-case performance of the WSPT heuristic. We give a tighter approximation of the worst-case error, and we show that the worst-case bound is equal to 2 under certain conditions. The results obtained complete the previous analysis of Lee, C-Y., Machine scheduling with an availability constraint. J. Glob. Optim., 1996, 9, 363-384.