# American Institute of Mathematical Sciences

• Previous Article
The skewness for uncertain random variable and application to portfolio selection problem
• JIMO Home
• This Issue
• Next Article
Optimal production and emission reduction policies for a remanufacturing firm considering deferred payment strategy
doi: 10.3934/jimo.2021008

## A unified analysis for scheduling problems with variable processing times

 1 School of Science, Shenyang Aerospace University, Shenyang 110136, China 2 Post-doctoral Mobile Station, Dalian Commodity Exchange, Dalian, China

*Corresponding author: Ji-Bo Wang

Received  June 2020 Revised  October 2020 Published  January 2021

This paper considers single-machine scheduling problems with variable processing times, in which the actual processing time of a job is a function of its additional resources, starting time, and position in a sequence. Four problems arising from two criteria (a scheduling cost and a total resource consumption cost) are investigated. Under the linear and convex resource consumption functions, we provide unified approaches and consequently prove that these four problems are solvable in polynomial time.

Citation: Ji-Bo Wang, Bo Zhang, Hongyu He. A unified analysis for scheduling problems with variable processing times. Journal of Industrial & Management Optimization, doi: 10.3934/jimo.2021008
##### References:

show all references

##### References:
List of notations
 notations definitions $n$ total number of jobs $J_i$ index of job $\bar{p}_i$ normal processing time of job $J_i$ $C_i$ completion time of job $J_i$ $W_i$ waiting time of job $J_i$ $p_i$ actual processing time of job $J_i$ $d_i$ due date of job $J_i$ $E_i$ earliness of job $J_i$ $T_i$ tardiness of job $J_i$ $u_i$ amount of resources allocated to job $J_i$ $\bar{u}_i$ the upper bound of $u_i$ $\theta_i$ compression rate corresponding to job $J_i$ $v_i$ the cost allocated to job $J_i$ $\varphi_i$ positional weight of $ith$ position $[i]$ the job that is placed in $ith$ position $A$ a truncation parameter $t$ starting process time of some job $b$ common deterioration rate $\sigma$ sequence of all jobs $C_{\max}$ makespan $\sum_{i=1}^n C_{i}$ total completion time $\sum_{i=1}^n W_{i}$ total waiting time $\sum_{i=1}^n\sum_{j=i}^n|C_i-C_j|$ total absolute differences in completion times $\sum_{i=1}^n\sum_{j=i}^n|W_i-W_j|$ total absolute differences in waiting times
 notations definitions $n$ total number of jobs $J_i$ index of job $\bar{p}_i$ normal processing time of job $J_i$ $C_i$ completion time of job $J_i$ $W_i$ waiting time of job $J_i$ $p_i$ actual processing time of job $J_i$ $d_i$ due date of job $J_i$ $E_i$ earliness of job $J_i$ $T_i$ tardiness of job $J_i$ $u_i$ amount of resources allocated to job $J_i$ $\bar{u}_i$ the upper bound of $u_i$ $\theta_i$ compression rate corresponding to job $J_i$ $v_i$ the cost allocated to job $J_i$ $\varphi_i$ positional weight of $ith$ position $[i]$ the job that is placed in $ith$ position $A$ a truncation parameter $t$ starting process time of some job $b$ common deterioration rate $\sigma$ sequence of all jobs $C_{\max}$ makespan $\sum_{i=1}^n C_{i}$ total completion time $\sum_{i=1}^n W_{i}$ total waiting time $\sum_{i=1}^n\sum_{j=i}^n|C_i-C_j|$ total absolute differences in completion times $\sum_{i=1}^n\sum_{j=i}^n|W_i-W_j|$ total absolute differences in waiting times
Models studied
 Ref. Problem Relation with this article Due date methods Complexity Wang et al. [29] $1|p_i=\bar{p}_ir^a+bt-\theta_iu_i|\delta_1C_{\max}+\delta_2\sum_{i=1}^nC_{i}+\delta_3\sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|+\delta_4\sum_{i=1}^nv_iu_i$ $1|p_i=\bar{p}_ir^a+bt-\theta_iu_i|\delta_1C_{\max}+\delta_2\sum_{i=1}^nW_{i}+\delta_3\sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|+\delta_4\sum_{i=1}^nv_iu_i$ $p_i$ is type 1b $g(r)=r^a$, $A=0$ $p_i$ is type 1b $g(r)=r^a$, $A=0$ $O(n^3)$ $O(n^3)$ Li et al. [12] $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a|\delta_1C_{\max}+\delta_2\sum_{i=1}^nC_{i}+\delta_3\sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|+\delta_4\sum_{i=1}^nv_iu_i$ $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a|\delta_1C_{\max}+\delta_2\sum_{i=1}^nW_{i}+\delta_3\sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|+\delta_4\sum_{i=1}^nv_iu_i$ $p_i$ is type 2a $g(r)=r^a$, $A=0$ $p_i$ is type 2a $g(r)=r^a$, $A=0$ $O(n\log n)$ $O(n\log n)$ Sun et al. [23] $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a|\sum_{i=1}^n(\alpha E_i+\beta T_i+\gamma d_i+v_iu_i)$ $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a, \sum_{i=1}^nu_i\leq U|\sum_{i=1}^n(\alpha E_i+\beta T_i+\gamma d_i)$ $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a, \sum_{i=1}^n(\alpha E_i+\beta T_i+\gamma d_i)\leq V|\sum_{i=1}^nu_i$ $p_i$ is type 2a $g(r)=r^a, A=0$ $p_i$ is type 2a $g(r)=r^a$, $A=0$ $p_i$ is type 2a $g(r)=r^a$, $A=0$ CON/SLK/DIF CON/SLK/DIF CON/SLK/DIF $O(nlogn)$ $O(n\log n)$ $O(n\log n)$ Wang et al. [27] $1|p_i=\bar{p}_i\max\{r^{a_i}, A\}+bt-\theta_iu_i|\beta_1P+\beta_2\sum_{i=1}^nv_iu_i, P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|\right\}$ $1|p_i=\left(\frac{\bar{p}_i\max\{r^{a_i}, A\}}{u_i}\right)^k+bt|\beta_1P+\beta_2\sum_{i=1}^nv_iu_i, P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|\right\}$ $1|p_i=\left(\frac{\bar{p}_i\max\{r^{a_i}, A\}}{u_i}\right)^k+bt, \sum_{i=1}^nu_i\leq U|P, P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|\right\}$ $1|p_i=\left(\frac{\bar{p}_i\max\{r^{a_i}, A\}}{u_i}\right)^k+bt, P\leq V|\sum_{i=1}^nu_i, P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|\right\}$ $p_i$ is type 1b $g(r)=r^{a_i}$ $p_i$ is type 2b $g(r)=r^{a_i}$ $p_i$ is type 2b $g(r)=r^{a_i}$ $p_i$ is type 2b $g(r)=r^{a_i}$ $O(n\log n)$ $O(n\log n)$ $O(n\log n)$ $O(n\log n)$ Liu et al. [15] $1|p_i=(\bar{p}_i-bt)g(r)-\theta_iu_i|\sum(\alpha E_i+\beta T_i+\gamma d_i^1+\delta D)+\sigma C_{\max}+\eta\sum v_iu_i$ $1|\left(\left(\frac{\bar{p}_i}{u_i}\right)^k-bt\right)g(r)|\sum(\alpha E_i+\beta T_i+\gamma d_i^1+\delta D)+\sigma C_{\max}+\eta\sum v_iu_i$ $1|\left(\left(\frac{\bar{p}_i}{u_i}\right)^k-bt\right)g(r), \sum(\alpha E_i+\beta T_i+\gamma d_i^1+\delta D)+\sigma C_{\max}\leq V|\sum v_iu_i$ $1|\left(\left(\frac{\bar{p}_i}{u_i}\right)^k-bt\right)g(r), \sum u_i \leq U|\sum(\alpha E_i+\beta T_i+\gamma d_i^1+\delta D)+\sigma C_{\max}$ $p_i$ is type 1a $A=0$ $p_i$ is type 2a $A=0$ $p_i$ is type 2a $A=0$ $p_i$ is type 2a $A=0$ CON/SLK/DIF due window CON/SLK/DIF due window CON/SLK/DIF due window CON/SLK/DIF due window $O(n^3)$ $O(n\log n)$ $O(n\log n)$ h$O(n\log n)$ This paper P1: $1|p_i\in\{\mbox {type 1a, type 1b}\}|\sum_{i=1}^np_{[i]}\varphi_i+\eta\sum_{i=1}^nv_iu_i$ P1: $1|p_i\in\{\mbox{type 1a, type 1b}\}|P+\eta\sum_{i=1}^nv_iu_i$ $P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^nW_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|, \sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|, \sum_{i=1}^n(\alpha E_i +\beta T_i+ \gamma d_i)\right\}$ P2: $1|p_i\in\{\mbox {type 2a, type 2b}\}|P+\eta\sum_{i=1}^nv_iu_i$hP2: $1|p_i\in\{\mbox {type 2a, type 2b}\}|\sum_{i=1}^np_{[i]}\varphi_i+\eta\sum_{i=1}^nv_iu_i$ P2: $1|p_i\in\{\mbox {type 2a, type 2b}\}|P+\eta\sum_{i=1}^nv_iu_i$ $P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^nW_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|, \sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|, \sum_{i=1}^n(\alpha E_i +\beta T_i+ \gamma d_i)\right\}$ P3: $1|p_i\in\{\mbox{type 2a, type 2b}\}, \sum_{i=1}^np_{[i]}\varphi_i\leq \bar{Z}|\sum_{i=1}^nv_iu_i$ P3: $1|p_i\in\{\mbox{type 2a, type 2b}\}, P\leq \bar{Z}|\sum_{i=1}^nv_iu_i$ $P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^nW_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|, \sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|, \sum_{i=1}^n(\alpha E_i +\beta T_i+ \gamma d_i)\right\}$ P4: $1|p_i\in\{\mbox{type 2a, type 2b}\}, \sum_{i=1}^nv_iu_i\leq\bar{V}|\sum_{i=1}^np_{[i]}\psi_i$ P4: $1|p_i\in\{\mbox{type 2a, type 2b}\}, \sum_{i=1}^nv_iu_i\leq\bar{V}|P$ $P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^nW_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|, \sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|, \sum_{i=1}^n(\alpha E_i +\beta T_i+ \gamma d_i)\right\}$ $p_i$ is type 1a/1b $p_i$ is type 1a/1b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $O(n^3)$ $O(n^3)$ $O(n\log n)$ $o(n\log n)$ $O(n\log n)$ $o(n\log n)$ $O(n\log n)$ $o(n\log n)$ $W_i$, $T_i, E_i$ is the waiting time, earliness, tardiness of job $J_i$, respectively; $C_{max}$ is the makespan of all jobs; $\delta_1, \delta_2, \delta_3, \delta_4, \alpha, \beta, \gamma, \delta, \sigma, \beta_1, \beta_2, U$ and $V$ are given constants
 Ref. Problem Relation with this article Due date methods Complexity Wang et al. [29] $1|p_i=\bar{p}_ir^a+bt-\theta_iu_i|\delta_1C_{\max}+\delta_2\sum_{i=1}^nC_{i}+\delta_3\sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|+\delta_4\sum_{i=1}^nv_iu_i$ $1|p_i=\bar{p}_ir^a+bt-\theta_iu_i|\delta_1C_{\max}+\delta_2\sum_{i=1}^nW_{i}+\delta_3\sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|+\delta_4\sum_{i=1}^nv_iu_i$ $p_i$ is type 1b $g(r)=r^a$, $A=0$ $p_i$ is type 1b $g(r)=r^a$, $A=0$ $O(n^3)$ $O(n^3)$ Li et al. [12] $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a|\delta_1C_{\max}+\delta_2\sum_{i=1}^nC_{i}+\delta_3\sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|+\delta_4\sum_{i=1}^nv_iu_i$ $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a|\delta_1C_{\max}+\delta_2\sum_{i=1}^nW_{i}+\delta_3\sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|+\delta_4\sum_{i=1}^nv_iu_i$ $p_i$ is type 2a $g(r)=r^a$, $A=0$ $p_i$ is type 2a $g(r)=r^a$, $A=0$ $O(n\log n)$ $O(n\log n)$ Sun et al. [23] $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a|\sum_{i=1}^n(\alpha E_i+\beta T_i+\gamma d_i+v_iu_i)$ $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a, \sum_{i=1}^nu_i\leq U|\sum_{i=1}^n(\alpha E_i+\beta T_i+\gamma d_i)$ $1|p_i=\left(\left(\frac{\bar{p}_i}{u_i}\right)^k+bt\right)r^a, \sum_{i=1}^n(\alpha E_i+\beta T_i+\gamma d_i)\leq V|\sum_{i=1}^nu_i$ $p_i$ is type 2a $g(r)=r^a, A=0$ $p_i$ is type 2a $g(r)=r^a$, $A=0$ $p_i$ is type 2a $g(r)=r^a$, $A=0$ CON/SLK/DIF CON/SLK/DIF CON/SLK/DIF $O(nlogn)$ $O(n\log n)$ $O(n\log n)$ Wang et al. [27] $1|p_i=\bar{p}_i\max\{r^{a_i}, A\}+bt-\theta_iu_i|\beta_1P+\beta_2\sum_{i=1}^nv_iu_i, P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|\right\}$ $1|p_i=\left(\frac{\bar{p}_i\max\{r^{a_i}, A\}}{u_i}\right)^k+bt|\beta_1P+\beta_2\sum_{i=1}^nv_iu_i, P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|\right\}$ $1|p_i=\left(\frac{\bar{p}_i\max\{r^{a_i}, A\}}{u_i}\right)^k+bt, \sum_{i=1}^nu_i\leq U|P, P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|\right\}$ $1|p_i=\left(\frac{\bar{p}_i\max\{r^{a_i}, A\}}{u_i}\right)^k+bt, P\leq V|\sum_{i=1}^nu_i, P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|\right\}$ $p_i$ is type 1b $g(r)=r^{a_i}$ $p_i$ is type 2b $g(r)=r^{a_i}$ $p_i$ is type 2b $g(r)=r^{a_i}$ $p_i$ is type 2b $g(r)=r^{a_i}$ $O(n\log n)$ $O(n\log n)$ $O(n\log n)$ $O(n\log n)$ Liu et al. [15] $1|p_i=(\bar{p}_i-bt)g(r)-\theta_iu_i|\sum(\alpha E_i+\beta T_i+\gamma d_i^1+\delta D)+\sigma C_{\max}+\eta\sum v_iu_i$ $1|\left(\left(\frac{\bar{p}_i}{u_i}\right)^k-bt\right)g(r)|\sum(\alpha E_i+\beta T_i+\gamma d_i^1+\delta D)+\sigma C_{\max}+\eta\sum v_iu_i$ $1|\left(\left(\frac{\bar{p}_i}{u_i}\right)^k-bt\right)g(r), \sum(\alpha E_i+\beta T_i+\gamma d_i^1+\delta D)+\sigma C_{\max}\leq V|\sum v_iu_i$ $1|\left(\left(\frac{\bar{p}_i}{u_i}\right)^k-bt\right)g(r), \sum u_i \leq U|\sum(\alpha E_i+\beta T_i+\gamma d_i^1+\delta D)+\sigma C_{\max}$ $p_i$ is type 1a $A=0$ $p_i$ is type 2a $A=0$ $p_i$ is type 2a $A=0$ $p_i$ is type 2a $A=0$ CON/SLK/DIF due window CON/SLK/DIF due window CON/SLK/DIF due window CON/SLK/DIF due window $O(n^3)$ $O(n\log n)$ $O(n\log n)$ h$O(n\log n)$ This paper P1: $1|p_i\in\{\mbox {type 1a, type 1b}\}|\sum_{i=1}^np_{[i]}\varphi_i+\eta\sum_{i=1}^nv_iu_i$ P1: $1|p_i\in\{\mbox{type 1a, type 1b}\}|P+\eta\sum_{i=1}^nv_iu_i$ $P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^nW_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|, \sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|, \sum_{i=1}^n(\alpha E_i +\beta T_i+ \gamma d_i)\right\}$ P2: $1|p_i\in\{\mbox {type 2a, type 2b}\}|P+\eta\sum_{i=1}^nv_iu_i$hP2: $1|p_i\in\{\mbox {type 2a, type 2b}\}|\sum_{i=1}^np_{[i]}\varphi_i+\eta\sum_{i=1}^nv_iu_i$ P2: $1|p_i\in\{\mbox {type 2a, type 2b}\}|P+\eta\sum_{i=1}^nv_iu_i$ $P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^nW_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|, \sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|, \sum_{i=1}^n(\alpha E_i +\beta T_i+ \gamma d_i)\right\}$ P3: $1|p_i\in\{\mbox{type 2a, type 2b}\}, \sum_{i=1}^np_{[i]}\varphi_i\leq \bar{Z}|\sum_{i=1}^nv_iu_i$ P3: $1|p_i\in\{\mbox{type 2a, type 2b}\}, P\leq \bar{Z}|\sum_{i=1}^nv_iu_i$ $P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^nW_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|, \sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|, \sum_{i=1}^n(\alpha E_i +\beta T_i+ \gamma d_i)\right\}$ P4: $1|p_i\in\{\mbox{type 2a, type 2b}\}, \sum_{i=1}^nv_iu_i\leq\bar{V}|\sum_{i=1}^np_{[i]}\psi_i$ P4: $1|p_i\in\{\mbox{type 2a, type 2b}\}, \sum_{i=1}^nv_iu_i\leq\bar{V}|P$ $P\in\left\{C_{\max}, \sum_{i=1}^nC_i, \sum_{i=1}^nW_i, \sum_{i=1}^n\sum_{j=1}^i|C_i-C_j|, \sum_{i=1}^n\sum_{j=1}^i|W_i-W_j|, \sum_{i=1}^n(\alpha E_i +\beta T_i+ \gamma d_i)\right\}$ $p_i$ is type 1a/1b $p_i$ is type 1a/1b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $p_i$ is type 2a/2b $O(n^3)$ $O(n^3)$ $O(n\log n)$ $o(n\log n)$ $O(n\log n)$ $o(n\log n)$ $O(n\log n)$ $o(n\log n)$ $W_i$, $T_i, E_i$ is the waiting time, earliness, tardiness of job $J_i$, respectively; $C_{max}$ is the makespan of all jobs; $\delta_1, \delta_2, \delta_3, \delta_4, \alpha, \beta, \gamma, \delta, \sigma, \beta_1, \beta_2, U$ and $V$ are given constants
 [1] Shuang Zhao. Resource allocation flowshop scheduling with learning effect and slack due window assignment. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020096 [2] Chunlai Liu, Yanpeng Fan, Chuanli Zhao, Jianjun Wang. Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs. Journal of Industrial & Management Optimization, 2017, 13 (2) : 713-720. doi: 10.3934/jimo.2016042 [3] Cuixia Miao, Yuzhong Zhang. Scheduling with step-deteriorating jobs to minimize the makespan. Journal of Industrial & Management Optimization, 2019, 15 (4) : 1955-1964. doi: 10.3934/jimo.2018131 [4] Wenchang Luo, Lin Chen. Approximation schemes for scheduling a maintenance and linear deteriorating jobs. Journal of Industrial & Management Optimization, 2012, 8 (2) : 271-283. doi: 10.3934/jimo.2012.8.271 [5] Imed Kacem, Eugene Levner. An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs. Journal of Industrial & Management Optimization, 2016, 12 (3) : 811-817. doi: 10.3934/jimo.2016.12.811 [6] Mehmet Duran Toksari, Emel Kizilkaya Aydogan, Berrin Atalay, Saziye Sari. Some scheduling problems with sum of logarithm processing times based learning effect and exponential past sequence dependent delivery times. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021044 [7] Shan-Shan Lin. Due-window assignment scheduling with learning and deterioration effects. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021081 [8] Le Thi Hoai An, Tran Duc Quynh, Kondo Hloindo Adjallah. A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors. Journal of Industrial & Management Optimization, 2014, 10 (1) : 243-258. doi: 10.3934/jimo.2014.10.243 [9] Peng Guo, Wenming Cheng, Yi Wang. A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs. Journal of Industrial & Management Optimization, 2014, 10 (4) : 1071-1090. doi: 10.3934/jimo.2014.10.1071 [10] Ji-Bo Wang, Mengqi Liu, Na Yin, Ping Ji. Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. Journal of Industrial & Management Optimization, 2017, 13 (2) : 1025-1039. doi: 10.3934/jimo.2016060 [11] Chuanli Zhao. An fptas for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs. Journal of Industrial & Management Optimization, 2017, 13 (2) : 587-593. doi: 10.3934/jimo.2016033 [12] Mingbao Cheng, Shuxian Xiao, Guosheng Liu. Single-machine rescheduling problems with learning effect under disruptions. Journal of Industrial & Management Optimization, 2018, 14 (3) : 967-980. doi: 10.3934/jimo.2017085 [13] Qiying Hu, Wuyi Yue. Optimal control for resource allocation in discrete event systems. Journal of Industrial & Management Optimization, 2006, 2 (1) : 63-80. doi: 10.3934/jimo.2006.2.63 [14] Sedighe Asghariniya, Hamed Zhiani Rezai, Saeid Mehrabian. Resource allocation: A common set of weights model. Numerical Algebra, Control & Optimization, 2020, 10 (3) : 257-273. doi: 10.3934/naco.2020001 [15] Irina Kareva, Faina Berezovkaya, Georgy Karev. Mixed strategies and natural selection in resource allocation. Mathematical Biosciences & Engineering, 2013, 10 (5&6) : 1561-1586. doi: 10.3934/mbe.2013.10.1561 [16] Zhe Zhang, Jiuping Xu. Bi-level multiple mode resource-constrained project scheduling problems under hybrid uncertainty. Journal of Industrial & Management Optimization, 2016, 12 (2) : 565-593. doi: 10.3934/jimo.2016.12.565 [17] Xiaoxiao Yuan, Jing Liu, Xingxing Hao. A moving block sequence-based evolutionary algorithm for resource investment project scheduling problems. Big Data & Information Analytics, 2017, 2 (1) : 39-58. doi: 10.3934/bdia.2017007 [18] Xingong Zhang. Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon. Journal of Industrial & Management Optimization, 2020, 16 (1) : 231-244. doi: 10.3934/jimo.2018148 [19] Alexei Korolev, Gennady Ougolnitsky. Optimal resource allocation in the difference and differential Stackelberg games on marketing networks. Journal of Dynamics & Games, 2020, 7 (2) : 141-162. doi: 10.3934/jdg.2020009 [20] Jafar Sadeghi, Mojtaba Ghiyasi, Akram Dehnokhalaji. Resource allocation and target setting based on virtual profit improvement. Numerical Algebra, Control & Optimization, 2020, 10 (2) : 127-142. doi: 10.3934/naco.2019043

2019 Impact Factor: 1.366