Two-Agent Scheduling with Cumulative Deteriorating Jobs on a Single Machine

SYNOPTIC ABSTRACT

In this article we propose a new scheduling model in which two agents share a common machine to process their respective jobs. Each agent has its own objective function to optimize, and the job processing times are subject to cumulative deteriorating. The task is to minimize one agent's total completion time with the restriction that another agent's maximum cost cannot exceed a given upper bound. We analyze some properties on the optimal solution and then propose an optimal polynomial-time solution algorithm followed by a numerical example.

Key Words and Phrases::

• scheduling
• two-agent
• cumulative deteriorating job
• single machine