Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times

In this paper, We deal with the scheduling problems with simple linear deterioration function on unrelated parallel-machine and identical parallel-machine. We assume that all the jobs (tasks) are available at time zero, but all machines (processors) may not be available simultaneously at time zero. The objective functions are to minimize the total logarithm of completion time, the total logarithm of machine load, the total absolute differences in logarithm completion times and the total absolute differences in logarithm waiting times respectively. We provide the polynomial-time algorithms to solve the problems under the proposed model respectively.