# A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine

Authors: Peng Liu; Lini Duan
Journal: Discrete Dynamics in Nature and Society
 (2015)

---

## Abstract

We consider a scheduling problem in which both resource dependent release times and two agents exist simultaneously. Two agents share a common single machine, and each agent wants to minimize a cost function dependent on its own jobs.  The release time of eachA-agent’s job is related to the amount of resource consumed. The objective is to find a schedule for the problem of minimizing A-agent’s total amount of resource consumption with a constraint on B-agent’s makespan. The optimal properties and the optimal polynomial time algorithm are proposed to solve the scheduling problem.


---

## Body

## 1. Introduction

Machine scheduling problems with multiagent have received increasing attention in recent years. Different agents share a common processing machine, and each agent wants to minimize a cost function depending on its jobs only. Scheduling with multiple agents is firstly introduced by Baker and Smith [1] and Agnetis et al. [2]. Baker and Smith [1] consider the problem of minimizing a convex combination of the agents’ objective functions. They provide some dominance properties and demonstrate where the problem becomes computationally difficult. Agnetis et al. [2] address the scheduling problem in which two agents compete for the usage of shared processing resource and each agent has his own criterion to optimize. They study the constrained optimization problem and the Pareto-optimization problem on a single machine and the shop environment. Agnetis et al. [3] analyze the complexity of some multiagent scheduling problems on a single machine and propose solution algorithms. Lee et al. [4] provide approximation algorithms for multiagent scheduling to minimize total weighted completion time. Gawiejnowicz et al. [5] consider a single-machine two-agent scheduling problem with proportionally deteriorating job processing times. Yin et al. [6] consider several two-agent scheduling problems with assignable due dates on a single machine. Cheng et al. [7] study a two-agent single-machine scheduling problem with release times to minimize the total weighted completion time. Yu et al. [8] investigate several single-machine two-synergetic-agent scheduling problems. Yin et al. [9] consider two-agent single-machine scheduling problems with unrestricted due date assignment.The scheduling problems with resource consumption have been studied for many years. Cheng and Janiak [10] study the resource-optimal control of job completion on a single machine with a constraint on maximum job completion time. Vasilev and Foote [11] investigate a single machine scheduling problem where the resource consumed depends on the release times of jobs. Kaspi and Shabtay [12] consider the problem of scheduling jobs on a single machine where job-processing times are controllable through the allocation of a common limited resource. Wang and Cheng [13] consider the single machine scheduling problem with resource dependent release times and processing times. Wei et al. [14] consider the single-machine scheduling with time-and-resource-dependent processing times. J.-B. Wang and M.-Z. Wang [15] consider the single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. Yin et al. [16] consider single-machine due window assignment and scheduling problems with a common flow allowance and controllable job processing time. Lu et al. [17] consider a single-machine earliness-tardiness scheduling problem with due-date assignment, in which the processing time of a job is a function of its position in a sequence and its resource allocation.However, to the best of our knowledge, no work has been done on models with both aspects of resource dependent release times and multiagent in the literature. These two categories of scheduling problems have been extensively and separately researched over the last two decades. In this paper, we study the two-agent scheduling problems on a single machine with resource dependent release times, where the goal is to find a schedule that minimizes the objective function of one agent with the restriction that the objective function of the other agent cannot exceed a given bound. The problems under consideration fall into the category of scheduling problems with resource consumption and multiple agents. Such a scheduling problem commonly arises in the steel industry. Janiak [18] describes a practical scheduling problem with resource dependent release times in steel mills, where batches of ingots have to be preheated before they can be hot rolled in a blooming mill, and the ingot preheating time is inversely proportional to the total amount of resources consumed.The remainder of this paper is organized as follows. In Section2, we describe the proposed problem. In Section 3, we develop the optimal polynomial time algorithm for the two-agent single-machine scheduling problem. Section 4 gives some concluding remarks.


## 2. Problem Description

We now describe our problem formally. There are two families of independent and nonpreemptive jobsJ
A
=
{
J
1
A
,
J
2
A
,
…
,
J
n
A
A
} and J
B
=
{
J
1
B
,
J
2
B
,
…
,
J
n
B
B
} to be processed on a common single machine. The jobs in J
A and J
B are called A-agent’s jobs and B-agent’s jobs, respectively. Associated with each job J
h
A, let p
h
A denote the processing time and h
=
1,2
,
…
,
n
A. The release time r
h
A is related to the amount of the resource f
h
A, consumed on job J
h
A. A strictly decreasing continuous function is given f
:
R
+
→
R
+. We refer to f as the resource consumption function. We assume that f
h
A
=
f
(
r
h
A
). Each A-agent’s job can start at any time after the release time of the job, and idle time between jobs is allowed. Since the consumption function f is strictly decreasing continuously, we may assume that each job starts as soon as it becomes available. That is, we can take s
h
A
=
r
h
A, where s
h
A is the starting time of job J
h
A. Associated with each job J
k
B, let p
k
B and r
k
B denote the processing time and the release times, respectively, and k
=
1,2
,
…
,
n
B. Let π indicate a feasible schedule of the n
=
n
A
+
n
B jobs. Let C
k
B
(
π
) denote the completion time of B-agent’s job J
k
B under schedule π. The objective function of agent A is to minimize the total amount of resource consumption ∑
h
=
1
n
A
f
(
r
h
A
). The objective function of agent B is to minimize the makespan C
max
⁡
B
=
max
⁡
k
=
1,2
,
…
,
n
B
{
C
k
B
π
}.The goal is to minimize the total amount of resource consumption∑
h
=
1
n
A
f
(
r
h
A
) of agent A with the restriction that the makespan C
max
⁡
B of agent B cannot exceed a given bound U. If the value U is too small, an instance of the scheduling problem may not have feasible solutions. If there is at least one feasible solution, we say that the instance isfeasible. According to the three-field notation ψ
1
∣
ψ
2
∣
ψ
3 of Graham et al. [19], the scheduling problem is denoted as 1
∥
∑
h
=
1
n
A
f
(
r
h
A
)
:
C
max
⁡
B
≤
U.


## 3. Main Results

In this section, we develop an optimal polynomial time algorithm to solve the problem1
∥
∑
h
=
1
n
A
f
(
r
h
A
)
:
C
max
⁡
B
≤
U.Given a sequenceπ
=
{
J
1
B
,
J
2
B
,
…
,
J
n
B
B
,
J
1
A
,
J
2
A
,
…
,
J
n
A
A
}, for each B-agent’ job, the completion time C
k
B may be completed recursively as C
1
B
=
r
1
B
+
p
1
B, C
k
B
=
max
⁡
⁡
{
r
k
B
,
C
k
-
1
B
}
+
p
k
B, k
=
2
,
…
,
n
B.Thus the completion time of jobJ
k
B may also be taken as C
k
B
=
max
⁡
1
≤
j
≤
k
{
r
j
B
+
∑
l
=
j
k
p
l
B
}.Moreover, let the maximum job completion time be denoted byC
max
⁡
B
=
max
⁡
1
≤
k
≤
n
B
{
C
k
B
}; then C
max
⁡
B
=
max
⁡
1
≤
k
≤
n
B
{
r
k
B
+
∑
i
=
k
n
B
p
i
B
}.Lemma 1.
Given a sequenceπ
=
{
J
1
B
,
J
2
B
,
…
,
J
n
B
B
,
J
1
A
,
J
2
A
,
…
,
J
n
A
A
} and a constant U, define C
π
B
=
max
⁡
1
≤
k
≤
n
B
{
r
k
B
+
∑
i
=
k
n
B
p
i
B
}. Then, if U
<
C
π
B, the sequence π corresponds to an infeasible schedule.Now we can define bounds for the constraintU. Define U
_
=
max
⁡
1
≤
k
≤
n
B
{
r
k
B
+
∑
i
=
k
n
B
p
i
B
}. The analysis in the following section will be confined to the case in which U
_
≤
U.Lemma 2.
An optimal schedule exists in which theA-agent’s jobs are processed in the nonincreasing order of processing times p
h
A.Proof.
The resource consumption functionf is a strictly decreasing continuous function to A-agent’s jobs. Since releasing A-agent’s jobs sooner consumes more resource, A-agent’s jobs should be released as late as possible. Hence A-agent’s jobs should be released in nonincreasing order of p
h
A.Lemma 3.
An optimal schedule exists in which theB-agent’s jobs are processed in the nondecreasing order of release times r
k
B.Proof.
The makespan of agentB is the maximum completion time of B-agent’s jobs on the single machine; that is, the makespan of agent B is the completion time of the last B-agent’s job. Using a pairwise job interchange argument, we can process B-agent’s jobs in the nondecreasing order of release times r
k
B.Next, an algorithm to determine an optimal schedule of the problem1
∥
∑
h
=
1
n
A
f
(
r
h
A
)
:
C
max
⁡
B
≤
U is developed as follows.Algorithm 4.
Step 1. Arrange the A-agent’s jobs as {
J
1
A
,
J
2
A
,
…
,
J
n
A
A
} according to the nonincreasing order of p
h
A and denote all B-agent’s jobs sequenced by the nondecreasing order of r
k
B as a dummy job B
1.
Step 2. Define sequence S
=
{
B
1
,
J
1
A
,
J
2
A
,
…
,
J
n
A
-
1
A
,
J
n
A
A
} and calculate C
max
⁡
B for agent B. The sequence S is an optimal schedule and the starting times of A-agent’s job are given by s
1
A
=
U, s
h
A
=
s
h
-
1
A
+
p
h
-
1
A
=
s
1
A
+
∑
i
=
1
h
-
1
p
i
A, h
=
2,3
,
…
,
n
A.Theorem 5.
Algorithm4 generates an optimal schedule for the problem 1
∥
∑
h
=
1
n
A
f
(
r
h
A
)
:
C
max
⁡
B
≤
U in O
n
A
log
⁡
⁡
n
A
+
n
B
log
⁡
⁡
n
B time.Proof.
The proof of optimality is straightforward from the results of Lemmas1–3. We now turn to time complexity. The time to sequence the jobs of set J
A according to the nonincreasing order of p
h
A is O
n
A
log
⁡
⁡
n
A. The time to sequence the jobs of set J
B according to the nondecreasing order of r
k
B is O
n
B
log
⁡
⁡
n
B. Creating dummy job B
1 incurs O
n
B operations. So the overall computational complexity of Algorithm 4 is bounded by O
(
n
A
log
⁡
⁡
n
A
+
n
B
log
⁡
⁡
n
B
). This completes the proof.


## 4. Conclusions

In this paper, we combine two important issues in scheduling that recently have received increasing attention from researchers: resource dependent release times and multiple agents. Our goal is to find a schedule for the problem of minimizingA-agent’s total amount of resource consumption with a constraint on B-agent’s makespan. We propose the optimal properties and the optimal polynomial time algorithm for the considered scheduling problem.The future research may be directed to analyze the problems with other objective functions such as minimizing the number of late jobs, the total weighted completion time and tardiness. An interesting research topic is also to analyze the scheduling problem with more than two agents or in other machine environments.



---

*Source: 503297-2015-04-12.xml*