Parallel-Machine Scheduling Problems with Past-Sequence-Dependent Delivery Times and Aging Maintenance

الملخص EN

We consider parallel-machine scheduling problems with past-sequence-dependent (psd) delivery times and aging maintenance.

The delivery time is proportional to the waiting time in the system.

Each machine has an aging maintenance activity.

We develop polynomial algorithms to three versions of the problem to minimize the total absolute deviation of job completion times, the total load, and the total completion time.