Single machine common flow allowance group scheduling with learning effect and resource allocation

We introduce a single-machine group scheduling job-dependent due date assignment problem with learning effects and resource allocation in which each job is assigned an individual due date based on a common flow allowance. The actual processing time of a job depends not only on its scheduled position but also on its resource allocation. A job completed earlier (later) than its due date will incur an earliness (tardiness) penalty. Our goal is to find the optimal sequence for both the groups and jobs, together with the optimal due date assignment and the optimal resource allocation to minimize the total cost that comprises the earliness and tardiness penalties, and common flow allowance and resource allocation. We give polynomial time algorithm to solve these problems.