1467 - Installations
Time limit: 3.000 seconds
In the morning, service engineers in a telecom company receive a list of jobs which they must serve today. They install telephones, internet, ipTVs, etc and repair troubles with established facilities. A client requires a deadline when the requested job must be completed. But the engineers may not complete some jobs within their deadlines because of job overload. For each job, we consider, as a penalty of the engineer, the difference between the deadline and the completion time. It measures how long the job proceedsafter its deadline. The problem is to find a schedule minimizing the sum of the penalties of the jobs with the two largest penalties.
A service engineer gets a list of jobs Ji with a serving timesi and a deadlinedi. A job Ji needs timesi, and if it is completed at timeCi, then the penalty of Ji is defined to bemax{0, Ci -di}. For convenience, we assume that the timet when a job can be served is0t < and