Two-Agent Slack Due-Date Assignment Scheduling with Resource Allocations and Deteriorating Jobs

Abstract

In enterprise management, there are often multiple agents competing for the same products to reduce production cost. On this basis, this paper investigates a two-agent slack due-date single-machine scheduling problem with deteriorating jobs, where the processing time of a job is extended as a function of position-dependent workload, resource allocation and a common deterioration rate. The goal is to find the optimal sequence and resource allocation that minimizes the maximal value of earliness, tardiness, and decision variables of one agent subject to an upper bound on cost value of the second agent. Through theoretical analysis, a polynomial time algorithm with O(N3) time is proposed for the problem, where N is the maximum number of jobs between the two agents.