Single machine group scheduling with position dependent processing times and ready times (Q1664992)

Summary: We investigate a single machine group scheduling problem with position dependent processing times and ready times. The actual processing time of a job is a function of positive group-dependent job-independent positional factors. The actual setup time of the group is a linear function of the total completion time of the former group. Each job has a release time. The decision should be taken regarding possible sequences of jobs in each group and group sequence to minimize the makespan. We show that jobs in each group are scheduled in nondecreasing order of its release time and the groups are arranged in nondecreasing order of some certain conditions. We also present a polynomial time solution procedure for the special case of the proposed problem.