Abstract: The online scheduling on a single machine with deteriorating jobs and job delivery was considered． Thejobs arrive over time． The jobs were first processed on the single machine，and then the completed jobs were delivered by a vehicle to some customers． The objective was to minimize the maximum delivery completion time of the jobs． For the given problem，a lower bound was given and the best possible online algorithm was established．