Single-Machine Group Scheduling Model with Position-Dependent and Job-Dependent DeJong’s Learning Effect

Abstract

This paper considers the single-group scheduling models with Pegels’ and DeJong’s learning effect and the single-group scheduling models with Pegels’ and DeJong’s aging effect. In a classical scheduling model, Pegels’ and DeJong’s learning effect is a constant or position-dependent, while the learning effect and aging effect are job-dependent in this paper. Compared with the classical learning model and aging model for scheduling, the proposed models are more general and realistic. The objective functions are to minimize the total completion time and makespan. We propose polynomial time methods to solve all the studied problems.

1. Introduction

In the traditional scheduling field, the processing time of a job is a constant, while in some actual situations, the processing times become shorter. A different approach to decreasing processing times is due to the concept of learning. A steady decline in processing times usually takes place by performing the same task repeatedly. This is called the learning effect. For instance, if a worker repeatedly processes the same jobs, due to the improvement of production technology and the accumulation of experience, the processing times become less. In some cases, the processing times of jobs may also become longer. As the machine ages, the processing times become longer. This is called the aging effect.

Compared with the classical learning model and aging model for scheduling, the proposed models are more general and realistic. In some classical scheduling model, Pegels’ and DeJong’s learning effect is a constant or position-dependent, while the learning effect and aging effect are job-dependent in this paper. This paper considers the single-group scheduling models with Pegels’ and DeJong’s learning effect and the single-group scheduling models with Pegels’ and DeJong’s aging effect. The objective functions are to minimize the total completion time and makespan. We propose polynomial time methods to solve all the studied problems.

2. Literature Review

The learning effect model was first proposed by Biskup [1]. Subsequently, many researchers have done a lot of work on the learning effect and aging effect. Mosheiov [2] explained the aging effect and deteriorating jobs. The SPT rule was no longer applicable to the optimal solution for the aging effect model. Yang [3] studied a single-machine scheduling problem with maintenance times and maintenance activities. This was an aging effect model that considered the linear deterioration and exponential deterioration of processing time. Zhang and Yan [4] considered a single-machine scheduling problem with setup time whose learning effect was based on group and position. The objective functions were to minimize the total completion time and makespan. They gave polynomial time algorithms. Li et al. [5] considered a single-machine scheduling problem with linear resource or convex resource allocation. The learning effect of the processing time was based on position. They dealt with the problem of the slack due window by an assignment method. Lu et al. [6] considered a single-machine scheduling problem with setup time and convex resource allocation whose learning effect was based on the group position and the position within the group. The optimal sequence was for the jobs in each group to be sorted according to the SPT rule. Mustu and Eren [7] considered a single-machine learning scheduling problem with setup time which was based on position. The objective function was to minimize the total tardiness and it was an NP-hard problem. They proposed some heuristic algorithms to deal with the NP-hard problem. A single-machine group scheduling problem with setup time about linear resource and convex resource allocation was considered by Yin et al. [8], Zhang et al. [9], Zhao et al. [10] and Li et al. [11].

This paper studies the Pegels’ and DeJong’s learning effect scheduling model and Pegels’ and DeJong’s aging effect scheduling model. De Jong [12] proposed a learning scheduling model. Wang et al. [13] considered a single-machine scheduling problem with setup time which was a linear function of the previous actual processing time. A learning effect that was similar to DeJong’s learning effect was based on the sum of previous processing times. When the objective functions were to minimize the total completion time and makespan, they proved that the optimal schedule was sorted according to the SPT rule. Okołowski and Gawiejnowicz [14] studied a parallel-machine scheduling problem whose learning effect was DeJong’s learning effect. The objective function was to minimize the makespan. Since $Pm\left|\right|C_{max}$ is a NP-hard problem, this problem was also a NP-hard problem. They proposed two branch-and-bound algorithms to solve this problem. Ji et al. [15] considered the machine scheduling problem with DeJong’s learning effect. For the single-machine scheduling problem, the objective functions were to minimize the total completion time and makespan. They proved that the optimal schedule was sorted according to the SPT rule. Ji et al. [16] studied a parallel-machine deteriorating scheduling problem with DeJong’s learning effect. The objective functions were to minimize the total completion time and makespan. When the objective functions were to minimize the total completion time, the jobs were sorted according to the SPT rule on each machine. Zhang et al. [17] considered both Pegels’ and DeJong’s learning effect scheduling model and Pegels’ and DeJong’s aging effect scheduling model. The objective functions were to minimize the total completion time and makespan. The optimal solution was that the jobs were sorted according to the SPT rule in each group. The group order was related to the objective functions. Sun et al. [18] considered a single-machine scheduling problem. A learning effect similar to DeJong’s learning effect was based on the sum of previous processing times and positions. The objective functions were to minimize the total completion time and makespan. They proved that the jobs in each group were sorted according to the SPT rule. Under different objective functions, they also gave a conclusion on the group order.

To increase efficiency, similarly designed or processed products are processed in groups. This phenomenon is known as group technology in the literature. Ji et al. considered a single-machine group scheduling and job-dependent due-window assignment problem [19]. Sun et al. considered a single-machine group scheduling with learning effect and resource allocation [20]. There have also been many scholars who have done a lot of work on group technology [21,22,23,24,25].

The problem is described in the Section 3. The proof of the polynomial time algorithm for four problems are given in the Section 4. A summary is given in the Section 5.

3. Notation and Problem Statement

Some notations that are used in this paper are introduced.

Symbol	Meaning
l	the number of jobs
t	the number of groups
$jo{b}_{uv}$	the initial job at the uth position in the vth group
$jo{b}_{\left[u\right]\left[v\right]}$	the job at the uth position in the vth group
$jo{b}_{\left[v\right]}$	the job in the vth group
$l_v$	the number of $jo{b}_{\left[v\right]}$
$t_v$	the setup time of group v
$t_{\left[v\right]}$	the setup time of $jo{b}_{\left[v\right]}$
$p_{uv}$	the normal processing time of $jo{b}_{uv}$
$p_{\left[u\right]\left[v\right]}$	the normal processing time of $jo{b}_{\left[u\right]\left[v\right]}$
$p_{\left[u\right]\left[v\right]}^a$	the actual processing time of $jo{b}_{\left[u\right]\left[v\right]}$
$C_{\left[u\right]\left[v\right]}$	the completion time of $jo{b}_{\left[u\right]\left[v\right]}$
$C_{max}$	the makespan
${\alpha }_{uv}$	the DeJong’s aging or learning effect of $jo{b}_{uv}$
${\alpha }_{\left[u\right]\left[v\right]}$	the DeJong’s aging or learning effect of $jo{b}_{\left[u\right]\left[v\right]}$
${\beta }_{uv}$	the Pegels’ aging or learning effect of $jo{b}_{uv}$
${\beta }_{\left[u\right]\left[v\right]}$	the Pegels’ aging or learning effect of $jo{b}_{\left[u\right]\left[v\right]}$

Suppose there are l independent jobs $J=\{J_1,\dots ,J_l\}$ processed on a machine. The l jobs are divided into t groups $G=\{G_1,\dots ,G_t\}$, $1\le t\le l$. There is a sequence-dependent setup time before each group is processed. The jobs are processed continuously in each group. The machine can only process one job at a time. The actual processing time is

$$p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K)s^{{\alpha }_{\left[u\right]\left[v\right]}}],u=1,\dots ,l_v;v=1,\dots ,t;$$

(1)

$$p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{s-1}],u=1,\dots ,l_v;v=1,\dots ,t,$$

(2)

where K is a constant, $K\ge 0$, ${\alpha }_{\left[u\right]\left[v\right]}<0$ and $0<{\beta }_{\left[u\right]\left[v\right]}<1$. When $K=0$, $p_{\left[u\right]\left[v\right]}^a$ is inversely proportional to position s. When $0<K<1$, the actual processing time of each job is less than the normal processing time of each job. They are the learning scheduling models. When $K=1$, the actual processing time is equal to the normal processing time. When $K>1$, the actual processing time of each job is more than the normal processing time of each job. They are the aging scheduling models.

Our objectives are to minimize the total completion time and the makespan. By the three-region notation, DeJong’s and Pegels’ models can be defined as

$$1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K)s^{{\alpha }_{\left[u\right]\left[v\right]}}],GT,t_v|C_{max},$$

$$1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{s-1}],GT,t_v|C_{max},$$

$$1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K)s^{{\alpha }_{\left[u\right]\left[v\right]}}],GT,t_v|\sum _{v=1}^t\sum _{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]},$$

$$1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{s-1}],GT,t_v|\sum _{v=1}^t\sum _{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}.$$

4. Research Method

The parameters of the traditional Pegels’ and DeJong’s learning effect are constants which are job-independent. This paper considers Pegels’ and DeJong’s models whose parameters are job-dependent. When $0<K<1$, they are the learning scheduling models. When $K>1$, they are the aging scheduling models.

4.1. Makespan Minimization

Theorem 1.

For the $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K)s^{{\alpha }_{\left[u\right]\left[v\right]}}],GT,t_v|C_{max}$ problem, the optimal solution is that the job sequence within the group is solved by the assignment method and the order of the groups is arbitrary.

Proof. 

Suppose there are $l_v$ jobs in the vth group, $l_1+\cdots +l_t=l$, $1\le v\le t$. The completion time of each group is

$$C_{\left[l_1\right]\left[1\right]}=t_{\left[1\right]}+\sum _{u=1}^{l_1}{p}_{\left[u\right]\left[1\right]}[K+(1-K)u^{{\alpha }_{\left[u\right]\left[1\right]}}],$$

(3)

$$C_{\left[l_{v+1}\right][v+1]}=C_{\left[l_v\right]\left[v\right]}+t_{[v+1]}+\sum _{u=1}^{l_{v+1}}{p}_{\left[u\right][v+1]}[K+(1-K)u^{{\alpha }_{\left[u\right][v+1]}}],$$

(4)

$$C_{max}=C_{\left[l_t\right]\left[t\right]}=\sum _{v=1}^t{t}_{\left[v\right]}+\sum _{v=1}^t\sum _{u=1}^{l_v}{p}_{\left[u\right]\left[v\right]}[K+(1-K)u^{{\alpha }_{\left[u\right]\left[v\right]}}].$$

(5)

It can be seen from $C_{max}$ that the order of the groups is arbitrary, and the job sequence within the group can be solved by the assignment method. So, the problem of sequencing jobs in each group could be solved in polynomial time.

$$\begin{array}{cc}\hfill & min\sum _{u=1}^{l_{\left[v\right]}}\sum _{h=1}^{l_{\left[v\right]}}{p}_{\left[u\right]\left[v\right]}[K+(1-K)h^{{\alpha }_{\left[u\right]\left[v\right]}}]e_{u\left[v\right]h},\hfill \\ \hfill & \begin{array}{ccc}\hfill s.t.& \sum _{h=1}^{l_{\left[v\right]}}{e}_{u\left[v\right]h}=1,\hfill & v=1,\dots ,t;u=1,\dots ,l_{\left[v\right]},\hfill \\ \hfill & \sum _{u=1}^{l_{\left[v\right]}}{e}_{u\left[v\right]h}=1,\hfill & v=1,\dots ,t;h=1,\dots ,l_{\left[v\right]},\hfill \\ \hfill & e_{u\left[v\right]h}=0,or1,\hfill & v=1,\dots ,t;u,h=1,\dots ,l_{\left[v\right]}.\hfill \end{array}\hfill \end{array}$$

(6)

   □

The algorithm is summarized as follows:

It is easy to show that the total time for Algorithm 1 is $O\left(n^3\right)$.

Algorithm 1  $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K)s^{{\alpha }_{\left[u\right]\left[v\right]}}],GT,t_v|C_{max}$

Require:  t, K, $l_v$, $t_v$, $p_{uv}$, ${\alpha }_{uv}$ Ensure:  The job sequence within the group and $C_{max}$   1: First step: Using the assignment method, the job sequence within the group is solved.   2: Second step: The order of the groups is arbitrary.   3: Last step: Calculate $C_{max}$.

Example 1.

If there are five jobs in total, they are divided into two groups. $l=5$, $t=2$, $G_1=\{jo{b}_{11},jo{b}_{21},jo{b}_{31}\}$, $G_2=\{jo{b}_{12},jo{b}_{22}\}$, $K=0.5$, $t_1=2$, $t_2=3$, $p_{11}=7$, $p_{21}=5$, $p_{31}=3$, $p_{12}=4$, $p_{22}=2$, ${\alpha }_{11}=-0.5$, ${\alpha }_{21}=-0.1$, ${\alpha }_{31}=-0.6$, ${\alpha }_{12}=-0.2$, ${\alpha }_{22}=-0.8$.

Solution:

The processing time of the jobs in $G_1$ and $G_2$ at different positions are shown in

Table 1. Processing time of the group $G_1$ jobs in different positions.

	Position	1	2	3
Job
1		7	$7(0.5+0.5\times 2^{-0.5})$	$7(0.5+0.5\times 3^{-0.5})$
2		5	$5(0.5+0.5\times 2^{-0.1})$	$5(0.5+0.5\times 2^{-0.1})$
3		3	$3(0.5+0.5\times 2^{-0.6})$	$3(0.5+0.5\times 2^{-0.6})$

and

Table 2. Processing time of the group $G_2$ jobs in different positions.

	Position	1	2
Job
1		4	$4(0.5+0.5\times 2^{-0.2})$
2		2	$2(0.5+0.5\times 2^{-0.8})$

, respectively.

By the assignment method, the order of the jobs is $jo{b}_{31}\to jo{b}_{21}\to jo{b}_{11}$ in $G_1$.

By the assignment method, the order of the jobs is $jo{b}_{12}\to jo{b}_{22}$ in $G_2$.

$$\begin{array}{cc}\hfill C_{max}& =\sum _{v=1}^2{t}_{\left[v\right]}+\sum _{v=1}^2\sum _{u=1}^{l_v}{p}_{\left[u\right]\left[v\right]}[0.5+0.5\times u^{{\alpha }_{\left[u\right]\left[v\right]}}]\hfill \\ \hfill & =2+3+5(0.5+0.5\times 2^{-0.1})+7(0.5+0.5\times 3^{-0.5})+3+4+2(0.5+0.5\times 2^{-0.8})\hfill \\ \hfill & =23.924.\hfill \end{array}$$

(7)

Theorem 2.

For the $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{s-1}],GT,t_v|C_{max}$ problem, the optimal solution is that the job sequence within the group is solved by the assignment method and the order of the groups is arbitrary.

Proof. 

The completion time of each group is

$$C_{\left[l_1\right]\left[1\right]}=t_{\left[1\right]}+\sum _{u=1}^{l_1}{p}_{\left[u\right]\left[1\right]}[K+(1-K){\beta }_{\left[u\right]\left[1\right]}^{u-1}],$$

(8)

$$C_{\left[l_{v+1}\right][v+1]}=C_{\left[l_v\right]\left[v\right]}+t_{[v+1]}+\sum _{u=1}^{l_{v+1}}{p}_{\left[u\right][v+1]}[K+(1-K){\beta }_{\left[u\right][v+1]}^{u-1}],$$

(9)

$$C_{max}=C_{\left[l_t\right]\left[t\right]}=\sum _{v=1}^t{t}_{\left[v\right]}+\sum _{v=1}^t\sum _{u=1}^{l_v}{p}_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{u-1}].$$

(10)

It can be seen from $C_{max}$ that the order of the groups is arbitrary, and the job sequence within the group can be solved by the assignment method. So, the problem of sequencing jobs in each group could be solved in polynomial time.

$$\begin{array}{cc}\hfill & min\sum _{u=1}^{l_{\left[v\right]}}\sum _{h=1}^{l_{\left[v\right]}}{p}_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{h-1}]e_{u\left[v\right]h},\hfill \\ \hfill & \begin{array}{ccc}\hfill s.t.& \sum _{h=1}^{l_{\left[v\right]}}{e}_{u\left[v\right]h}=1,\hfill & v=1,\dots ,t;u=1,\dots ,l_{\left[v\right]},\hfill \\ \hfill & \sum _{u=1}^{l_{\left[v\right]}}{e}_{u\left[v\right]h}=1,\hfill & v=1,\dots ,t;h=1,\dots ,l_{\left[v\right]},\hfill \\ \hfill & e_{u\left[v\right]h}=0,or1,\hfill & v=1,\dots ,t;u,h=1,\dots ,l_{\left[v\right]}.\hfill \end{array}\hfill \end{array}$$

(11)

   □

The algorithm is summarized as follows:

It is easy to show that the total time for Algorithm 2 is $O\left(n^3\right)$.

Algorithm 2  $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{s-1}],GT,t_v|C_{max}$

Require:  t, K, $l_v$, $t_v$, $p_{uv}$, ${\beta }_{uv}$ Ensure:  The job sequence within the group and $C_{max}$   1: First step: Using the assignment method, the job sequence within the group is solved.   2: Second step: The order of the groups is arbitrary.   3: Last step: Calculate $C_{max}$.

4.2. Total Completion Time Minimization

Theorem 3.

For the $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K)s^{{\alpha }_{\left[u\right]\left[v\right]}}],GT,t_v|{\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$ problem, the optimal solution is that the job sequence within the group can be solved by the assignment method and the groups are arranged in nondecreasing order of $\frac{t_b+{\displaystyle \sum _{u=1}^{l_b}}{p}_{\left[u\right]b}[K+(1-K)u^{{\alpha }_{\left[u\right]b}}]}{l_b}$.

Proof. 

Suppose there are $l_v$ jobs in the vth group, $l_1+\dots +l_t=l$, $1\le v\le t$. The completion time of each job is

$$C_{\left[u\right]\left[1\right]}=t_{\left[1\right]}+\sum _{k=1}^u{p}_{\left[k\right]\left[1\right]}[K+(1-K)k^{u_{\left[k\right]\left[1\right]}}],1\le u\le l_1,$$

(12)

$$C_{\left[u\right][v+1]}=C_{\left[l_v\right]\left[v\right]}+t_{[v+1]}+\sum _{k=1}^u{p}_{\left[k\right][v+1]}[K+(1-K)k^{{\alpha }_{\left[k\right][v+1]}}],1\le u\le l_{v+1}.$$

(13)

Therefore, the total completion time is

$$\sum _{v=1}^t\sum _{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}=\sum _{v=1}^t{l}_v{t}_v+\sum _{v=2}^t{l}_v{C}_{\left[l_{v-1}\right][v-1]}+\sum _{v=1}^t\sum _{u=1}^{l_v}(l_v-u+1)p_{\left[u\right]\left[v\right]}[K+(1-K)u^{{\alpha }_{\left[u\right]\left[v\right]}}].$$

(14)

The first term is a constant in the above formula. The second term is

$$\sum _{v=2}^t{l}_v{C}_{\left[l_{v-1}\right][v-1]}=\sum _{v=2}^t{l}_v\sum _{k=1}^{v-1}\{t_{\left[k\right]}+\sum _{u=1}^{l_k}{p}_{\left[u\right]\left[k\right]}[K+(1-K)u^{{\alpha }_{\left[u\right]\left[k\right]}}]\}.$$

(15)

We prove that the second term obtains the optimal solution by the adjacent exchange method. Let $S_1=({\theta }_1,G_b,G_c,{\theta }_2)$ and $S_2=({\theta }_1,G_c,G_b,{\theta }_2)$ be two job sequences with the same sequence except $G_b$ and $G_c$. $G_b$ is at the $\gamma$th position in the $S_1$ sequence, and $G_c$ is at the $(\gamma +1)$th position in the $S_1$ sequence. There are $l_b$ jobs in group $G_b$, and there are $l_c$ jobs in group $G_c$.

$$\begin{array}{cc}\hfill & \sum _{v=2}^t{l}_v{C}_{\left[l_{v-1}\right][v-1]}\left(S_1\right)-\sum _{v=2}^t{l}_v{C}_{\left[l_{v-1}\right][v-1]}\left(S_2\right)\hfill \\ \hfill =& l_b\sum _{v=1}^{\gamma -1}\{t_{\left[v\right]}+\sum _{u=1}^{l_v}{p}_{\left[u\right]\left[v\right]}[K+(1-K)u^{{\alpha }_{\left[u\right]\left[v\right]}}]\}+l_c\sum _{v=1}^{\gamma }\{t_{\left[v\right]}+\sum _{u=1}^{l_v}{p}_{\left[u\right]\left[v\right]}[K+(1-K)u^{{\alpha }_{\left[u\right]\left[v\right]}}]\}\hfill \\ \hfill & -l_c\sum _{v=1}^{\gamma -1}\{t_{\left[v\right]}+\sum _{u=1}^{l_v}{p}_{\left[u\right]\left[v\right]}[K+(1-K)u^{{\alpha }_{\left[u\right]\left[v\right]}}]\}-l_b\sum _{v=1}^{\gamma }\{t_{\left[v\right]}+\sum _{u=1}^{l_v}{p}_{\left[u\right]\left[v\right]}[K+(1-K)u^{{\alpha }_{\left[u\right]\left[v\right]}}]\}\hfill \\ \hfill =& l_c\{t_b+\sum _{u=1}^{l_b}{p}_{\left[u\right]b}[K+(1-K)u^{{\alpha }_{\left[u\right]b}}]\}-l_b\{t_c+\sum _{u=1}^{l_c}{p}_{\left[u\right]c}[K+(1-K)u^{{\alpha }_{\left[u\right]c}}]\}.\hfill \end{array}$$

(16)

If $S_1$ is better than $S_2$, the above formula is less than 0. Then,

$$\begin{array}{c}\hfill l_c\{t_b+\sum _{u=1}^{l_b}{p}_{\left[u\right]b}[K+(1-K)u^{{\alpha }_{\left[u\right]b}}]\}<l_b\{t_c+\sum _{u=1}^{l_c}{p}_{\left[u\right]c}[K+(1-K)u^{{\alpha }_{\left[u\right]c}}]\},\end{array}$$

(17)

$$\begin{array}{c}\hfill \frac{t_b+{\displaystyle \sum _{u=1}^{l_b}}{p}_{\left[u\right]b}[K+(1-K)u^{{\alpha }_{\left[u\right]b}}]}{l_b}<\frac{t_c+{\displaystyle \sum _{u=1}^{l_c}}{p}_{\left[u\right]c}[K+(1-K)u^{{\alpha }_{\left[u\right]c}}]}{l_c}.\end{array}$$

(18)

The third term can be solved by the assignment method.

$$\begin{array}{cc}\hfill & min\sum _{u=1}^{l_{\left[v\right]}}\sum _{h=1}^{l_{\left[v\right]}}(l_{\left[v\right]}-h+1)p_{\left[u\right]\left[v\right]}[K+(1-K)h^{{\alpha }_{\left[u\right]\left[v\right]}}]e_{u\left[v\right]h},\hfill \\ \hfill & \begin{array}{ccc}\hfill s.t.& \hfill \sum _{h=1}^{l_{\left[v\right]}}{e}_{u\left[v\right]h}=1,& \hfill v=1,\dots ,t;u=1,\dots ,l_{\left[v\right]},\\ \hfill & \hfill \sum _{u=1}^{l_{\left[v\right]}}{e}_{u\left[v\right]h}=1,& \hfill v=1,\dots ,t;h=1,\dots ,l_{\left[v\right]},\\ \hfill & \hfill e_{u\left[v\right]h}=0,or1,& \hfill v=1,\dots ,t;u,h=1,\dots ,l_{\left[v\right]}.\end{array}\hfill \end{array}$$

(19)

   □

The algorithm is summarized as follows:

It is easy to show that the total time for Algorithm 3 is $O\left(n^3\right)$.

Algorithm 3  $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K)s^{{\alpha }_{\left[u\right]\left[v\right]}}],GT,t_v|{\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$

Require:  t, K, $l_v$, $t_v$, $p_{uv}$, ${\alpha }_{uv}$ Ensure:  The job sequence within the group, group sequence and ${\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$   1: First step: Using the assignment method, the job sequence within the group is solved.   2: Second step: Calculate the order of the groups by nondecreasing order of $\frac{t_b+{\displaystyle \sum _{u=1}^{l_b}}{p}_{\left[u\right]b}[K+(1-K)u^{{\alpha }_{\left[u\right]b}}]}{l_b}$.   3: Last step: Calculate ${\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$.

Example 2.

The conditions are the same as in Example 1 and the objective function is changed from $C_{max}$ to ${\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$.

Solution:

By the assignment method, the order of the jobs is $jo{b}_{31}\to jo{b}_{21}\to jo{b}_{11}$ in $G_1$ and the order of the jobs is $jo{b}_{12}\to jo{b}_{22}$ in $G_2$.

$$\begin{array}{c}\hfill f\left(G_1\right)=\frac{t_1+{\displaystyle \sum _{u=1}^{l_1}}{p}_{\left[u\right]1}[K+(1-K)u^{{\alpha }_{\left[u\right]1}}]}{l_1}=\frac{2+{\displaystyle \sum _{u=1}^3}{p}_{\left[u\right]1}[0.5+0.5\times u^{{\alpha }_{\left[u\right]1}}]}{3}=5.12,\\ \hfill f\left(G_2\right)=\frac{t_2+{\displaystyle \sum _{u=1}^{l_2}}{p}_{\left[u\right]2}[K+(1-K)u^{{\alpha }_{\left[u\right]2}}]}{l_2}=\frac{3+{\displaystyle \sum _{u=1}^2}{p}_{\left[u\right]2}[0.5+0.5\times u^{{\alpha }_{\left[u\right]2}}]}{2}=4.29.\end{array}$$

(20)

Therefore, the order of the groups is $G_2\to G_1$.

$$\begin{array}{c}\hfill \sum _{v=1}^2\sum _{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}=3+4+8.57+13.57+18.4+23.92=71.46.\end{array}$$

(21)

The proof of the $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{s-1}],GT,t_v|{\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$ problem is the same as that of Theorem 3.

Theorem 4.

For the $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{s-1}],GT,t_v|{\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$ problem, the optimal solution is that the job sequence within the group can be solved by the assignment method and the groups are arranged in nondecreasing order of $\frac{t_b+{\displaystyle \sum _{u=1}^{l_b}}{p}_{\left[u\right]b}[K+(1-K){\beta }_{\left[u\right]b}^{s-1}]}{l_b}$.

The algorithm is summarized as follows:

It is easy to show that the total time for Algorithm 4 is $O\left(n^3\right)$.

Algorithm 4  $1|p_{\left[u\right]\left[v\right]}^a=p_{\left[u\right]\left[v\right]}[K+(1-K){\beta }_{\left[u\right]\left[v\right]}^{s-1}],GT,t_v|{\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$

Require:  t, K, $l_v$, $t_v$, $p_{uv}$, ${\beta }_{uv}$ Ensure:  The job sequence within the group, group sequence and ${\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$   1: First step: Using the assignment method, the job sequence within the group is solved.   2: Second step: Calculate the order of the groups by nondecreasing order of $\frac{t_b+{\displaystyle \sum _{u=1}^{l_b}}{p}_{\left[u\right]b}[K+(1-K){\beta }_{\left[u\right]b}^{s-1}]}{l_b}$.   3: Last step: Calculate ${\sum }_{v=1}^t{\sum }_{u=1}^{l_v}{C}_{\left[u\right]\left[v\right]}$.

5. Conclusions

This paper considered the single-group scheduling models with Pegels’ and DeJong’s learning effect and the single-group scheduling models with Pegels’ and DeJong’s aging effect. When $0<K<1$, they are the learning scheduling models. When $K>1$, they are the aging scheduling models. In a classical scheduling model, Pegels’ and DeJong’s learning effect is a constant or position-dependent, while the learning effect and aging effect were job-dependent in this paper. Compared with the classical learning model and aging model for scheduling, the proposed models were more general and realistic. The objective functions were to minimize the total completion time and makespan. We proposed polynomial time methods to solve all the studied problems.

In the future, we can also consider the multimachine Pegels’ and Dejong’s learning scheduling.

6. Limitations

The problem comes from a real production scheduling problem. In some practical single-group scheduling problems, the learning effect and aging effect are job-dependent. We conducted a deep research study on this issue to prove whether it was an NP-hard problem or polynomial-time solvable problem. After a long period of exploration, the present result was achieved.