Before revision:  We consider and analyze  M-SRPT  , a simple modification of the shortest remaining processing time algorithm , which always schedules jobs according to SRPT whenever possible, while processes tasks in an arbitrary order.
After revision:  We consider and analyze M-SRPT ) scheduling algorithm , a simple modification of the shortest remaining processing time algorithm , which always schedules jobs according to SRPT whenever possible, while processes tasks in an arbitrary order.