poj 1180 Batch Scheduling（DP-单调性优化）

最新推荐文章于 2022-02-08 01:30:36 发布

置顶

conquerheaven

最新推荐文章于 2022-02-08 01:30:36 发布

阅读量1k

点赞数

分类专栏： DP-单调性优化文章标签： DP-单调性优化斜率优化

本文链接：https://blog.csdn.net/u011836218/article/details/33352825

版权

Batch Scheduling

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 3145		Accepted: 1442

Description

There is a sequence of N jobs to be processed on one machine. The jobs are numbered from 1 to N, so that the sequence is 1,2,..., N. The sequence of jobs must be partitioned into one or more batches, where each batch consists of consecutive jobs in the sequence. The processing starts at time 0. The batches are handled one by one starting from the first batch as follows. If a batch b contains jobs with smaller numbers than batch c, then batch b is handled before batch c. The jobs in a batch are processed successively on the machine. Immediately after all the jobs in a batch are processed, the machine outputs the results of all the jobs in that batch. The output time of a job j is the time when the batch containing j finishes.

A setup time S is needed to set up the machine for each batch. For each job i, we know its cost factor Fi and the time Ti required to process it. If a batch contains the jobs x, x+1,... , x+k, and starts at time t, then the output time of every job in that batch is t + S + (T